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/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 14:59:14,795 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 14:59:14,797 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 14:59:14,810 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 14:59:14,810 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 14:59:14,811 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 14:59:14,812 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 14:59:14,813 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 14:59:14,815 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 14:59:14,816 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 14:59:14,816 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 14:59:14,816 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 14:59:14,817 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 14:59:14,818 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 14:59:14,819 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 14:59:14,820 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 14:59:14,822 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 14:59:14,823 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 14:59:14,824 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 14:59:14,825 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 14:59:14,826 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 14:59:14,827 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 14:59:14,827 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 14:59:14,828 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 14:59:14,829 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 14:59:14,829 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 14:59:14,830 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 14:59:14,830 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 14:59:14,831 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 14:59:14,831 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 14:59:14,831 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 14:59:14,832 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-11 14:59:14,853 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 14:59:14,853 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 14:59:14,854 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 14:59:14,854 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 14:59:14,854 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 14:59:14,855 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 14:59:14,855 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 14:59:14,855 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 14:59:14,855 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 14:59:14,855 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 14:59:14,855 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 14:59:14,856 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 14:59:14,856 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 14:59:14,856 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 14:59:14,856 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 14:59:14,856 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 14:59:14,856 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 14:59:14,857 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 14:59:14,857 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 14:59:14,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 14:59:14,857 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 14:59:14,857 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-11 14:59:14,886 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 14:59:14,897 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 14:59:14,901 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 14:59:14,904 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 14:59:14,904 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 14:59:14,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,203 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG277a3b137 [2018-04-11 14:59:15,347 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 14:59:15,347 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 14:59:15,348 INFO L168 CDTParser]: Scanning sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,355 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 14:59:15,355 INFO L215 ultiparseSymbolTable]: [2018-04-11 14:59:15,355 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 14:59:15,355 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,355 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 14:59:15,355 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__int16_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,355 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____dev_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsblkcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____syscall_ulong_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____qaddr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____id_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____off64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_rwlock_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_char in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_key_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_quad_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__fd_set in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__uid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__lldiv_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____caddr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__mode_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____int32_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____suseconds_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int32_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____pthread_slist_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsfilcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_mutexattr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____rlim64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____timer_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsblkcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint16_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____blksize_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__int8_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____off_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsfilcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____ino64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____ssize_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____time_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__ldiv_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____blkcnt64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__ushort in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____syscall_slong_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__key_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__fd_mask in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_rwlockattr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____nlink_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__ino_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_mutex_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__idtype_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsfilcnt64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__int32_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__register_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_barrierattr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__time_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____blkcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__Colour in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__dev_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__sigset_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__id_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____int64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____uid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__loff_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int8_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fd_mask in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__nlink_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__uint in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_int in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__ssize_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsword_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____sig_atomic_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_attr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__wchar_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____useconds_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____int8_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____daddr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__clockid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____clock_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__timer_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint8_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____key_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsblkcnt64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____loff_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_condattr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____pid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____gid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__int64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____mode_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____quad_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_long in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_quad_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__daddr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____intptr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__size_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__gid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__clock_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_barrier_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____socklen_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__suseconds_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____rlim_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_short in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int16_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__blkcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__quad_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__ulong in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____clockid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_long in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__div_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__caddr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,365 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_cond_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,365 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__SLL in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,365 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_short in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,365 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_char in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,365 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__off_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,365 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint32_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,365 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____int16_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,365 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____ino_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,365 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____sigset_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,365 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_once_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,365 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__blksize_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,366 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_spinlock_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:15,379 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG277a3b137 [2018-04-11 14:59:15,382 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 14:59:15,383 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 14:59:15,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 14:59:15,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 14:59:15,387 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 14:59:15,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 02:59:15" (1/1) ... [2018-04-11 14:59:15,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@566109ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:59:15, skipping insertion in model container [2018-04-11 14:59:15,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 02:59:15" (1/1) ... [2018-04-11 14:59:15,400 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 14:59:15,424 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 14:59:15,545 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 14:59:15,582 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 14:59:15,588 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-11 14:59:15,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:59:15 WrapperNode [2018-04-11 14:59:15,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 14:59:15,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 14:59:15,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 14:59:15,627 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 14:59:15,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:59:15" (1/1) ... [2018-04-11 14:59:15,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:59:15" (1/1) ... [2018-04-11 14:59:15,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:59:15" (1/1) ... [2018-04-11 14:59:15,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:59:15" (1/1) ... [2018-04-11 14:59:15,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:59:15" (1/1) ... [2018-04-11 14:59:15,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:59:15" (1/1) ... [2018-04-11 14:59:15,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:59:15" (1/1) ... [2018-04-11 14:59:15,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 14:59:15,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 14:59:15,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 14:59:15,671 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 14:59:15,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:59:15" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 14:59:15,760 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 14:59:15,760 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 14:59:15,760 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 14:59:15,760 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 14:59:15,761 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 14:59:15,761 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 14:59:15,761 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 14:59:15,761 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 14:59:15,761 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 14:59:15,761 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 14:59:15,761 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 14:59:15,761 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 14:59:15,761 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 14:59:15,761 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 14:59:15,761 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 14:59:15,761 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 14:59:15,761 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 14:59:15,762 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 14:59:15,762 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 14:59:15,762 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 14:59:15,762 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 14:59:15,762 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 14:59:15,762 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 14:59:15,762 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 14:59:15,762 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 14:59:15,762 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 14:59:15,763 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 14:59:15,763 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 14:59:15,763 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 14:59:15,763 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 14:59:15,763 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 14:59:15,763 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 14:59:15,763 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 14:59:15,763 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 14:59:15,763 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 14:59:15,763 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 14:59:15,764 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 14:59:15,764 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 14:59:15,764 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 14:59:15,764 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 14:59:15,764 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 14:59:15,764 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 14:59:15,764 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 14:59:15,764 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 14:59:15,764 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 14:59:15,764 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 14:59:15,765 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 14:59:15,765 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 14:59:15,765 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 14:59:15,765 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 14:59:15,765 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 14:59:15,765 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 14:59:15,765 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 14:59:15,765 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 14:59:15,765 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 14:59:15,766 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 14:59:15,766 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 14:59:15,766 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 14:59:15,766 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 14:59:15,766 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 14:59:15,766 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 14:59:15,766 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-11 14:59:15,766 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 14:59:15,766 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 14:59:15,766 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-11 14:59:15,766 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 14:59:15,766 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 14:59:15,766 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-11 14:59:15,766 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 14:59:15,766 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 14:59:15,767 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 14:59:15,767 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 14:59:15,767 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 14:59:15,767 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 14:59:15,767 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 14:59:15,767 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 14:59:15,767 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 14:59:15,767 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 14:59:15,767 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 14:59:15,767 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 14:59:15,767 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 14:59:15,767 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 14:59:15,767 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 14:59:15,768 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 14:59:15,768 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 14:59:15,768 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 14:59:15,768 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 14:59:15,768 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 14:59:15,768 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 14:59:15,768 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 14:59:15,768 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 14:59:15,768 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 14:59:15,768 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 14:59:15,768 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 14:59:15,768 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 14:59:15,768 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 14:59:15,768 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 14:59:15,768 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 14:59:15,768 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 14:59:15,768 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 14:59:15,769 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 14:59:15,769 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 14:59:15,769 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 14:59:15,769 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 14:59:15,769 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 14:59:15,769 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 14:59:15,769 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 14:59:15,769 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 14:59:15,769 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 14:59:15,769 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 14:59:15,770 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 14:59:15,770 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 14:59:15,770 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 14:59:15,770 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 14:59:15,770 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 14:59:15,770 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 14:59:15,770 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 14:59:15,770 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 14:59:16,143 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 14:59:16,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 02:59:16 BoogieIcfgContainer [2018-04-11 14:59:16,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 14:59:16,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 14:59:16,144 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 14:59:16,146 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 14:59:16,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 02:59:15" (1/3) ... [2018-04-11 14:59:16,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@206c0605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 02:59:16, skipping insertion in model container [2018-04-11 14:59:16,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:59:15" (2/3) ... [2018-04-11 14:59:16,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@206c0605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 02:59:16, skipping insertion in model container [2018-04-11 14:59:16,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 02:59:16" (3/3) ... [2018-04-11 14:59:16,148 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:59:16,154 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-11 14:59:16,159 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 49 error locations. [2018-04-11 14:59:16,183 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 14:59:16,184 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 14:59:16,184 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 14:59:16,184 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-11 14:59:16,184 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-11 14:59:16,184 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 14:59:16,184 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 14:59:16,184 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 14:59:16,184 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 14:59:16,185 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 14:59:16,196 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2018-04-11 14:59:16,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 14:59:16,203 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:59:16,203 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:59:16,203 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:59:16,206 INFO L82 PathProgramCache]: Analyzing trace with hash -659694479, now seen corresponding path program 1 times [2018-04-11 14:59:16,241 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:59:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:59:16,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:59:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:16,317 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:59:16,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 14:59:16,317 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:59:16,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:16,318 INFO L182 omatonBuilderFactory]: Interpolants [128#false, 129#(= 1 (select |#valid| |main_#t~malloc0.base|)), 130#(= 1 (select |#valid| main_~list~0.base)), 127#true] [2018-04-11 14:59:16,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:16,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 14:59:16,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 14:59:16,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 14:59:16,329 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 4 states. [2018-04-11 14:59:16,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:59:16,510 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2018-04-11 14:59:16,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 14:59:16,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 14:59:16,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:59:16,520 INFO L225 Difference]: With dead ends: 141 [2018-04-11 14:59:16,521 INFO L226 Difference]: Without dead ends: 137 [2018-04-11 14:59:16,522 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:59:16,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-11 14:59:16,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 118. [2018-04-11 14:59:16,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 14:59:16,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-04-11 14:59:16,556 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 8 [2018-04-11 14:59:16,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:59:16,557 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-04-11 14:59:16,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 14:59:16,557 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-04-11 14:59:16,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 14:59:16,557 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:59:16,557 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:59:16,557 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:59:16,558 INFO L82 PathProgramCache]: Analyzing trace with hash -659694478, now seen corresponding path program 1 times [2018-04-11 14:59:16,559 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:59:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:59:16,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:59:16,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:16,618 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:59:16,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 14:59:16,618 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:59:16,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:16,619 INFO L182 omatonBuilderFactory]: Interpolants [392#true, 393#false, 394#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 395#(and (= main_~list~0.offset 0) (= 8 (select |#length| main_~list~0.base)))] [2018-04-11 14:59:16,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:16,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 14:59:16,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 14:59:16,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 14:59:16,621 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 4 states. [2018-04-11 14:59:16,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:59:16,728 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2018-04-11 14:59:16,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 14:59:16,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 14:59:16,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:59:16,730 INFO L225 Difference]: With dead ends: 135 [2018-04-11 14:59:16,730 INFO L226 Difference]: Without dead ends: 135 [2018-04-11 14:59:16,731 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:59:16,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-11 14:59:16,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2018-04-11 14:59:16,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 14:59:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2018-04-11 14:59:16,740 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 8 [2018-04-11 14:59:16,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:59:16,740 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2018-04-11 14:59:16,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 14:59:16,740 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2018-04-11 14:59:16,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 14:59:16,740 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:59:16,741 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:59:16,741 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:59:16,741 INFO L82 PathProgramCache]: Analyzing trace with hash -202425566, now seen corresponding path program 1 times [2018-04-11 14:59:16,742 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:59:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:59:16,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:59:16,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:16,796 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:59:16,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 14:59:16,796 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:59:16,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:16,796 INFO L182 omatonBuilderFactory]: Interpolants [656#true, 657#false, 658#(= 1 (select |#valid| main_~list~0.base)), 659#(= 1 (select |#valid| main_~end~0.base))] [2018-04-11 14:59:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:16,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 14:59:16,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 14:59:16,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 14:59:16,797 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 4 states. [2018-04-11 14:59:16,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:59:16,889 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2018-04-11 14:59:16,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 14:59:16,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-11 14:59:16,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:59:16,890 INFO L225 Difference]: With dead ends: 133 [2018-04-11 14:59:16,890 INFO L226 Difference]: Without dead ends: 133 [2018-04-11 14:59:16,891 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:59:16,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-11 14:59:16,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 117. [2018-04-11 14:59:16,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-04-11 14:59:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2018-04-11 14:59:16,895 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 15 [2018-04-11 14:59:16,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:59:16,895 INFO L459 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2018-04-11 14:59:16,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 14:59:16,895 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2018-04-11 14:59:16,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 14:59:16,895 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:59:16,895 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:59:16,895 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:59:16,895 INFO L82 PathProgramCache]: Analyzing trace with hash -202425565, now seen corresponding path program 1 times [2018-04-11 14:59:16,897 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:59:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:59:16,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:59:16,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:16,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:59:16,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 14:59:16,962 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:59:16,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:16,962 INFO L182 omatonBuilderFactory]: Interpolants [912#true, 913#false, 914#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 915#(and (= 0 main_~list~0.offset) (= 8 (select |#length| main_~list~0.base))), 916#(and (= main_~end~0.offset 0) (= 8 (select |#length| main_~end~0.base)))] [2018-04-11 14:59:16,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:16,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 14:59:16,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 14:59:16,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:59:16,963 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 5 states. [2018-04-11 14:59:17,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:59:17,086 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2018-04-11 14:59:17,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 14:59:17,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-11 14:59:17,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:59:17,088 INFO L225 Difference]: With dead ends: 156 [2018-04-11 14:59:17,088 INFO L226 Difference]: Without dead ends: 156 [2018-04-11 14:59:17,088 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-11 14:59:17,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-11 14:59:17,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 129. [2018-04-11 14:59:17,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 14:59:17,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2018-04-11 14:59:17,094 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 15 [2018-04-11 14:59:17,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:59:17,094 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2018-04-11 14:59:17,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 14:59:17,094 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2018-04-11 14:59:17,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 14:59:17,095 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:59:17,095 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:59:17,095 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:59:17,095 INFO L82 PathProgramCache]: Analyzing trace with hash -325956996, now seen corresponding path program 1 times [2018-04-11 14:59:17,097 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:59:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:59:17,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:59:17,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:17,171 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:59:17,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 14:59:17,171 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:59:17,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:17,171 INFO L182 omatonBuilderFactory]: Interpolants [1206#true, 1207#false, 1208#(and (= 0 |main_#t~malloc2.offset|) (= 8 (select |#length| |main_#t~malloc2.base|))), 1209#(and (= 8 (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))), 1210#(and (= 8 (select |#length| |main_#t~mem3.base|)) (= 0 |main_#t~mem3.offset|)), 1211#(and (= main_~end~0.offset 0) (= 8 (select |#length| main_~end~0.base)))] [2018-04-11 14:59:17,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:17,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 14:59:17,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 14:59:17,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 14:59:17,172 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand 6 states. [2018-04-11 14:59:17,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:59:17,369 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2018-04-11 14:59:17,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 14:59:17,369 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-11 14:59:17,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:59:17,370 INFO L225 Difference]: With dead ends: 216 [2018-04-11 14:59:17,370 INFO L226 Difference]: Without dead ends: 216 [2018-04-11 14:59:17,370 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-11 14:59:17,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-11 14:59:17,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 124. [2018-04-11 14:59:17,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-11 14:59:17,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2018-04-11 14:59:17,374 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 18 [2018-04-11 14:59:17,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:59:17,374 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2018-04-11 14:59:17,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 14:59:17,374 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2018-04-11 14:59:17,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 14:59:17,374 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:59:17,374 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:59:17,375 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:59:17,375 INFO L82 PathProgramCache]: Analyzing trace with hash -325956997, now seen corresponding path program 1 times [2018-04-11 14:59:17,376 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:59:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:59:17,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:59:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:17,429 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:59:17,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 14:59:17,429 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:59:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:17,430 INFO L182 omatonBuilderFactory]: Interpolants [1568#(= 1 (select |#valid| main_~end~0.base)), 1563#true, 1564#false, 1565#(= 1 (select |#valid| |main_#t~malloc2.base|)), 1566#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 1567#(= 1 (select |#valid| |main_#t~mem3.base|))] [2018-04-11 14:59:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:17,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 14:59:17,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 14:59:17,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 14:59:17,430 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 6 states. [2018-04-11 14:59:17,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:59:17,578 INFO L93 Difference]: Finished difference Result 211 states and 229 transitions. [2018-04-11 14:59:17,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 14:59:17,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-11 14:59:17,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:59:17,579 INFO L225 Difference]: With dead ends: 211 [2018-04-11 14:59:17,579 INFO L226 Difference]: Without dead ends: 211 [2018-04-11 14:59:17,579 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-11 14:59:17,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-04-11 14:59:17,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 123. [2018-04-11 14:59:17,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 14:59:17,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2018-04-11 14:59:17,582 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 18 [2018-04-11 14:59:17,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:59:17,583 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2018-04-11 14:59:17,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 14:59:17,583 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2018-04-11 14:59:17,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 14:59:17,583 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:59:17,583 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:59:17,584 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:59:17,584 INFO L82 PathProgramCache]: Analyzing trace with hash -765015574, now seen corresponding path program 1 times [2018-04-11 14:59:17,585 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:59:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:59:17,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:59:17,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:17,621 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:59:17,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 14:59:17,621 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:59:17,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:17,621 INFO L182 omatonBuilderFactory]: Interpolants [1910#true, 1911#false, 1912#(= 1 (select |#valid| |main_#t~malloc5.base|)), 1913#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 1914#(= 1 (select |#valid| |main_#t~mem6.base|)), 1915#(= 1 (select |#valid| main_~end~0.base))] [2018-04-11 14:59:17,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:17,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 14:59:17,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 14:59:17,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 14:59:17,622 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 6 states. [2018-04-11 14:59:17,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:59:17,778 INFO L93 Difference]: Finished difference Result 224 states and 244 transitions. [2018-04-11 14:59:17,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 14:59:17,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-11 14:59:17,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:59:17,779 INFO L225 Difference]: With dead ends: 224 [2018-04-11 14:59:17,779 INFO L226 Difference]: Without dead ends: 224 [2018-04-11 14:59:17,780 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-11 14:59:17,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-04-11 14:59:17,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 122. [2018-04-11 14:59:17,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-11 14:59:17,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2018-04-11 14:59:17,784 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 26 [2018-04-11 14:59:17,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:59:17,784 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-04-11 14:59:17,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 14:59:17,784 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2018-04-11 14:59:17,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 14:59:17,785 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:59:17,785 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:59:17,785 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:59:17,785 INFO L82 PathProgramCache]: Analyzing trace with hash -765015573, now seen corresponding path program 1 times [2018-04-11 14:59:17,786 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:59:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:59:17,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:59:17,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:17,856 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:59:17,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 14:59:17,857 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:59:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:17,857 INFO L182 omatonBuilderFactory]: Interpolants [2272#(and (= 8 (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))), 2273#(and (= 0 |main_#t~mem6.offset|) (= 8 (select |#length| |main_#t~mem6.base|))), 2274#(and (= main_~end~0.offset 0) (= 8 (select |#length| main_~end~0.base))), 2269#true, 2270#false, 2271#(and (= 0 |main_#t~malloc5.offset|) (= 8 (select |#length| |main_#t~malloc5.base|)))] [2018-04-11 14:59:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:17,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 14:59:17,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 14:59:17,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 14:59:17,858 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand 6 states. [2018-04-11 14:59:18,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:59:18,029 INFO L93 Difference]: Finished difference Result 217 states and 238 transitions. [2018-04-11 14:59:18,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 14:59:18,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-11 14:59:18,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:59:18,030 INFO L225 Difference]: With dead ends: 217 [2018-04-11 14:59:18,030 INFO L226 Difference]: Without dead ends: 217 [2018-04-11 14:59:18,031 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-11 14:59:18,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-11 14:59:18,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 112. [2018-04-11 14:59:18,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-04-11 14:59:18,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2018-04-11 14:59:18,034 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 26 [2018-04-11 14:59:18,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:59:18,035 INFO L459 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2018-04-11 14:59:18,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 14:59:18,035 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2018-04-11 14:59:18,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 14:59:18,035 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:59:18,035 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:59:18,036 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:59:18,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1849046283, now seen corresponding path program 1 times [2018-04-11 14:59:18,037 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:59:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:59:18,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:59:18,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:18,072 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:59:18,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 14:59:18,072 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:59:18,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:18,072 INFO L182 omatonBuilderFactory]: Interpolants [2611#true, 2612#false, 2613#(not (= 0 |main_#t~malloc0.base|)), 2614#(not (= 0 main_~list~0.base)), 2615#(not (= 0 main_~end~0.base))] [2018-04-11 14:59:18,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:18,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 14:59:18,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 14:59:18,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:59:18,073 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 5 states. [2018-04-11 14:59:18,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:59:18,165 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2018-04-11 14:59:18,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 14:59:18,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-04-11 14:59:18,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:59:18,167 INFO L225 Difference]: With dead ends: 131 [2018-04-11 14:59:18,167 INFO L226 Difference]: Without dead ends: 131 [2018-04-11 14:59:18,167 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 14:59:18,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-04-11 14:59:18,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 112. [2018-04-11 14:59:18,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-04-11 14:59:18,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-04-11 14:59:18,170 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 27 [2018-04-11 14:59:18,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:59:18,170 INFO L459 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-04-11 14:59:18,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 14:59:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-04-11 14:59:18,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 14:59:18,171 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:59:18,171 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:59:18,171 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:59:18,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1472510335, now seen corresponding path program 1 times [2018-04-11 14:59:18,172 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:59:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:59:18,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:59:18,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:18,248 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:59:18,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 14:59:18,248 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:59:18,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:18,249 INFO L182 omatonBuilderFactory]: Interpolants [2864#false, 2865#(= |main_#t~mem7| (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4))), 2866#(= ~unnamed2~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4))), 2867#(= ~unnamed2~0~BLACK |main_#t~mem8|), 2863#true] [2018-04-11 14:59:18,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:18,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 14:59:18,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 14:59:18,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:59:18,250 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 5 states. [2018-04-11 14:59:18,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:59:18,336 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-04-11 14:59:18,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 14:59:18,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-11 14:59:18,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:59:18,337 INFO L225 Difference]: With dead ends: 120 [2018-04-11 14:59:18,337 INFO L226 Difference]: Without dead ends: 120 [2018-04-11 14:59:18,337 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 14:59:18,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-04-11 14:59:18,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2018-04-11 14:59:18,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-04-11 14:59:18,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-04-11 14:59:18,340 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 28 [2018-04-11 14:59:18,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:59:18,340 INFO L459 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-04-11 14:59:18,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 14:59:18,340 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-04-11 14:59:18,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 14:59:18,341 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:59:18,341 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:59:18,341 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:59:18,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1101576030, now seen corresponding path program 1 times [2018-04-11 14:59:18,342 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:59:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:59:18,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:59:18,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:18,414 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:59:18,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 14:59:18,414 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:59:18,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:18,414 INFO L182 omatonBuilderFactory]: Interpolants [3104#(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))), 3105#(and (= |main_#t~mem11.offset| 0) (= |main_#t~mem11.base| 0)), 3101#true, 3102#false, 3103#(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)))] [2018-04-11 14:59:18,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:18,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 14:59:18,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 14:59:18,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:59:18,415 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 5 states. [2018-04-11 14:59:18,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:59:18,518 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2018-04-11 14:59:18,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 14:59:18,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-04-11 14:59:18,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:59:18,519 INFO L225 Difference]: With dead ends: 131 [2018-04-11 14:59:18,519 INFO L226 Difference]: Without dead ends: 116 [2018-04-11 14:59:18,519 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 14:59:18,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-04-11 14:59:18,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-04-11 14:59:18,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-04-11 14:59:18,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2018-04-11 14:59:18,522 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 34 [2018-04-11 14:59:18,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:59:18,522 INFO L459 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2018-04-11 14:59:18,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 14:59:18,522 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-04-11 14:59:18,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 14:59:18,523 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:59:18,523 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:59:18,523 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:59:18,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1478738935, now seen corresponding path program 1 times [2018-04-11 14:59:18,525 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:59:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:59:18,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:59:18,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:18,674 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:59:18,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 14:59:18,674 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:59:18,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:18,675 INFO L182 omatonBuilderFactory]: Interpolants [3360#(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)))), 3361#(and (= |main_#t~mem3.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem3.base|))), 3362#(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))), 3363#(and (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| main_~end~0.base))), 3364#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 3365#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 3366#(= 1 (select |#valid| |main_#t~mem12.base|)), 3367#(= 1 (select |#valid| main_~end~0.base)), 3355#true, 3356#false, 3357#(= (select |#valid| main_~list~0.base) 1), 3358#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 3359#(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))] [2018-04-11 14:59:18,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:18,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 14:59:18,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 14:59:18,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-04-11 14:59:18,676 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 13 states. [2018-04-11 14:59:19,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:59:19,112 INFO L93 Difference]: Finished difference Result 207 states and 220 transitions. [2018-04-11 14:59:19,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 14:59:19,113 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-04-11 14:59:19,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:59:19,114 INFO L225 Difference]: With dead ends: 207 [2018-04-11 14:59:19,114 INFO L226 Difference]: Without dead ends: 207 [2018-04-11 14:59:19,114 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2018-04-11 14:59:19,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-04-11 14:59:19,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 146. [2018-04-11 14:59:19,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-11 14:59:19,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2018-04-11 14:59:19,118 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 45 [2018-04-11 14:59:19,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:59:19,118 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2018-04-11 14:59:19,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 14:59:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2018-04-11 14:59:19,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 14:59:19,119 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:59:19,119 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:59:19,119 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:59:19,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1478738936, now seen corresponding path program 1 times [2018-04-11 14:59:19,121 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:59:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:59:19,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:59:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:19,288 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:59:19,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-11 14:59:19,288 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:59:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:19,288 INFO L182 omatonBuilderFactory]: Interpolants [3744#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 3745#(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|) (= 8 (select |#length| |main_#t~malloc2.base|))), 3746#(and (= main_~end~0.base main_~list~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| 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)))), 3747#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem3.base|))), 3748#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 3749#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 3750#(and (= 8 (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))), 3751#(and (= 0 |main_#t~mem12.offset|) (= 8 (select |#length| |main_#t~mem12.base|))), 3752#(and (= main_~end~0.offset 0) (= 8 (select |#length| main_~end~0.base))), 3741#true, 3742#false, 3743#(= (select |#valid| main_~list~0.base) 1)] [2018-04-11 14:59:19,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:19,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 14:59:19,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 14:59:19,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-04-11 14:59:19,289 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. Second operand 12 states. [2018-04-11 14:59:19,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:59:19,728 INFO L93 Difference]: Finished difference Result 218 states and 234 transitions. [2018-04-11 14:59:19,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 14:59:19,728 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-04-11 14:59:19,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:59:19,729 INFO L225 Difference]: With dead ends: 218 [2018-04-11 14:59:19,729 INFO L226 Difference]: Without dead ends: 218 [2018-04-11 14:59:19,729 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2018-04-11 14:59:19,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-11 14:59:19,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 148. [2018-04-11 14:59:19,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-11 14:59:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2018-04-11 14:59:19,733 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 45 [2018-04-11 14:59:19,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:59:19,733 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2018-04-11 14:59:19,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 14:59:19,733 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2018-04-11 14:59:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 14:59:19,734 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:59:19,734 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:59:19,734 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:59:19,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1481333305, now seen corresponding path program 1 times [2018-04-11 14:59:19,736 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:59:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:59:19,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:59:20,285 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:20,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:59:20,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 14:59:20,286 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:59:20,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:20,286 INFO L182 omatonBuilderFactory]: Interpolants [4135#true, 4136#false, 4137#(= ~unnamed2~0~RED (select |#valid| 0)), 4138#(and (= ~unnamed2~0~RED (select |#valid| 0)) (= 0 |main_#t~malloc0.offset|)), 4139#(and (= main_~list~0.offset 0) (= ~unnamed2~0~RED (select |#valid| 0))), 4140#(and (= main_~list~0.offset 0) (= ~unnamed2~0~RED (select |#valid| 0)) (= (select |#valid| main_~list~0.base) 1)), 4141#(and (= main_~list~0.offset 0) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= ~unnamed2~0~RED (select |#valid| 0)) (= (select |#valid| main_~end~0.base) 1)), 4142#(and (= main_~list~0.offset 0) (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|) (= ~unnamed2~0~RED (select |#valid| 0))), 4143#(and (= main_~list~0.offset 0) (= main_~end~0.base main_~list~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))), 4144#(and (= main_~list~0.offset 0) (= |main_#t~mem3.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= ~unnamed2~0~RED (select |#valid| 0)) (= 0 |main_#t~mem3.offset|) (= |main_#t~mem3.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem3.base|))), 4145#(and (= main_~list~0.offset 0) (not (= main_~end~0.base main_~list~0.base)) (= 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))), 4146#(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))), 4147#(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))) (= ~unnamed2~0~RED (select |#valid| 0)) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~list~0.offset 4)))), 4148#(and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ 0 4))) (= 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))) (= ~unnamed2~0~RED (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 4149#(and (= 0 |main_#t~mem12.offset|) (= ~unnamed2~0~RED (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|)) (= 1 (select (select |#memory_int| |main_#t~mem12.base|) (+ 0 4)))), 4150#(and (= 1 (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4))) (= ~unnamed2~0~RED (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 4151#(and (= ~unnamed2~0~RED (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 1 |main_#t~mem8|)), 4152#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 1 (select |#valid| 0))), 4153#(and (= 0 |main_#t~mem9.base|) (= 1 (select |#valid| 0))), 4154#(and (= 0 main_~end~0.base) (= 1 (select |#valid| 0)))] [2018-04-11 14:59:20,286 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:20,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 14:59:20,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 14:59:20,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-04-11 14:59:20,287 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. Second operand 20 states. [2018-04-11 14:59:21,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:59:21,068 INFO L93 Difference]: Finished difference Result 218 states and 233 transitions. [2018-04-11 14:59:21,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 14:59:21,068 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-04-11 14:59:21,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:59:21,069 INFO L225 Difference]: With dead ends: 218 [2018-04-11 14:59:21,069 INFO L226 Difference]: Without dead ends: 218 [2018-04-11 14:59:21,070 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 14:59:21,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-11 14:59:21,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 145. [2018-04-11 14:59:21,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-11 14:59:21,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2018-04-11 14:59:21,072 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 49 [2018-04-11 14:59:21,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:59:21,072 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2018-04-11 14:59:21,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 14:59:21,072 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2018-04-11 14:59:21,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 14:59:21,073 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:59:21,073 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:59:21,073 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:59:21,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1731438270, now seen corresponding path program 1 times [2018-04-11 14:59:21,074 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:59:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:59:21,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:59:21,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:21,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:59:21,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 14:59:21,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:59:21,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:21,205 INFO L182 omatonBuilderFactory]: Interpolants [4548#true, 4549#false, 4550#(= (select |#valid| main_~list~0.base) 1), 4551#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 4552#(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)), 4553#(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)))), 4554#(and (= |main_#t~mem3.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (not (= main_~list~0.base |main_#t~mem3.base|))), 4555#(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)), 4556#(and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~list~0.base |main_#t~malloc5.base|)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 4557#(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)) (= 1 (select |#valid| main_~end~0.base))), 4558#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem6.base|))), 4559#(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)))), 4560#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 4561#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 4562#(= 1 (select |#valid| |main_#t~mem12.base|)), 4563#(= 1 (select |#valid| main_~end~0.base))] [2018-04-11 14:59:21,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:21,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 14:59:21,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 14:59:21,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-04-11 14:59:21,205 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand 16 states. [2018-04-11 14:59:21,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:59:21,707 INFO L93 Difference]: Finished difference Result 242 states and 257 transitions. [2018-04-11 14:59:21,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 14:59:21,707 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2018-04-11 14:59:21,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:59:21,708 INFO L225 Difference]: With dead ends: 242 [2018-04-11 14:59:21,708 INFO L226 Difference]: Without dead ends: 242 [2018-04-11 14:59:21,708 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=783, Unknown=0, NotChecked=0, Total=992 [2018-04-11 14:59:21,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-11 14:59:21,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 176. [2018-04-11 14:59:21,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-11 14:59:21,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 189 transitions. [2018-04-11 14:59:21,712 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 189 transitions. Word has length 51 [2018-04-11 14:59:21,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:59:21,712 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 189 transitions. [2018-04-11 14:59:21,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 14:59:21,712 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 189 transitions. [2018-04-11 14:59:21,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 14:59:21,713 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:59:21,713 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:59:21,713 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:59:21,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1731438271, now seen corresponding path program 1 times [2018-04-11 14:59:21,714 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:59:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:59:21,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:59:21,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:21,946 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:59:21,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 14:59:21,946 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:59:21,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:21,947 INFO L182 omatonBuilderFactory]: Interpolants [5024#(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))) (= (select |#length| main_~end~0.base) 8) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 5025#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem6.base|))), 5026#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 5027#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 5028#(and (<= 8 (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))), 5029#(and (= 0 |main_#t~mem12.offset|) (<= 8 (select |#length| |main_#t~mem12.base|))), 5030#(and (= main_~end~0.offset 0) (<= 8 (select |#length| main_~end~0.base))), 5014#true, 5015#false, 5016#(= (select |#valid| main_~list~0.base) 1), 5017#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 5018#(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|) (= 8 (select |#length| |main_#t~malloc2.base|))), 5019#(and (= 8 (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)))), 5020#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem3.base|) (= 8 (select |#length| |main_#t~mem3.base|)) (= (select |#valid| main_~list~0.base) 1) (not (= main_~list~0.base |main_#t~mem3.base|))), 5021#(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) (= 8 (select |#length| main_~end~0.base))), 5022#(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) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| main_~end~0.base))), 5023#(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_~list~0.base |main_#t~malloc5.base|)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| main_~end~0.base)))] [2018-04-11 14:59:21,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:21,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 14:59:21,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 14:59:21,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-04-11 14:59:21,948 INFO L87 Difference]: Start difference. First operand 176 states and 189 transitions. Second operand 17 states. [2018-04-11 14:59:22,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:59:22,420 INFO L93 Difference]: Finished difference Result 253 states and 271 transitions. [2018-04-11 14:59:22,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 14:59:22,420 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 51 [2018-04-11 14:59:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:59:22,421 INFO L225 Difference]: With dead ends: 253 [2018-04-11 14:59:22,421 INFO L226 Difference]: Without dead ends: 253 [2018-04-11 14:59:22,421 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2018-04-11 14:59:22,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-11 14:59:22,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 178. [2018-04-11 14:59:22,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-11 14:59:22,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 191 transitions. [2018-04-11 14:59:22,425 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 191 transitions. Word has length 51 [2018-04-11 14:59:22,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:59:22,425 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 191 transitions. [2018-04-11 14:59:22,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 14:59:22,425 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 191 transitions. [2018-04-11 14:59:22,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 14:59:22,426 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:59:22,426 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:59:22,426 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:59:22,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1776041815, now seen corresponding path program 1 times [2018-04-11 14:59:22,427 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:59:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:59:22,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:59:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 14:59:22,479 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:59:22,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 14:59:22,480 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:59:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:22,480 INFO L182 omatonBuilderFactory]: Interpolants [5488#(and (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 5489#(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))), 5490#(or (not (= |main_#t~mem12.base| 0)) (not (= |main_#t~mem12.offset| 0))), 5491#(or (not (= main_~end~0.offset 0)) (not (= main_~end~0.base 0))), 5486#true, 5487#false] [2018-04-11 14:59:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 14:59:22,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 14:59:22,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 14:59:22,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 14:59:22,481 INFO L87 Difference]: Start difference. First operand 178 states and 191 transitions. Second operand 6 states. [2018-04-11 14:59:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:59:22,554 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2018-04-11 14:59:22,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 14:59:22,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-04-11 14:59:22,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:59:22,555 INFO L225 Difference]: With dead ends: 142 [2018-04-11 14:59:22,555 INFO L226 Difference]: Without dead ends: 142 [2018-04-11 14:59:22,555 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-04-11 14:59:22,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-11 14:59:22,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2018-04-11 14:59:22,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-11 14:59:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-04-11 14:59:22,560 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 54 [2018-04-11 14:59:22,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:59:22,560 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-04-11 14:59:22,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 14:59:22,560 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-04-11 14:59:22,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 14:59:22,561 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:59:22,561 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:59:22,561 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:59:22,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1044886106, now seen corresponding path program 2 times [2018-04-11 14:59:22,562 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:59:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:59:22,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:59:22,836 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:22,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:59:22,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 14:59:22,837 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:59:22,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:22,838 INFO L182 omatonBuilderFactory]: Interpolants [5776#true, 5777#false, 5778#(= (select |#valid| main_~list~0.base) 1), 5779#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 5780#(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)), 5781#(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)))), 5782#(and (= |main_#t~mem3.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem3.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem3.base|))), 5783#(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))), 5784#(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)))), 5785#(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)))), 5786#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem12.base|) |main_#t~mem12.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|))), 5787#(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))), 5788#(and (= |main_#t~mem11.offset| 0) (= |main_#t~mem11.base| 0))] [2018-04-11 14:59:22,838 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:22,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 14:59:22,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 14:59:22,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-04-11 14:59:22,838 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 13 states. [2018-04-11 14:59:23,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:59:23,128 INFO L93 Difference]: Finished difference Result 151 states and 158 transitions. [2018-04-11 14:59:23,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 14:59:23,129 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-04-11 14:59:23,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:59:23,129 INFO L225 Difference]: With dead ends: 151 [2018-04-11 14:59:23,129 INFO L226 Difference]: Without dead ends: 126 [2018-04-11 14:59:23,129 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2018-04-11 14:59:23,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-11 14:59:23,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2018-04-11 14:59:23,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-11 14:59:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-04-11 14:59:23,131 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 55 [2018-04-11 14:59:23,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:59:23,131 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-04-11 14:59:23,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 14:59:23,132 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-04-11 14:59:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 14:59:23,132 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:59:23,132 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:59:23,132 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:59:23,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1014070912, now seen corresponding path program 1 times [2018-04-11 14:59:23,133 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:59:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:59:23,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:59:23,422 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:23,422 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:59:23,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 14:59:23,422 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:59:23,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:23,422 INFO L182 omatonBuilderFactory]: Interpolants [6080#(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)), 6081#(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)))), 6082#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem3.base|) (= |main_#t~mem3.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~mem3.base|))), 6083#(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))), 6084#(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))), 6085#(and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~list~0.base |main_#t~malloc5.base|)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc5.base|)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 6086#(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)) (not (= main_~end~0.base (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))), 6087#(and (= |main_#t~mem6.base| (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~mem6.base|)) (not (= main_~list~0.base |main_#t~mem6.base|))), 6088#(and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~end~0.base (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)))), 6089#(and (= main_~end~0.base (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 |#valid| main_~end~0.base))), 6090#(= 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)))), 6091#(= 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)))), 6092#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|))), 6093#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 6094#(= 1 (select |#valid| |main_#t~mem9.base|)), 6095#(= 1 (select |#valid| main_~end~0.base)), 6076#true, 6077#false, 6078#(= (select |#valid| main_~list~0.base) 1), 6079#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1))] [2018-04-11 14:59:23,423 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:23,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 14:59:23,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 14:59:23,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-04-11 14:59:23,423 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 20 states. [2018-04-11 14:59:24,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:59:24,081 INFO L93 Difference]: Finished difference Result 161 states and 168 transitions. [2018-04-11 14:59:24,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 14:59:24,081 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-04-11 14:59:24,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:59:24,081 INFO L225 Difference]: With dead ends: 161 [2018-04-11 14:59:24,081 INFO L226 Difference]: Without dead ends: 161 [2018-04-11 14:59:24,100 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=1071, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 14:59:24,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-11 14:59:24,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 118. [2018-04-11 14:59:24,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 14:59:24,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-04-11 14:59:24,102 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 55 [2018-04-11 14:59:24,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:59:24,102 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-04-11 14:59:24,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 14:59:24,102 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-04-11 14:59:24,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 14:59:24,103 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:59:24,103 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:59:24,103 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:59:24,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1014070911, now seen corresponding path program 1 times [2018-04-11 14:59:24,104 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:59:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:59:24,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:59:24,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:24,337 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:59:24,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 14:59:24,338 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:59:24,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:24,338 INFO L182 omatonBuilderFactory]: Interpolants [6407#true, 6408#false, 6409#(= (select |#valid| main_~list~0.base) 1), 6410#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 6411#(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)), 6412#(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)))), 6413#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem3.base|) (= |main_#t~mem3.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~mem3.base|))), 6414#(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))), 6415#(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))), 6416#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~end~0.base main_~list~0.base)) (not (= main_~list~0.base |main_#t~malloc5.base|)) (= 8 (select |#length| |main_#t~malloc5.base|)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc5.base|)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 6417#(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)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (select (select |#memory_$Pointer$.offset| 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))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))))), 6418#(and (= 8 (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)))) (= 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))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|)) (not (= main_~list~0.base |main_#t~mem6.base|))), 6419#(and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= 8 (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)))) (= 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)))), 6420#(and (= 8 (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)))) (= 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)))), 6421#(and (= 8 (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)))) (= 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)))), 6422#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem12.base|) |main_#t~mem12.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|)))), 6423#(and (= 8 (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))), 6424#(and (= 0 |main_#t~mem9.offset|) (= 8 (select |#length| |main_#t~mem9.base|))), 6425#(and (= main_~end~0.offset 0) (= 8 (select |#length| main_~end~0.base)))] [2018-04-11 14:59:24,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:24,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 14:59:24,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 14:59:24,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-04-11 14:59:24,339 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 19 states. [2018-04-11 14:59:24,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:59:24,886 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2018-04-11 14:59:24,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 14:59:24,886 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-04-11 14:59:24,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:59:24,887 INFO L225 Difference]: With dead ends: 159 [2018-04-11 14:59:24,887 INFO L226 Difference]: Without dead ends: 159 [2018-04-11 14:59:24,887 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2018-04-11 14:59:24,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-04-11 14:59:24,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 118. [2018-04-11 14:59:24,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 14:59:24,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-04-11 14:59:24,890 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 55 [2018-04-11 14:59:24,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:59:24,890 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-04-11 14:59:24,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 14:59:24,890 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-04-11 14:59:24,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-11 14:59:24,891 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:59:24,891 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:59:24,891 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:59:24,891 INFO L82 PathProgramCache]: Analyzing trace with hash -817344126, now seen corresponding path program 3 times [2018-04-11 14:59:24,892 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:59:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:59:24,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:59:25,054 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:25,054 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:59:25,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 14:59:25,054 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:59:25,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:25,055 INFO L182 omatonBuilderFactory]: Interpolants [6729#true, 6730#false, 6731#(= (select |#valid| main_~list~0.base) 1), 6732#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 6733#(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)), 6734#(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)))), 6735#(and (= |main_#t~mem3.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (not (= main_~list~0.base |main_#t~mem3.base|))), 6736#(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)), 6737#(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|))), 6738#(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)))), 6739#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem3.base|))), 6740#(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)))), 6741#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 6742#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 6743#(= 1 (select |#valid| |main_#t~mem12.base|)), 6744#(= 1 (select |#valid| main_~end~0.base))] [2018-04-11 14:59:25,055 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:25,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 14:59:25,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 14:59:25,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-04-11 14:59:25,055 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 16 states. [2018-04-11 14:59:25,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:59:25,507 INFO L93 Difference]: Finished difference Result 194 states and 203 transitions. [2018-04-11 14:59:25,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 14:59:25,507 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2018-04-11 14:59:25,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:59:25,508 INFO L225 Difference]: With dead ends: 194 [2018-04-11 14:59:25,508 INFO L226 Difference]: Without dead ends: 194 [2018-04-11 14:59:25,508 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2018-04-11 14:59:25,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-04-11 14:59:25,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 150. [2018-04-11 14:59:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-11 14:59:25,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2018-04-11 14:59:25,510 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 56 [2018-04-11 14:59:25,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:59:25,510 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2018-04-11 14:59:25,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 14:59:25,510 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-04-11 14:59:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-11 14:59:25,510 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:59:25,510 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:59:25,510 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:59:25,511 INFO L82 PathProgramCache]: Analyzing trace with hash -817344125, now seen corresponding path program 2 times [2018-04-11 14:59:25,511 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:59:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:59:25,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:59:25,732 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:25,732 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:59:25,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 14:59:25,732 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:59:25,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:25,733 INFO L182 omatonBuilderFactory]: Interpolants [7117#true, 7118#false, 7119#(= (select |#valid| main_~list~0.base) 1), 7120#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 7121#(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|) (= 8 (select |#length| |main_#t~malloc2.base|))), 7122#(and (= 8 (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)))), 7123#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem3.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| |main_#t~mem3.base|)) (= (select |#valid| main_~list~0.base) 1) (not (= main_~list~0.base |main_#t~mem3.base|))), 7124#(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) (= 8 (select |#length| main_~end~0.base))), 7125#(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)) (not (= main_~list~0.base |main_#t~malloc2.base|)) (= 8 (select |#length| main_~end~0.base))), 7126#(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)) (= 8 (select |#length| main_~end~0.base))), 7127#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem3.base|))), 7128#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 7129#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 7130#(and (= 8 (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))), 7131#(and (= 0 |main_#t~mem12.offset|) (= 8 (select |#length| |main_#t~mem12.base|))), 7132#(and (= main_~end~0.offset 0) (= 8 (select |#length| main_~end~0.base)))] [2018-04-11 14:59:25,733 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:25,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 14:59:25,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 14:59:25,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-04-11 14:59:25,734 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand 16 states. [2018-04-11 14:59:26,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:59:26,288 INFO L93 Difference]: Finished difference Result 200 states and 212 transitions. [2018-04-11 14:59:26,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 14:59:26,288 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2018-04-11 14:59:26,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:59:26,288 INFO L225 Difference]: With dead ends: 200 [2018-04-11 14:59:26,288 INFO L226 Difference]: Without dead ends: 200 [2018-04-11 14:59:26,289 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2018-04-11 14:59:26,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-04-11 14:59:26,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 152. [2018-04-11 14:59:26,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-11 14:59:26,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2018-04-11 14:59:26,290 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 56 [2018-04-11 14:59:26,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:59:26,291 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2018-04-11 14:59:26,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 14:59:26,291 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2018-04-11 14:59:26,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 14:59:26,291 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:59:26,291 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:59:26,291 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:59:26,291 INFO L82 PathProgramCache]: Analyzing trace with hash 613514207, now seen corresponding path program 1 times [2018-04-11 14:59:26,292 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:59:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 14:59:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 14:59:26,324 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-11 14:59:26,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 02:59:26 BoogieIcfgContainer [2018-04-11 14:59:26,355 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 14:59:26,355 INFO L168 Benchmark]: Toolchain (without parser) took 10972.73 ms. Allocated memory was 396.4 MB in the beginning and 852.5 MB in the end (delta: 456.1 MB). Free memory was 324.9 MB in the beginning and 500.8 MB in the end (delta: -175.9 MB). Peak memory consumption was 280.2 MB. Max. memory is 5.3 GB. [2018-04-11 14:59:26,356 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 396.4 MB. Free memory is still 353.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 14:59:26,356 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.85 ms. Allocated memory is still 396.4 MB. Free memory was 324.9 MB in the beginning and 297.2 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. [2018-04-11 14:59:26,357 INFO L168 Benchmark]: Boogie Preprocessor took 43.83 ms. Allocated memory is still 396.4 MB. Free memory was 297.2 MB in the beginning and 294.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 14:59:26,357 INFO L168 Benchmark]: RCFGBuilder took 472.21 ms. Allocated memory was 396.4 MB in the beginning and 601.9 MB in the end (delta: 205.5 MB). Free memory was 294.5 MB in the beginning and 523.8 MB in the end (delta: -229.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 5.3 GB. [2018-04-11 14:59:26,357 INFO L168 Benchmark]: TraceAbstraction took 10211.09 ms. Allocated memory was 601.9 MB in the beginning and 852.5 MB in the end (delta: 250.6 MB). Free memory was 523.8 MB in the beginning and 500.8 MB in the end (delta: 23.0 MB). Peak memory consumption was 273.6 MB. Max. memory is 5.3 GB. [2018-04-11 14:59:26,358 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.17 ms. Allocated memory is still 396.4 MB. Free memory is still 353.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 242.85 ms. Allocated memory is still 396.4 MB. Free memory was 324.9 MB in the beginning and 297.2 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.83 ms. Allocated memory is still 396.4 MB. Free memory was 297.2 MB in the beginning and 294.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 472.21 ms. Allocated memory was 396.4 MB in the beginning and 601.9 MB in the end (delta: 205.5 MB). Free memory was 294.5 MB in the beginning and 523.8 MB in the end (delta: -229.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10211.09 ms. Allocated memory was 601.9 MB in the beginning and 852.5 MB in the end (delta: 250.6 MB). Free memory was 523.8 MB in the beginning and 500.8 MB in the end (delta: 23.0 MB). Peak memory consumption was 273.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L995] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={12:0}] [L995] SLL* list = malloc(sizeof(SLL)); VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L996] FCALL list->next = ((void*)0) VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L997] FCALL list->colour = BLACK VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L999] SLL* end = list; VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}] [L1005] FCALL end->next = malloc(sizeof(SLL)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}] [L1006] EXPR, FCALL end->next VAL [end={12:0}, end->next={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}] [L1006] end = end->next [L1007] FCALL end->next = ((void*)0) VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1015] FCALL end->colour = RED VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}] [L1016] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1016] FCALL end->next = malloc(sizeof(SLL)) VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1017] EXPR, FCALL end->next VAL [end={11:0}, end->next={10:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1017] end = end->next [L1018] FCALL end->next = ((void*)0) VAL [end={10:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1019] FCALL end->colour = BLACK VAL [end={10:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1027] COND FALSE !(0) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1028] EXPR, FCALL end->colour VAL [end={12:0}, end->colour=1, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1028] COND FALSE !(0) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1030] COND TRUE ((void*)0) != end VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1032] EXPR, FCALL end->colour VAL [end={12:0}, end->colour=1, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR, FCALL end->next VAL [end={12:0}, end->next={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1038] COND FALSE !(!(end->next)) [L1038] COND FALSE !(0) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1039] EXPR, FCALL end->next VAL [end={12:0}, end->next={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1039] end = end->next [L1030] COND TRUE ((void*)0) != end VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1032] EXPR, FCALL end->colour VAL [end={11:0}, end->colour=0, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1032] COND TRUE RED == end->colour [L1034] EXPR, FCALL end->next VAL [end={11:0}, end->next={10:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1034] end = end->next [L1035] EXPR, FCALL end->next VAL [end={10:0}, end->next={0:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1035] end = end->next [L1038] FCALL end->next - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 124 locations, 49 error locations. UNSAFE Result, 10.1s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 6.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1557 SDtfs, 5151 SDslu, 6103 SDs, 0 SdLazy, 9576 SolverSat, 638 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 384 GetRequests, 43 SyntacticMatches, 8 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1199 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 17/112 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 1030 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 853 NumberOfCodeBlocks, 853 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 773 ConstructedInterpolants, 0 QuantifiedInterpolants, 437279 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 12 PerfectInterpolantSequences, 17/112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_14-59-26-363.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_14-59-26-363.csv Received shutdown request...