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_Array.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 03:25:50,452 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 03:25:50,453 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 03:25:50,466 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 03:25:50,466 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 03:25:50,467 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 03:25:50,468 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 03:25:50,469 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 03:25:50,471 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 03:25:50,472 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 03:25:50,473 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 03:25:50,473 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 03:25:50,474 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 03:25:50,475 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 03:25:50,476 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 03:25:50,477 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 03:25:50,479 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 03:25:50,480 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 03:25:50,481 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 03:25:50,482 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 03:25:50,484 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 03:25:50,484 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 03:25:50,484 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 03:25:50,485 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 03:25:50,485 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 03:25:50,486 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 03:25:50,487 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 03:25:50,487 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 03:25:50,488 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 03:25:50,488 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 03:25:50,488 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 03:25:50,489 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_Array.epf [2018-04-13 03:25:50,498 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 03:25:50,499 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 03:25:50,500 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 03:25:50,500 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 03:25:50,500 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 03:25:50,500 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 03:25:50,500 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 03:25:50,501 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 03:25:50,501 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 03:25:50,501 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 03:25:50,501 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 03:25:50,501 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 03:25:50,501 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 03:25:50,502 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 03:25:50,502 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 03:25:50,502 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 03:25:50,502 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 03:25:50,502 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 03:25:50,502 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 03:25:50,502 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 03:25:50,503 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 03:25:50,503 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 03:25:50,532 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 03:25:50,544 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 03:25:50,549 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 03:25:50,550 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 03:25:50,551 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 03:25:50,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,839 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe6767b6ac [2018-04-13 03:25:50,975 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 03:25:50,975 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 03:25:50,976 INFO L168 CDTParser]: Scanning dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,984 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 03:25:50,984 INFO L215 ultiparseSymbolTable]: [2018-04-13 03:25:50,984 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 03:25:50,985 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,985 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 03:25:50,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsfilcnt64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__ino_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____blkcnt64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__ldiv_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____socklen_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsfilcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__int32_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____mode_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__Colour in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__gid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsblkcnt64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_short in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____time_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__int8_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__key_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsword_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__ssize_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_short in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsfilcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_mutexattr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____timer_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__idtype_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__mode_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____sig_atomic_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____int32_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____nlink_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____ssize_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fd_mask in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__timer_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____pthread_slist_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____int8_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__loff_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__id_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__uint in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_condattr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____rlim64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__dev_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,989 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____qaddr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,989 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____blksize_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,989 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____useconds_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,989 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____daddr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,989 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____key_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,989 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____int64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,989 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__nlink_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,989 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____uid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,989 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_quad_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,989 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint8_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,989 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_mutex_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____blkcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__sigset_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsblkcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__register_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_barrierattr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____syscall_slong_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__time_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_rwlock_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_int in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_key_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__clock_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_rwlockattr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____int16_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint16_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____gid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____off_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____ino64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_long in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_barrier_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_quad_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__ulong in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____ino_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____pid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__ushort in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____quad_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____loff_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__suseconds_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__int64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__fd_mask in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____caddr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__clockid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____dev_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____syscall_ulong_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____clock_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__daddr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int32_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint32_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int8_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__lldiv_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__uid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____id_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsblkcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__fd_set in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__blksize_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__wchar_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_char in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__SLL in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__caddr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____off64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____suseconds_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____sigset_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_once_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_attr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_spinlock_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____rlim_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____clockid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_char in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_long in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__div_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____intptr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__int16_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__size_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__off_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int16_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_cond_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__quad_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:50,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__blkcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:51,008 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe6767b6ac [2018-04-13 03:25:51,012 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 03:25:51,013 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 03:25:51,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 03:25:51,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 03:25:51,018 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 03:25:51,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 03:25:51" (1/1) ... [2018-04-13 03:25:51,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1718b6fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:25:51, skipping insertion in model container [2018-04-13 03:25:51,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 03:25:51" (1/1) ... [2018-04-13 03:25:51,031 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 03:25:51,054 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 03:25:51,184 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 03:25:51,226 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 03:25:51,232 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-13 03:25:51,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:25:51 WrapperNode [2018-04-13 03:25:51,267 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 03:25:51,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 03:25:51,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 03:25:51,268 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 03:25:51,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:25:51" (1/1) ... [2018-04-13 03:25:51,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:25:51" (1/1) ... [2018-04-13 03:25:51,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:25:51" (1/1) ... [2018-04-13 03:25:51,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:25:51" (1/1) ... [2018-04-13 03:25:51,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:25:51" (1/1) ... [2018-04-13 03:25:51,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:25:51" (1/1) ... [2018-04-13 03:25:51,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:25:51" (1/1) ... [2018-04-13 03:25:51,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 03:25:51,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 03:25:51,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 03:25:51,310 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 03:25:51,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:25:51" (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-13 03:25:51,395 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 03:25:51,395 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 03:25:51,396 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 03:25:51,396 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 03:25:51,396 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 03:25:51,396 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 03:25:51,396 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 03:25:51,396 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 03:25:51,396 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 03:25:51,396 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 03:25:51,396 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 03:25:51,396 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 03:25:51,396 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 03:25:51,397 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 03:25:51,397 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 03:25:51,397 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 03:25:51,397 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 03:25:51,397 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 03:25:51,397 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 03:25:51,397 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 03:25:51,397 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 03:25:51,397 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 03:25:51,398 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 03:25:51,398 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 03:25:51,398 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 03:25:51,398 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 03:25:51,398 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 03:25:51,398 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 03:25:51,398 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 03:25:51,398 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 03:25:51,398 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 03:25:51,399 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 03:25:51,399 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 03:25:51,399 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 03:25:51,399 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 03:25:51,399 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 03:25:51,399 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 03:25:51,399 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 03:25:51,399 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 03:25:51,399 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 03:25:51,400 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 03:25:51,400 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 03:25:51,400 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 03:25:51,400 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 03:25:51,400 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 03:25:51,400 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 03:25:51,400 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 03:25:51,400 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 03:25:51,400 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 03:25:51,400 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 03:25:51,401 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 03:25:51,401 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 03:25:51,401 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 03:25:51,401 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 03:25:51,401 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 03:25:51,401 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 03:25:51,401 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 03:25:51,401 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 03:25:51,401 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 03:25:51,402 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 03:25:51,402 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 03:25:51,402 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-13 03:25:51,402 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 03:25:51,402 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 03:25:51,402 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-13 03:25:51,402 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 03:25:51,402 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 03:25:51,402 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-13 03:25:51,402 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 03:25:51,403 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 03:25:51,403 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 03:25:51,403 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 03:25:51,403 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 03:25:51,403 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 03:25:51,403 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 03:25:51,403 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 03:25:51,403 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 03:25:51,403 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 03:25:51,403 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 03:25:51,403 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 03:25:51,404 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 03:25:51,404 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 03:25:51,404 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 03:25:51,404 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 03:25:51,404 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 03:25:51,404 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 03:25:51,404 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 03:25:51,404 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 03:25:51,404 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 03:25:51,404 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 03:25:51,404 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 03:25:51,405 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 03:25:51,405 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 03:25:51,405 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 03:25:51,405 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 03:25:51,405 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 03:25:51,405 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 03:25:51,405 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 03:25:51,405 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 03:25:51,405 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 03:25:51,405 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 03:25:51,406 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 03:25:51,406 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 03:25:51,406 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 03:25:51,406 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 03:25:51,406 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 03:25:51,406 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 03:25:51,406 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-13 03:25:51,406 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 03:25:51,406 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 03:25:51,406 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-13 03:25:51,407 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 03:25:51,407 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-13 03:25:51,407 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 03:25:51,407 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 03:25:51,407 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 03:25:51,407 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 03:25:51,407 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 03:25:51,803 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 03:25:51,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 03:25:51 BoogieIcfgContainer [2018-04-13 03:25:51,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 03:25:51,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 03:25:51,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 03:25:51,806 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 03:25:51,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 03:25:51" (1/3) ... [2018-04-13 03:25:51,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c265d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 03:25:51, skipping insertion in model container [2018-04-13 03:25:51,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:25:51" (2/3) ... [2018-04-13 03:25:51,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c265d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 03:25:51, skipping insertion in model container [2018-04-13 03:25:51,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 03:25:51" (3/3) ... [2018-04-13 03:25:51,809 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-13 03:25:51,816 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-13 03:25:51,824 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 59 error locations. [2018-04-13 03:25:51,858 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 03:25:51,858 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 03:25:51,859 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 03:25:51,859 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-13 03:25:51,859 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-13 03:25:51,859 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 03:25:51,859 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 03:25:51,859 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 03:25:51,859 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 03:25:51,860 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 03:25:51,872 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2018-04-13 03:25:51,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-13 03:25:51,880 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:25:51,881 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:25:51,881 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:25:51,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1080483552, now seen corresponding path program 1 times [2018-04-13 03:25:51,935 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:25:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:25:51,962 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:25:51,997 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-13 03:25:51,998 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:25:51,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 03:25:51,999 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:25:52,000 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-13 03:25:52,000 INFO L182 omatonBuilderFactory]: Interpolants [144#true, 145#false, 146#(= 1 (select |#valid| |main_#t~malloc0.base|)), 147#(= 1 (select |#valid| main_~list~0.base))] [2018-04-13 03:25:52,000 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-13 03:25:52,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 03:25:52,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 03:25:52,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 03:25:52,012 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 4 states. [2018-04-13 03:25:52,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:25:52,175 INFO L93 Difference]: Finished difference Result 157 states and 164 transitions. [2018-04-13 03:25:52,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 03:25:52,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-13 03:25:52,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:25:52,187 INFO L225 Difference]: With dead ends: 157 [2018-04-13 03:25:52,187 INFO L226 Difference]: Without dead ends: 153 [2018-04-13 03:25:52,189 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-13 03:25:52,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-13 03:25:52,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2018-04-13 03:25:52,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-13 03:25:52,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 141 transitions. [2018-04-13 03:25:52,220 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 141 transitions. Word has length 8 [2018-04-13 03:25:52,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:25:52,221 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 141 transitions. [2018-04-13 03:25:52,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 03:25:52,221 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 141 transitions. [2018-04-13 03:25:52,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-13 03:25:52,221 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:25:52,221 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:25:52,221 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:25:52,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1080483551, now seen corresponding path program 1 times [2018-04-13 03:25:52,223 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:25:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:25:52,236 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:25:52,279 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-13 03:25:52,280 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:25:52,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 03:25:52,280 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:25:52,280 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-13 03:25:52,280 INFO L182 omatonBuilderFactory]: Interpolants [441#true, 442#false, 443#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 444#(and (= main_~list~0.offset 0) (= 12 (select |#length| main_~list~0.base)))] [2018-04-13 03:25:52,281 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-13 03:25:52,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 03:25:52,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 03:25:52,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 03:25:52,282 INFO L87 Difference]: Start difference. First operand 134 states and 141 transitions. Second operand 4 states. [2018-04-13 03:25:52,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:25:52,405 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2018-04-13 03:25:52,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 03:25:52,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-13 03:25:52,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:25:52,407 INFO L225 Difference]: With dead ends: 150 [2018-04-13 03:25:52,407 INFO L226 Difference]: Without dead ends: 150 [2018-04-13 03:25:52,408 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-13 03:25:52,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-13 03:25:52,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2018-04-13 03:25:52,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-13 03:25:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2018-04-13 03:25:52,415 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 8 [2018-04-13 03:25:52,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:25:52,415 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2018-04-13 03:25:52,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 03:25:52,416 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2018-04-13 03:25:52,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-13 03:25:52,416 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:25:52,416 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:25:52,416 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:25:52,417 INFO L82 PathProgramCache]: Analyzing trace with hash -595612499, now seen corresponding path program 1 times [2018-04-13 03:25:52,418 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:25:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:25:52,435 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:25:52,473 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-13 03:25:52,473 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:25:52,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 03:25:52,474 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:25:52,474 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-13 03:25:52,474 INFO L182 omatonBuilderFactory]: Interpolants [736#false, 737#(= 1 (select |#valid| main_~list~0.base)), 738#(= 1 (select |#valid| main_~end~0.base)), 735#true] [2018-04-13 03:25:52,474 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-13 03:25:52,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 03:25:52,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 03:25:52,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 03:25:52,475 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand 4 states. [2018-04-13 03:25:52,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:25:52,590 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2018-04-13 03:25:52,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 03:25:52,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-13 03:25:52,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:25:52,591 INFO L225 Difference]: With dead ends: 146 [2018-04-13 03:25:52,591 INFO L226 Difference]: Without dead ends: 146 [2018-04-13 03:25:52,592 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:25:52,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-04-13 03:25:52,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2018-04-13 03:25:52,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-13 03:25:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2018-04-13 03:25:52,596 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 16 [2018-04-13 03:25:52,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:25:52,596 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2018-04-13 03:25:52,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 03:25:52,596 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2018-04-13 03:25:52,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-13 03:25:52,596 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:25:52,596 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:25:52,596 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:25:52,596 INFO L82 PathProgramCache]: Analyzing trace with hash -595612498, now seen corresponding path program 1 times [2018-04-13 03:25:52,598 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:25:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:25:52,616 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:25:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:25:52,653 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:25:52,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 03:25:52,654 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:25:52,654 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-13 03:25:52,654 INFO L182 omatonBuilderFactory]: Interpolants [1017#true, 1018#false, 1019#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 1020#(and (= 0 main_~list~0.offset) (= 12 (select |#length| main_~list~0.base))), 1021#(and (= main_~end~0.offset 0) (= 12 (select |#length| main_~end~0.base)))] [2018-04-13 03:25:52,654 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-13 03:25:52,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:25:52,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:25:52,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:25:52,654 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand 5 states. [2018-04-13 03:25:52,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:25:52,795 INFO L93 Difference]: Finished difference Result 174 states and 185 transitions. [2018-04-13 03:25:52,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 03:25:52,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-13 03:25:52,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:25:52,797 INFO L225 Difference]: With dead ends: 174 [2018-04-13 03:25:52,797 INFO L226 Difference]: Without dead ends: 174 [2018-04-13 03:25:52,797 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-13 03:25:52,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-04-13 03:25:52,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 145. [2018-04-13 03:25:52,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-13 03:25:52,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2018-04-13 03:25:52,804 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 16 [2018-04-13 03:25:52,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:25:52,805 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2018-04-13 03:25:52,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:25:52,805 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2018-04-13 03:25:52,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-13 03:25:52,805 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:25:52,805 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-13 03:25:52,806 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:25:52,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1152961200, now seen corresponding path program 1 times [2018-04-13 03:25:52,807 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:25:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:25:52,818 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:25:52,841 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-13 03:25:52,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:25:52,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 03:25:52,842 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:25:52,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:25:52,842 INFO L182 omatonBuilderFactory]: Interpolants [1345#true, 1346#false, 1347#(= 1 (select |#valid| |main_#t~malloc2.base|)), 1348#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 1349#(= 1 (select |#valid| |main_#t~mem3.base|))] [2018-04-13 03:25:52,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:25:52,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:25:52,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:25:52,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:25:52,842 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand 5 states. [2018-04-13 03:25:53,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:25:53,021 INFO L93 Difference]: Finished difference Result 203 states and 221 transitions. [2018-04-13 03:25:53,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 03:25:53,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-13 03:25:53,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:25:53,022 INFO L225 Difference]: With dead ends: 203 [2018-04-13 03:25:53,022 INFO L226 Difference]: Without dead ends: 203 [2018-04-13 03:25:53,022 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-13 03:25:53,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-04-13 03:25:53,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 144. [2018-04-13 03:25:53,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-13 03:25:53,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2018-04-13 03:25:53,028 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 18 [2018-04-13 03:25:53,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:25:53,028 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2018-04-13 03:25:53,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:25:53,028 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2018-04-13 03:25:53,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-13 03:25:53,028 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:25:53,029 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-13 03:25:53,029 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:25:53,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1152961199, now seen corresponding path program 1 times [2018-04-13 03:25:53,030 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:25:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:25:53,037 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:25:53,065 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-13 03:25:53,065 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:25:53,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 03:25:53,065 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:25:53,065 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-13 03:25:53,066 INFO L182 omatonBuilderFactory]: Interpolants [1701#true, 1702#false, 1703#(and (= 12 (select |#length| |main_#t~malloc2.base|)) (= 0 |main_#t~malloc2.offset|)), 1704#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 1705#(and (= |main_#t~mem3.offset| 0) (= 12 (select |#length| |main_#t~mem3.base|)))] [2018-04-13 03:25:53,066 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-13 03:25:53,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:25:53,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:25:53,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:25:53,066 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand 5 states. [2018-04-13 03:25:53,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:25:53,211 INFO L93 Difference]: Finished difference Result 227 states and 246 transitions. [2018-04-13 03:25:53,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 03:25:53,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-13 03:25:53,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:25:53,212 INFO L225 Difference]: With dead ends: 227 [2018-04-13 03:25:53,212 INFO L226 Difference]: Without dead ends: 227 [2018-04-13 03:25:53,213 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-13 03:25:53,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-04-13 03:25:53,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 143. [2018-04-13 03:25:53,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-13 03:25:53,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2018-04-13 03:25:53,217 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 18 [2018-04-13 03:25:53,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:25:53,218 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2018-04-13 03:25:53,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:25:53,218 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2018-04-13 03:25:53,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-13 03:25:53,218 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:25:53,218 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:25:53,218 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:25:53,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1358009646, now seen corresponding path program 1 times [2018-04-13 03:25:53,219 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:25:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:25:53,231 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:25:53,296 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-13 03:25:53,296 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:25:53,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 03:25:53,296 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:25:53,297 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-13 03:25:53,297 INFO L182 omatonBuilderFactory]: Interpolants [2082#true, 2083#false, 2084#(= (select |#valid| main_~list~0.base) 1), 2085#(= (select |#valid| main_~end~0.base) 1), 2086#(and (= 1 (select |#valid| |main_#t~malloc2.base|)) (not (= main_~end~0.base |main_#t~malloc2.base|))), 2087#(and (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 2088#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 2089#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 2090#(= 1 (select |#valid| |main_#t~mem4.base|))] [2018-04-13 03:25:53,297 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-13 03:25:53,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 03:25:53,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 03:25:53,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-13 03:25:53,298 INFO L87 Difference]: Start difference. First operand 143 states and 154 transitions. Second operand 9 states. [2018-04-13 03:25:53,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:25:53,584 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2018-04-13 03:25:53,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 03:25:53,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-04-13 03:25:53,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:25:53,585 INFO L225 Difference]: With dead ends: 157 [2018-04-13 03:25:53,585 INFO L226 Difference]: Without dead ends: 157 [2018-04-13 03:25:53,585 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-04-13 03:25:53,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-04-13 03:25:53,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 142. [2018-04-13 03:25:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-13 03:25:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2018-04-13 03:25:53,589 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 22 [2018-04-13 03:25:53,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:25:53,589 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2018-04-13 03:25:53,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 03:25:53,589 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2018-04-13 03:25:53,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-13 03:25:53,590 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:25:53,590 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:25:53,590 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:25:53,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1358009645, now seen corresponding path program 1 times [2018-04-13 03:25:53,591 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:25:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:25:53,602 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:25:53,710 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-13 03:25:53,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:25:53,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-13 03:25:53,711 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:25:53,715 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-13 03:25:53,715 INFO L182 omatonBuilderFactory]: Interpolants [2400#true, 2401#false, 2402#(= (select |#valid| main_~list~0.base) 1), 2403#(= (select |#valid| main_~end~0.base) 1), 2404#(and (not (= main_~end~0.base |main_#t~malloc2.base|)) (= 12 (select |#length| |main_#t~malloc2.base|)) (= 0 |main_#t~malloc2.offset|)), 2405#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 2406#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 2407#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 2408#(and (= 12 (select |#length| |main_#t~mem4.base|)) (= 0 |main_#t~mem4.offset|)), 2409#(and (= main_~end~0.offset 0) (= 12 (select |#length| main_~end~0.base)))] [2018-04-13 03:25:53,715 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-13 03:25:53,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 03:25:53,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 03:25:53,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-13 03:25:53,716 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 10 states. [2018-04-13 03:25:54,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:25:54,143 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2018-04-13 03:25:54,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 03:25:54,143 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-04-13 03:25:54,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:25:54,144 INFO L225 Difference]: With dead ends: 162 [2018-04-13 03:25:54,144 INFO L226 Difference]: Without dead ends: 162 [2018-04-13 03:25:54,145 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-04-13 03:25:54,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-13 03:25:54,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 136. [2018-04-13 03:25:54,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-13 03:25:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-04-13 03:25:54,149 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 22 [2018-04-13 03:25:54,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:25:54,149 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-04-13 03:25:54,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 03:25:54,149 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-04-13 03:25:54,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 03:25:54,150 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:25:54,150 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-13 03:25:54,150 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:25:54,150 INFO L82 PathProgramCache]: Analyzing trace with hash -582468992, now seen corresponding path program 1 times [2018-04-13 03:25:54,151 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:25:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:25:54,161 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:25:54,190 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-13 03:25:54,190 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:25:54,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 03:25:54,190 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:25:54,190 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-13 03:25:54,190 INFO L182 omatonBuilderFactory]: Interpolants [2730#true, 2731#false, 2732#(not (= 0 |main_#t~malloc0.base|)), 2733#(not (= 0 main_~list~0.base)), 2734#(not (= 0 main_~end~0.base))] [2018-04-13 03:25:54,191 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-13 03:25:54,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:25:54,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:25:54,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:25:54,191 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 5 states. [2018-04-13 03:25:54,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:25:54,276 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2018-04-13 03:25:54,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 03:25:54,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-13 03:25:54,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:25:54,278 INFO L225 Difference]: With dead ends: 158 [2018-04-13 03:25:54,278 INFO L226 Difference]: Without dead ends: 158 [2018-04-13 03:25:54,278 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-13 03:25:54,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-13 03:25:54,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 136. [2018-04-13 03:25:54,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-13 03:25:54,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2018-04-13 03:25:54,281 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 28 [2018-04-13 03:25:54,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:25:54,281 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2018-04-13 03:25:54,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:25:54,281 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2018-04-13 03:25:54,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 03:25:54,282 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:25:54,282 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:25:54,282 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:25:54,282 INFO L82 PathProgramCache]: Analyzing trace with hash -863319961, now seen corresponding path program 1 times [2018-04-13 03:25:54,283 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:25:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:25:54,290 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:25:54,343 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-13 03:25:54,343 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:25:54,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 03:25:54,343 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:25:54,343 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-13 03:25:54,344 INFO L182 omatonBuilderFactory]: Interpolants [3033#true, 3034#false, 3035#(= |main_#t~mem9| (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))), 3036#(= ~unnamed2~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))), 3037#(= ~unnamed2~0~BLACK |main_#t~mem10|)] [2018-04-13 03:25:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:25:54,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:25:54,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:25:54,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:25:54,344 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand 5 states. [2018-04-13 03:25:54,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:25:54,444 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2018-04-13 03:25:54,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 03:25:54,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-13 03:25:54,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:25:54,445 INFO L225 Difference]: With dead ends: 147 [2018-04-13 03:25:54,445 INFO L226 Difference]: Without dead ends: 147 [2018-04-13 03:25:54,446 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-13 03:25:54,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-13 03:25:54,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 135. [2018-04-13 03:25:54,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-13 03:25:54,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 143 transitions. [2018-04-13 03:25:54,451 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 143 transitions. Word has length 29 [2018-04-13 03:25:54,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:25:54,451 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 143 transitions. [2018-04-13 03:25:54,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:25:54,451 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 143 transitions. [2018-04-13 03:25:54,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 03:25:54,452 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:25:54,452 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:25:54,452 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:25:54,453 INFO L82 PathProgramCache]: Analyzing trace with hash 759542753, now seen corresponding path program 1 times [2018-04-13 03:25:54,454 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:25:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:25:54,464 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:25:54,514 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-13 03:25:54,514 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:25:54,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 03:25:54,515 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:25:54,515 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-13 03:25:54,515 INFO L182 omatonBuilderFactory]: Interpolants [3322#true, 3323#false, 3324#(and (= 0 |main_#t~malloc6.offset|) (= 12 (select |#length| |main_#t~malloc6.base|))), 3325#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 3326#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= |main_#t~mem7.offset| 0))] [2018-04-13 03:25:54,515 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-13 03:25:54,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:25:54,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:25:54,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:25:54,516 INFO L87 Difference]: Start difference. First operand 135 states and 143 transitions. Second operand 5 states. [2018-04-13 03:25:54,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:25:54,759 INFO L93 Difference]: Finished difference Result 233 states and 248 transitions. [2018-04-13 03:25:54,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 03:25:54,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-13 03:25:54,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:25:54,760 INFO L225 Difference]: With dead ends: 233 [2018-04-13 03:25:54,760 INFO L226 Difference]: Without dead ends: 233 [2018-04-13 03:25:54,761 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-13 03:25:54,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-13 03:25:54,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 134. [2018-04-13 03:25:54,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-13 03:25:54,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-04-13 03:25:54,764 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 29 [2018-04-13 03:25:54,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:25:54,765 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-04-13 03:25:54,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:25:54,765 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-04-13 03:25:54,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 03:25:54,766 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:25:54,766 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:25:54,766 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:25:54,766 INFO L82 PathProgramCache]: Analyzing trace with hash 759542752, now seen corresponding path program 1 times [2018-04-13 03:25:54,767 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:25:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:25:54,777 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:25:54,810 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-13 03:25:54,811 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:25:54,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 03:25:54,811 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:25:54,811 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-13 03:25:54,811 INFO L182 omatonBuilderFactory]: Interpolants [3700#true, 3701#false, 3702#(= 1 (select |#valid| |main_#t~malloc6.base|)), 3703#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 3704#(= 1 (select |#valid| |main_#t~mem7.base|))] [2018-04-13 03:25:54,812 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-13 03:25:54,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:25:54,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:25:54,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:25:54,813 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 5 states. [2018-04-13 03:25:54,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:25:54,937 INFO L93 Difference]: Finished difference Result 204 states and 218 transitions. [2018-04-13 03:25:54,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 03:25:54,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-13 03:25:54,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:25:54,938 INFO L225 Difference]: With dead ends: 204 [2018-04-13 03:25:54,938 INFO L226 Difference]: Without dead ends: 204 [2018-04-13 03:25:54,939 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-13 03:25:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-13 03:25:54,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2018-04-13 03:25:54,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-13 03:25:54,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-04-13 03:25:54,941 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 29 [2018-04-13 03:25:54,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:25:54,941 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-04-13 03:25:54,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:25:54,941 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-04-13 03:25:54,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 03:25:54,942 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:25:54,942 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:25:54,942 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:25:54,942 INFO L82 PathProgramCache]: Analyzing trace with hash -375834398, now seen corresponding path program 1 times [2018-04-13 03:25:54,943 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:25:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:25:54,955 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:25:55,019 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-13 03:25:55,020 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:25:55,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 03:25:55,020 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:25:55,020 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-13 03:25:55,021 INFO L182 omatonBuilderFactory]: Interpolants [4048#(= (select |#valid| main_~end~0.base) 1), 4049#(and (not (= main_~end~0.base |main_#t~malloc6.base|)) (= 1 (select |#valid| |main_#t~malloc6.base|))), 4050#(and (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 4051#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base |main_#t~mem7.base|))), 4052#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 4053#(= 1 (select |#valid| |main_#t~mem8.base|)), 4046#true, 4047#false] [2018-04-13 03:25:55,021 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-13 03:25:55,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 03:25:55,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 03:25:55,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-13 03:25:55,021 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 8 states. [2018-04-13 03:25:55,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:25:55,264 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-04-13 03:25:55,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 03:25:55,264 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-04-13 03:25:55,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:25:55,265 INFO L225 Difference]: With dead ends: 139 [2018-04-13 03:25:55,265 INFO L226 Difference]: Without dead ends: 139 [2018-04-13 03:25:55,265 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-04-13 03:25:55,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-04-13 03:25:55,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 132. [2018-04-13 03:25:55,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-13 03:25:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2018-04-13 03:25:55,268 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 33 [2018-04-13 03:25:55,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:25:55,268 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2018-04-13 03:25:55,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 03:25:55,269 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2018-04-13 03:25:55,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 03:25:55,269 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:25:55,269 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:25:55,269 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:25:55,270 INFO L82 PathProgramCache]: Analyzing trace with hash -375834397, now seen corresponding path program 1 times [2018-04-13 03:25:55,271 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:25:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:25:55,283 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:25:55,364 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-13 03:25:55,365 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:25:55,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 03:25:55,365 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:25:55,365 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-13 03:25:55,365 INFO L182 omatonBuilderFactory]: Interpolants [4336#(and (not (= main_~end~0.base |main_#t~malloc6.base|)) (= 0 |main_#t~malloc6.offset|) (= 12 (select |#length| |main_#t~malloc6.base|))), 4337#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 4338#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (not (= main_~end~0.base |main_#t~mem7.base|))), 4339#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 4340#(and (= 0 |main_#t~mem8.offset|) (= 12 (select |#length| |main_#t~mem8.base|))), 4341#(and (= main_~end~0.offset 0) (= 12 (select |#length| main_~end~0.base))), 4333#true, 4334#false, 4335#(= (select |#valid| main_~end~0.base) 1)] [2018-04-13 03:25:55,365 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-13 03:25:55,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 03:25:55,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 03:25:55,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-13 03:25:55,366 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 9 states. [2018-04-13 03:25:55,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:25:55,611 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2018-04-13 03:25:55,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 03:25:55,611 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-04-13 03:25:55,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:25:55,611 INFO L225 Difference]: With dead ends: 136 [2018-04-13 03:25:55,611 INFO L226 Difference]: Without dead ends: 136 [2018-04-13 03:25:55,612 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-04-13 03:25:55,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-13 03:25:55,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 118. [2018-04-13 03:25:55,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-13 03:25:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-04-13 03:25:55,613 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 33 [2018-04-13 03:25:55,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:25:55,614 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-04-13 03:25:55,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 03:25:55,614 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-04-13 03:25:55,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-13 03:25:55,614 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:25:55,614 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:25:55,614 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:25:55,614 INFO L82 PathProgramCache]: Analyzing trace with hash -736807832, now seen corresponding path program 1 times [2018-04-13 03:25:55,615 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:25:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:25:55,625 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:25:55,668 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-13 03:25:55,669 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:25:55,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 03:25:55,669 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:25:55,669 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-13 03:25:55,669 INFO L182 omatonBuilderFactory]: Interpolants [4608#false, 4609#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 4610#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 4611#(and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.base| 0)), 4607#true] [2018-04-13 03:25:55,669 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-13 03:25:55,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:25:55,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:25:55,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:25:55,669 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 5 states. [2018-04-13 03:25:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:25:55,756 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2018-04-13 03:25:55,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 03:25:55,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-04-13 03:25:55,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:25:55,756 INFO L225 Difference]: With dead ends: 138 [2018-04-13 03:25:55,756 INFO L226 Difference]: Without dead ends: 123 [2018-04-13 03:25:55,757 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-13 03:25:55,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-13 03:25:55,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-04-13 03:25:55,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-04-13 03:25:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2018-04-13 03:25:55,759 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 35 [2018-04-13 03:25:55,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:25:55,759 INFO L459 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2018-04-13 03:25:55,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:25:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2018-04-13 03:25:55,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-13 03:25:55,760 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:25:55,760 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] [2018-04-13 03:25:55,760 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:25:55,760 INFO L82 PathProgramCache]: Analyzing trace with hash -799952616, now seen corresponding path program 1 times [2018-04-13 03:25:55,761 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:25:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:25:55,770 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:25:55,979 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-13 03:25:55,979 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:25:55,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 03:25:55,979 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:25:55,979 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-13 03:25:55,979 INFO L182 omatonBuilderFactory]: Interpolants [4875#true, 4876#false, 4877#(= 0 |main_#t~malloc0.offset|), 4878#(= 0 main_~list~0.offset), 4879#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 4880#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 4881#(and (not (= main_~end~0.base |main_#t~malloc2.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= |main_#t~malloc2.offset| main_~list~0.offset)), 4882#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 4883#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset)), 4884#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset)), 4885#(and (= |main_#t~mem4.offset| main_~list~0.offset) (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 4886#(or (and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))), 4887#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 4888#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 4889#(or (= 1 (select |#valid| |main_#t~mem14.base|)) (and (= 0 |main_#t~mem14.offset|) (= 0 |main_#t~mem14.base|))), 4890#(or (and (= main_~end~0.offset 0) (= main_~end~0.base 0)) (= 1 (select |#valid| main_~end~0.base))), 4891#(= 1 (select |#valid| main_~end~0.base))] [2018-04-13 03:25:55,980 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-13 03:25:55,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 03:25:55,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 03:25:55,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-04-13 03:25:55,980 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 17 states. [2018-04-13 03:25:56,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:25:56,678 INFO L93 Difference]: Finished difference Result 232 states and 245 transitions. [2018-04-13 03:25:56,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 03:25:56,679 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 49 [2018-04-13 03:25:56,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:25:56,680 INFO L225 Difference]: With dead ends: 232 [2018-04-13 03:25:56,680 INFO L226 Difference]: Without dead ends: 232 [2018-04-13 03:25:56,681 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=375, Invalid=1107, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 03:25:56,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-13 03:25:56,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 156. [2018-04-13 03:25:56,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-04-13 03:25:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 167 transitions. [2018-04-13 03:25:56,684 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 167 transitions. Word has length 49 [2018-04-13 03:25:56,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:25:56,684 INFO L459 AbstractCegarLoop]: Abstraction has 156 states and 167 transitions. [2018-04-13 03:25:56,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 03:25:56,685 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 167 transitions. [2018-04-13 03:25:56,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-13 03:25:56,685 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:25:56,685 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] [2018-04-13 03:25:56,686 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:25:56,686 INFO L82 PathProgramCache]: Analyzing trace with hash -799952615, now seen corresponding path program 1 times [2018-04-13 03:25:56,687 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:25:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:25:56,698 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:25:56,931 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-13 03:25:56,932 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:25:56,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 03:25:56,932 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:25:56,932 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-13 03:25:56,932 INFO L182 omatonBuilderFactory]: Interpolants [5324#true, 5325#false, 5326#(= 0 |main_#t~malloc0.offset|), 5327#(= 0 main_~list~0.offset), 5328#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 5329#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 5330#(and (not (= main_~end~0.base |main_#t~malloc2.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 12 (select |#length| |main_#t~malloc2.base|)) (= |main_#t~malloc2.offset| main_~list~0.offset) (= 0 |main_#t~malloc2.offset|)), 5331#(and (= main_~end~0.base main_~list~0.base) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 5332#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (= main_~end~0.base main_~list~0.base) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset))), 5333#(and (= main_~end~0.base main_~list~0.base) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset))), 5334#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem4.offset| main_~list~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 5335#(or (and (not (= main_~end~0.base main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))), 5336#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))))), 5337#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 5338#(or (and (= 0 |main_#t~mem14.offset|) (= 12 (select |#length| |main_#t~mem14.base|))) (and (= 0 |main_#t~mem14.offset|) (= 0 |main_#t~mem14.base|))), 5339#(or (and (= main_~end~0.offset 0) (= main_~end~0.base 0)) (and (= main_~end~0.offset 0) (= 12 (select |#length| main_~end~0.base)))), 5340#(and (= main_~end~0.offset 0) (= 12 (select |#length| main_~end~0.base)))] [2018-04-13 03:25:56,932 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-13 03:25:56,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 03:25:56,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 03:25:56,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-04-13 03:25:56,933 INFO L87 Difference]: Start difference. First operand 156 states and 167 transitions. Second operand 17 states. [2018-04-13 03:25:57,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:25:57,815 INFO L93 Difference]: Finished difference Result 237 states and 253 transitions. [2018-04-13 03:25:57,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 03:25:57,816 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 49 [2018-04-13 03:25:57,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:25:57,816 INFO L225 Difference]: With dead ends: 237 [2018-04-13 03:25:57,816 INFO L226 Difference]: Without dead ends: 237 [2018-04-13 03:25:57,817 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=318, Invalid=1014, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 03:25:57,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-04-13 03:25:57,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 158. [2018-04-13 03:25:57,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-13 03:25:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2018-04-13 03:25:57,819 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 49 [2018-04-13 03:25:57,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:25:57,819 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2018-04-13 03:25:57,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 03:25:57,820 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2018-04-13 03:25:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-13 03:25:57,820 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:25:57,820 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:25:57,820 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:25:57,821 INFO L82 PathProgramCache]: Analyzing trace with hash -7091430, now seen corresponding path program 1 times [2018-04-13 03:25:57,822 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:25:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:25:57,834 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:25:58,361 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-13 03:25:58,361 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:25:58,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-13 03:25:58,362 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:25:58,362 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-13 03:25:58,362 INFO L182 omatonBuilderFactory]: Interpolants [5792#(or (and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.base| 0)) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ 0 8))) (= ~unnamed2~0~RED (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 5793#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ 0 8))) (= ~unnamed2~0~RED (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 5794#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (= 0 |main_#t~mem14.offset|) (= ~unnamed2~0~RED (select |#valid| 0)) (= 1 (select (select |#memory_int| |main_#t~mem14.base|) (+ 0 8)))), 5795#(and (= ~unnamed2~0~RED (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 1 (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)))), 5796#(and (= ~unnamed2~0~RED (select |#valid| 0)) (= 1 |main_#t~mem10|) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 5797#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 1 (select |#valid| 0))), 5798#(and (= 0 |main_#t~mem11.base|) (= 1 (select |#valid| 0))), 5799#(and (= 0 main_~end~0.base) (= 1 (select |#valid| 0))), 5776#true, 5777#false, 5778#(= ~unnamed2~0~RED (select |#valid| 0)), 5779#(and (= ~unnamed2~0~RED (select |#valid| 0)) (= 0 |main_#t~malloc0.offset|)), 5780#(and (= 0 main_~list~0.offset) (= ~unnamed2~0~RED (select |#valid| 0))), 5781#(and (= 0 main_~list~0.offset) (= ~unnamed2~0~RED (select |#valid| 0)) (= (select |#valid| main_~list~0.base) 1)), 5782#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 main_~list~0.offset) (= ~unnamed2~0~RED (select |#valid| 0)) (= (select |#valid| main_~end~0.base) 1)), 5783#(and (not (= main_~end~0.base |main_#t~malloc2.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= |main_#t~malloc2.offset| main_~list~0.offset) (= 0 |main_#t~malloc2.offset|) (= ~unnamed2~0~RED (select |#valid| 0))), 5784#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= ~unnamed2~0~RED (select |#valid| 0)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 5785#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= ~unnamed2~0~RED (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 5786#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= ~unnamed2~0~RED (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 5787#(and (= |main_#t~mem4.offset| main_~list~0.offset) (= 0 |main_#t~mem4.offset|) (= |main_#t~mem4.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= ~unnamed2~0~RED (select |#valid| 0)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem4.base|)), 5788#(or (and (= main_~list~0.offset 0) (= main_~end~0.offset 0) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= ~unnamed2~0~RED (select |#valid| 0)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))), 5789#(or (and (= main_~list~0.offset 0) (= main_~end~0.offset 0) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= ~unnamed2~0~RED (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 5790#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~list~0.offset 8))) (= ~unnamed2~0~RED (select |#valid| 0))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 5791#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ 0 8))) (= ~unnamed2~0~RED (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))))] [2018-04-13 03:25:58,362 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-13 03:25:58,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-13 03:25:58,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-13 03:25:58,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2018-04-13 03:25:58,363 INFO L87 Difference]: Start difference. First operand 158 states and 169 transitions. Second operand 24 states. [2018-04-13 03:25:59,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:25:59,871 INFO L93 Difference]: Finished difference Result 249 states and 265 transitions. [2018-04-13 03:25:59,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 03:25:59,871 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 53 [2018-04-13 03:25:59,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:25:59,872 INFO L225 Difference]: With dead ends: 249 [2018-04-13 03:25:59,872 INFO L226 Difference]: Without dead ends: 249 [2018-04-13 03:25:59,873 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=400, Invalid=1670, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 03:25:59,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-04-13 03:25:59,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 155. [2018-04-13 03:25:59,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-13 03:25:59,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2018-04-13 03:25:59,875 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 53 [2018-04-13 03:25:59,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:25:59,875 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2018-04-13 03:25:59,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-13 03:25:59,875 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2018-04-13 03:25:59,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-13 03:25:59,875 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:25:59,875 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:25:59,876 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:25:59,876 INFO L82 PathProgramCache]: Analyzing trace with hash -698335515, now seen corresponding path program 1 times [2018-04-13 03:25:59,876 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:25:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:25:59,885 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:00,092 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-13 03:26:00,092 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:00,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 03:26:00,092 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:00,092 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-13 03:26:00,092 INFO L182 omatonBuilderFactory]: Interpolants [6248#true, 6249#false, 6250#(= (select |#valid| main_~list~0.base) 1), 6251#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 6252#(and (not (= main_~end~0.base |main_#t~malloc2.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset)), 6253#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 6254#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (= |main_#t~mem3.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 6255#(and (= (select |#valid| main_~list~0.base) 1) (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem4.base|))), 6256#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 6257#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1)), 6258#(and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~end~0.base |main_#t~malloc6.base|)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc6.base|))), 6259#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 6260#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (not (= |main_#t~mem7.base| main_~list~0.base)) (not (= main_~end~0.base |main_#t~mem7.base|))), 6261#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1)), 6262#(and (not (= main_~list~0.base |main_#t~mem8.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 6263#(and (not (= main_~end~0.base main_~list~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 6264#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 6265#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 6266#(= 1 (select |#valid| |main_#t~mem14.base|)), 6267#(= 1 (select |#valid| main_~end~0.base))] [2018-04-13 03:26:00,093 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-13 03:26:00,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 03:26:00,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 03:26:00,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-04-13 03:26:00,093 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand 20 states. [2018-04-13 03:26:00,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:00,827 INFO L93 Difference]: Finished difference Result 261 states and 276 transitions. [2018-04-13 03:26:00,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 03:26:00,827 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 58 [2018-04-13 03:26:00,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:00,828 INFO L225 Difference]: With dead ends: 261 [2018-04-13 03:26:00,828 INFO L226 Difference]: Without dead ends: 261 [2018-04-13 03:26:00,828 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=1182, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 03:26:00,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-04-13 03:26:00,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 189. [2018-04-13 03:26:00,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-13 03:26:00,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 202 transitions. [2018-04-13 03:26:00,831 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 202 transitions. Word has length 58 [2018-04-13 03:26:00,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:00,831 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 202 transitions. [2018-04-13 03:26:00,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 03:26:00,831 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 202 transitions. [2018-04-13 03:26:00,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-13 03:26:00,832 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:00,832 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:00,832 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:26:00,833 INFO L82 PathProgramCache]: Analyzing trace with hash -698335514, now seen corresponding path program 1 times [2018-04-13 03:26:00,833 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:00,847 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:01,231 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-13 03:26:01,232 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:01,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 03:26:01,232 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:01,232 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-13 03:26:01,232 INFO L182 omatonBuilderFactory]: Interpolants [6756#true, 6757#false, 6758#(= (select |#valid| main_~list~0.base) 1), 6759#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 6760#(and (not (= main_~end~0.base |main_#t~malloc2.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 12 (select |#length| |main_#t~malloc2.base|)) (= 0 |main_#t~malloc2.offset|)), 6761#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 6762#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= |main_#t~mem3.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 6763#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| |main_#t~mem4.base|)) (= (select |#valid| main_~list~0.base) 1) (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem4.base|))), 6764#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| main_~end~0.base)) (= (select |#valid| main_~list~0.base) 1)), 6765#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= 12 (select |#length| main_~end~0.base)) (= (select |#valid| main_~list~0.base) 1)), 6766#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (not (= main_~end~0.base |main_#t~malloc6.base|)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| main_~end~0.base)) (not (= main_~list~0.base |main_#t~malloc6.base|))), 6767#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| main_~end~0.base)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 6768#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| main_~end~0.base)) (not (= |main_#t~mem7.base| main_~list~0.base)) (not (= main_~end~0.base |main_#t~mem7.base|))), 6769#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| main_~end~0.base))), 6770#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem8.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 6771#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 6772#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 6773#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 6774#(and (= 0 |main_#t~mem14.offset|) (= 12 (select |#length| |main_#t~mem14.base|))), 6775#(and (= main_~end~0.offset 0) (= 12 (select |#length| main_~end~0.base)))] [2018-04-13 03:26:01,233 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-13 03:26:01,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 03:26:01,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 03:26:01,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2018-04-13 03:26:01,233 INFO L87 Difference]: Start difference. First operand 189 states and 202 transitions. Second operand 20 states. [2018-04-13 03:26:02,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:02,130 INFO L93 Difference]: Finished difference Result 265 states and 283 transitions. [2018-04-13 03:26:02,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 03:26:02,130 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 58 [2018-04-13 03:26:02,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:02,131 INFO L225 Difference]: With dead ends: 265 [2018-04-13 03:26:02,131 INFO L226 Difference]: Without dead ends: 265 [2018-04-13 03:26:02,131 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=910, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 03:26:02,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-04-13 03:26:02,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 191. [2018-04-13 03:26:02,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-13 03:26:02,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 204 transitions. [2018-04-13 03:26:02,135 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 204 transitions. Word has length 58 [2018-04-13 03:26:02,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:02,135 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 204 transitions. [2018-04-13 03:26:02,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 03:26:02,135 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 204 transitions. [2018-04-13 03:26:02,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-13 03:26:02,136 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:02,136 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:02,136 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:26:02,136 INFO L82 PathProgramCache]: Analyzing trace with hash -611631047, now seen corresponding path program 1 times [2018-04-13 03:26:02,137 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:02,146 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:02,186 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-13 03:26:02,187 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:26:02,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 03:26:02,187 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:02,187 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-13 03:26:02,188 INFO L182 omatonBuilderFactory]: Interpolants [7264#(or (not (= |main_#t~mem14.base| 0)) (not (= |main_#t~mem14.offset| 0))), 7265#(or (not (= main_~end~0.offset 0)) (not (= main_~end~0.base 0))), 7260#true, 7261#false, 7262#(and (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 7263#(or (not (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) 0)))] [2018-04-13 03:26:02,188 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-13 03:26:02,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 03:26:02,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 03:26:02,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 03:26:02,189 INFO L87 Difference]: Start difference. First operand 191 states and 204 transitions. Second operand 6 states. [2018-04-13 03:26:02,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:02,308 INFO L93 Difference]: Finished difference Result 155 states and 162 transitions. [2018-04-13 03:26:02,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 03:26:02,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-04-13 03:26:02,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:02,309 INFO L225 Difference]: With dead ends: 155 [2018-04-13 03:26:02,310 INFO L226 Difference]: Without dead ends: 155 [2018-04-13 03:26:02,310 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-13 03:26:02,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-13 03:26:02,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 147. [2018-04-13 03:26:02,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-04-13 03:26:02,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2018-04-13 03:26:02,312 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 58 [2018-04-13 03:26:02,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:02,313 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2018-04-13 03:26:02,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 03:26:02,313 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2018-04-13 03:26:02,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-13 03:26:02,313 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:02,313 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:02,314 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:26:02,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1513085733, now seen corresponding path program 2 times [2018-04-13 03:26:02,315 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:02,325 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:02,486 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-13 03:26:02,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:02,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 03:26:02,486 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:02,487 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-13 03:26:02,487 INFO L182 omatonBuilderFactory]: Interpolants [7584#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 7585#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))), 7586#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 7587#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 7588#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 7589#(and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.base| 0)), 7576#true, 7577#false, 7578#(= (select |#valid| main_~list~0.base) 1), 7579#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 7580#(and (not (= main_~end~0.base |main_#t~malloc2.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset)), 7581#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 7582#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= |main_#t~mem3.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 7583#(and (= |main_#t~mem4.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem4.base|)))] [2018-04-13 03:26:02,487 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-13 03:26:02,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 03:26:02,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 03:26:02,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-04-13 03:26:02,488 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand 14 states. [2018-04-13 03:26:02,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:02,812 INFO L93 Difference]: Finished difference Result 167 states and 174 transitions. [2018-04-13 03:26:02,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 03:26:02,813 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2018-04-13 03:26:02,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:02,813 INFO L225 Difference]: With dead ends: 167 [2018-04-13 03:26:02,813 INFO L226 Difference]: Without dead ends: 142 [2018-04-13 03:26:02,813 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2018-04-13 03:26:02,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-13 03:26:02,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 129. [2018-04-13 03:26:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-13 03:26:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions. [2018-04-13 03:26:02,815 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 59 [2018-04-13 03:26:02,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:02,815 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions. [2018-04-13 03:26:02,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 03:26:02,815 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2018-04-13 03:26:02,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-13 03:26:02,816 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:02,816 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, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:02,816 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:26:02,816 INFO L82 PathProgramCache]: Analyzing trace with hash 484223591, now seen corresponding path program 1 times [2018-04-13 03:26:02,816 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:02,825 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:03,045 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-13 03:26:03,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:03,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 03:26:03,045 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:03,046 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-13 03:26:03,046 INFO L182 omatonBuilderFactory]: Interpolants [7908#true, 7909#false, 7910#(= (select |#valid| main_~list~0.base) 1), 7911#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 7912#(and (not (= main_~end~0.base |main_#t~malloc2.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset)), 7913#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 7914#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (= |main_#t~mem3.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 7915#(and (= |main_#t~mem4.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (not (= main_~list~0.base |main_#t~mem4.base|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem4.base|)), 7916#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 7917#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 7918#(and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~end~0.base |main_#t~malloc6.base|)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc6.base|)) (= 1 (select |#valid| |main_#t~malloc6.base|)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 7919#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 7920#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= |main_#t~mem7.base| main_~list~0.base)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (not (= main_~end~0.base |main_#t~mem7.base|))), 7921#(and (not (= main_~list~0.base |main_#t~mem8.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem8.base|))), 7922#(and (not (= main_~end~0.base main_~list~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 7923#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))), 7924#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 7925#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 7926#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 7927#(= 1 (select |#valid| |main_#t~mem11.base|)), 7928#(= 1 (select |#valid| main_~end~0.base))] [2018-04-13 03:26:03,046 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-13 03:26:03,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 03:26:03,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 03:26:03,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2018-04-13 03:26:03,047 INFO L87 Difference]: Start difference. First operand 129 states and 136 transitions. Second operand 21 states. [2018-04-13 03:26:03,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:03,677 INFO L93 Difference]: Finished difference Result 176 states and 183 transitions. [2018-04-13 03:26:03,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 03:26:03,677 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-04-13 03:26:03,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:03,677 INFO L225 Difference]: With dead ends: 176 [2018-04-13 03:26:03,678 INFO L226 Difference]: Without dead ends: 176 [2018-04-13 03:26:03,678 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=1372, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 03:26:03,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-04-13 03:26:03,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 131. [2018-04-13 03:26:03,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-13 03:26:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2018-04-13 03:26:03,680 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 62 [2018-04-13 03:26:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:03,680 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2018-04-13 03:26:03,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 03:26:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2018-04-13 03:26:03,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-13 03:26:03,680 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:03,680 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, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:03,680 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:26:03,681 INFO L82 PathProgramCache]: Analyzing trace with hash 484223592, now seen corresponding path program 1 times [2018-04-13 03:26:03,681 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:03,691 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:04,021 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-13 03:26:04,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:04,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-13 03:26:04,021 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:04,022 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-13 03:26:04,022 INFO L182 omatonBuilderFactory]: Interpolants [8288#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= |main_#t~mem7.base| main_~list~0.base)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~mem7.base|))), 8289#(and (not (= main_~list~0.base |main_#t~mem8.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem8.base|)) (= |main_#t~mem8.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= 0 |main_#t~mem8.offset|) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))))), 8290#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.offset 0) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))))), 8291#(and (= main_~end~0.offset 0) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))))), 8292#(and (<= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (<= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))))), 8293#(and (<= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (<= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))))), 8294#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (<= (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|) 0)), 8295#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (<= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 0)), 8296#(and (<= 0 |main_#t~mem11.offset|) (= 12 (select |#length| |main_#t~mem11.base|)) (<= |main_#t~mem11.offset| 0)), 8297#(and (<= main_~end~0.offset 0) (= 12 (select |#length| main_~end~0.base)) (<= 0 main_~end~0.offset)), 8276#true, 8277#false, 8278#(= (select |#valid| main_~list~0.base) 1), 8279#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 8280#(and (not (= main_~end~0.base |main_#t~malloc2.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset)), 8281#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 8282#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (= |main_#t~mem3.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 8283#(and (= |main_#t~mem4.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (not (= main_~list~0.base |main_#t~mem4.base|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem4.base|)), 8284#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 8285#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 8286#(and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~end~0.base |main_#t~malloc6.base|)) (= 0 |main_#t~malloc6.offset|) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| |main_#t~malloc6.base|)) (not (= main_~list~0.base |main_#t~malloc6.base|)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 8287#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))] [2018-04-13 03:26:04,022 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-13 03:26:04,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 03:26:04,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 03:26:04,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-04-13 03:26:04,023 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 22 states. [2018-04-13 03:26:04,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:04,760 INFO L93 Difference]: Finished difference Result 174 states and 183 transitions. [2018-04-13 03:26:04,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 03:26:04,760 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 62 [2018-04-13 03:26:04,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:04,761 INFO L225 Difference]: With dead ends: 174 [2018-04-13 03:26:04,761 INFO L226 Difference]: Without dead ends: 174 [2018-04-13 03:26:04,762 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=1148, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 03:26:04,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-04-13 03:26:04,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 131. [2018-04-13 03:26:04,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-13 03:26:04,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2018-04-13 03:26:04,764 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 62 [2018-04-13 03:26:04,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:04,764 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2018-04-13 03:26:04,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 03:26:04,765 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2018-04-13 03:26:04,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-13 03:26:04,765 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:04,765 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:04,765 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:26:04,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1042400824, now seen corresponding path program 3 times [2018-04-13 03:26:04,767 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:04,779 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:05,125 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:26:05,125 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:05,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 03:26:05,125 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:05,125 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-13 03:26:05,126 INFO L182 omatonBuilderFactory]: Interpolants [8640#(and (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 8641#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= (select |#valid| main_~end~0.base) 1)), 8642#(and (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= (select |#valid| main_~end~0.base) 1)), 8643#(and (= |main_#t~mem4.offset| main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 8644#(or (and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1))), 8645#(and (or (and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))) (= (select |#valid| main_~end~0.base) 1)), 8646#(and (not (= main_~end~0.base |main_#t~malloc2.base|)) (or (and (= 1 (select |#valid| |main_#t~malloc2.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset)) (and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc2.base|))))), 8647#(and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (= main_~end~0.base main_~list~0.base)) (and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 8648#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= |main_#t~mem3.base| main_~list~0.base))), 8649#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 8650#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem4.base|))), 8651#(and (not (= main_~end~0.base main_~list~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 8652#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 8653#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 8654#(= 1 (select |#valid| |main_#t~mem14.base|)), 8655#(= 1 (select |#valid| main_~end~0.base)), 8633#true, 8634#false, 8635#(= 0 |main_#t~malloc0.offset|), 8636#(= 0 main_~list~0.offset), 8637#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 8638#(and (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= 0 main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 8639#(and (not (= main_~end~0.base |main_#t~malloc2.base|)) (= main_~end~0.offset main_~list~0.offset) (= |main_#t~malloc2.offset| main_~list~0.offset) (= main_~list~0.base main_~end~0.base))] [2018-04-13 03:26:05,126 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:26:05,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 03:26:05,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 03:26:05,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-04-13 03:26:05,127 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 23 states. [2018-04-13 03:26:05,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:05,996 INFO L93 Difference]: Finished difference Result 216 states and 225 transitions. [2018-04-13 03:26:05,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 03:26:05,997 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 63 [2018-04-13 03:26:05,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:05,997 INFO L225 Difference]: With dead ends: 216 [2018-04-13 03:26:05,997 INFO L226 Difference]: Without dead ends: 216 [2018-04-13 03:26:05,998 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=380, Invalid=1342, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 03:26:05,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-13 03:26:05,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 166. [2018-04-13 03:26:05,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-13 03:26:05,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 176 transitions. [2018-04-13 03:26:05,999 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 176 transitions. Word has length 63 [2018-04-13 03:26:05,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:05,999 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 176 transitions. [2018-04-13 03:26:05,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 03:26:06,000 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 176 transitions. [2018-04-13 03:26:06,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-13 03:26:06,000 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:06,000 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:06,000 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:26:06,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1042400823, now seen corresponding path program 2 times [2018-04-13 03:26:06,001 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:06,014 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:06,418 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:26:06,419 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:06,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 03:26:06,419 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:06,419 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-13 03:26:06,420 INFO L182 omatonBuilderFactory]: Interpolants [9088#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| main_~end~0.base)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 9089#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~mem3.base|)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| main_~end~0.base)) (not (= |main_#t~mem3.base| main_~list~0.base))), 9090#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| main_~end~0.base))), 9091#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem4.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 9092#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 9093#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 9094#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 9095#(and (<= 12 (select |#length| |main_#t~mem14.base|)) (= 0 |main_#t~mem14.offset|)), 9096#(and (= main_~end~0.offset 0) (<= 12 (select |#length| main_~end~0.base))), 9076#true, 9077#false, 9078#(= (select |#valid| main_~list~0.base) 1), 9079#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 9080#(and (not (= main_~end~0.base |main_#t~malloc2.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 |main_#t~malloc2.offset|)), 9081#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 9082#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= |main_#t~mem3.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 9083#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem4.base|))), 9084#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 9085#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (<= 0 main_~end~0.offset) (= (select |#valid| main_~list~0.base) 1)), 9086#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| main_~end~0.base)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1)), 9087#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (not (= main_~end~0.base |main_#t~malloc2.base|)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc2.base|)) (<= 12 (select |#length| main_~end~0.base)))] [2018-04-13 03:26:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:26:06,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 03:26:06,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 03:26:06,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-04-13 03:26:06,420 INFO L87 Difference]: Start difference. First operand 166 states and 176 transitions. Second operand 21 states. [2018-04-13 03:26:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:07,015 INFO L93 Difference]: Finished difference Result 214 states and 226 transitions. [2018-04-13 03:26:07,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 03:26:07,015 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 63 [2018-04-13 03:26:07,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:07,016 INFO L225 Difference]: With dead ends: 214 [2018-04-13 03:26:07,016 INFO L226 Difference]: Without dead ends: 214 [2018-04-13 03:26:07,016 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=993, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 03:26:07,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-13 03:26:07,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 168. [2018-04-13 03:26:07,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-13 03:26:07,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 178 transitions. [2018-04-13 03:26:07,018 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 178 transitions. Word has length 63 [2018-04-13 03:26:07,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:07,018 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 178 transitions. [2018-04-13 03:26:07,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 03:26:07,018 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 178 transitions. [2018-04-13 03:26:07,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-13 03:26:07,019 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:07,019 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, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:07,019 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 03:26:07,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1290037367, now seen corresponding path program 1 times [2018-04-13 03:26:07,020 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-13 03:26:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-13 03:26:07,075 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-13 03:26:07,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 03:26:07 BoogieIcfgContainer [2018-04-13 03:26:07,108 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 03:26:07,109 INFO L168 Benchmark]: Toolchain (without parser) took 16096.60 ms. Allocated memory was 397.9 MB in the beginning and 902.3 MB in the end (delta: 504.4 MB). Free memory was 334.3 MB in the beginning and 534.9 MB in the end (delta: -200.6 MB). Peak memory consumption was 303.8 MB. Max. memory is 5.3 GB. [2018-04-13 03:26:07,110 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 397.9 MB. Free memory is still 359.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 03:26:07,110 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.48 ms. Allocated memory is still 397.9 MB. Free memory was 334.3 MB in the beginning and 305.2 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 5.3 GB. [2018-04-13 03:26:07,110 INFO L168 Benchmark]: Boogie Preprocessor took 42.26 ms. Allocated memory is still 397.9 MB. Free memory was 305.2 MB in the beginning and 302.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-13 03:26:07,111 INFO L168 Benchmark]: RCFGBuilder took 493.27 ms. Allocated memory was 397.9 MB in the beginning and 601.9 MB in the end (delta: 203.9 MB). Free memory was 302.6 MB in the beginning and 521.1 MB in the end (delta: -218.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. [2018-04-13 03:26:07,111 INFO L168 Benchmark]: TraceAbstraction took 15304.36 ms. Allocated memory was 601.9 MB in the beginning and 902.3 MB in the end (delta: 300.4 MB). Free memory was 521.1 MB in the beginning and 534.9 MB in the end (delta: -13.8 MB). Peak memory consumption was 286.6 MB. Max. memory is 5.3 GB. [2018-04-13 03:26:07,113 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 397.9 MB. Free memory is still 359.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 253.48 ms. Allocated memory is still 397.9 MB. Free memory was 334.3 MB in the beginning and 305.2 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.26 ms. Allocated memory is still 397.9 MB. Free memory was 305.2 MB in the beginning and 302.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 493.27 ms. Allocated memory was 397.9 MB in the beginning and 601.9 MB in the end (delta: 203.9 MB). Free memory was 302.6 MB in the beginning and 521.1 MB in the end (delta: -218.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 15304.36 ms. Allocated memory was 601.9 MB in the beginning and 902.3 MB in the end (delta: 300.4 MB). Free memory was 521.1 MB in the beginning and 534.9 MB in the end (delta: -13.8 MB). Peak memory consumption was 286.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1040]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L994] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={16:0}] [L994] SLL* list = malloc(sizeof(SLL)); VAL [list={16:0}, malloc(sizeof(SLL))={16:0}] [L995] FCALL list->next = ((void*)0) VAL [list={16:0}, malloc(sizeof(SLL))={16:0}] [L996] FCALL list->prev = ((void*)0) VAL [list={16:0}, malloc(sizeof(SLL))={16:0}] [L997] FCALL list->colour = BLACK VAL [list={16:0}, malloc(sizeof(SLL))={16:0}] [L999] SLL* end = list; VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={16:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1005] FCALL end->next = malloc(sizeof(SLL)) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1006] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1006] FCALL end->next->prev = end VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1007] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1007] end = end->next [L1008] FCALL end->next = ((void*)0) VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1016] FCALL end->colour = RED VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1017] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1017] FCALL end->next = malloc(sizeof(SLL)) VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1018] EXPR, FCALL end->next VAL [end={14:0}, end->next={15:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1018] FCALL end->next->prev = end VAL [end={14:0}, end->next={15:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1019] EXPR, FCALL end->next VAL [end={14:0}, end->next={15:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1019] end = end->next [L1020] FCALL end->next = ((void*)0) VAL [end={15:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1021] FCALL end->colour = BLACK VAL [end={15:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1025] end = ((void*)0) [L1026] end = list VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1029] COND FALSE !(!(((void*)0) != end)) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1029] COND FALSE !(0) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1030] EXPR, FCALL end->colour VAL [end={16:0}, end->colour=1, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1030] COND FALSE !(!(BLACK == end->colour)) [L1030] COND FALSE !(0) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1032] COND TRUE ((void*)0) != end VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1034] EXPR, FCALL end->colour VAL [end={16:0}, end->colour=1, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1034] COND FALSE !(RED == end->colour) [L1040] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1040] COND FALSE !(!(end->next)) [L1040] COND FALSE !(0) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1041] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1041] end = end->next [L1032] COND TRUE ((void*)0) != end VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1034] EXPR, FCALL end->colour VAL [end={14:0}, end->colour=0, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1034] COND TRUE RED == end->colour [L1036] EXPR, FCALL end->next VAL [end={14:0}, end->next={15:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1036] end = end->next [L1037] EXPR, FCALL end->next VAL [end={15:0}, end->next={0:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1037] end = end->next [L1040] FCALL end->next - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 59 error locations. UNSAFE Result, 15.2s OverallTime, 27 OverallIterations, 3 TraceHistogramMax, 10.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1993 SDtfs, 7101 SDslu, 7953 SDs, 0 SdLazy, 13433 SolverSat, 1137 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 522 GetRequests, 47 SyntacticMatches, 9 SemanticMatches, 466 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2613 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 17/118 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 1091 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1043 NumberOfCodeBlocks, 1043 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 952 ConstructedInterpolants, 0 QuantifiedInterpolants, 674413 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 16 PerfectInterpolantSequences, 17/118 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/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_03-26-07-120.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_03-26-07-120.csv Received shutdown request...