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/memsafety/test-0504_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 13:16:18,796 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 13:16:18,798 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 13:16:18,811 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 13:16:18,812 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 13:16:18,812 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 13:16:18,813 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 13:16:18,815 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 13:16:18,816 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 13:16:18,817 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 13:16:18,818 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 13:16:18,818 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 13:16:18,819 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 13:16:18,819 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 13:16:18,820 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 13:16:18,822 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 13:16:18,823 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 13:16:18,825 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 13:16:18,826 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 13:16:18,826 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 13:16:18,828 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 13:16:18,828 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 13:16:18,828 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 13:16:18,829 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 13:16:18,830 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 13:16:18,831 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 13:16:18,831 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 13:16:18,831 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 13:16:18,832 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 13:16:18,832 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 13:16:18,833 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 13:16:18,833 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 13:16:18,852 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 13:16:18,853 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 13:16:18,854 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 13:16:18,854 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 13:16:18,854 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 13:16:18,854 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 13:16:18,854 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 13:16:18,854 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 13:16:18,855 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 13:16:18,855 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 13:16:18,855 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 13:16:18,855 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 13:16:18,855 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 13:16:18,855 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 13:16:18,855 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 13:16:18,856 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 13:16:18,856 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 13:16:18,856 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 13:16:18,856 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 13:16:18,856 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 13:16:18,856 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 13:16:18,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 13:16:18,884 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 13:16:18,893 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 13:16:18,897 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 13:16:18,898 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 13:16:18,898 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 13:16:18,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,272 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1c05abc37 [2018-04-11 13:16:19,405 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 13:16:19,405 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 13:16:19,406 INFO L168 CDTParser]: Scanning test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,413 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 13:16:19,414 INFO L215 ultiparseSymbolTable]: [2018-04-11 13:16:19,414 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 13:16:19,414 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,414 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 13:16:19,414 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____rlim64_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,414 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__uid_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,414 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____suseconds_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,414 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__time_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,415 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_rwlock_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,415 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____dev_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,415 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsblkcnt_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,415 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__mode_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,415 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int16_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,415 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__lldiv_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,415 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_short in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,415 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____rlim_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,415 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fd_set in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,415 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____caddr_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_mutex_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__size_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_key_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__sigset_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__blkcnt_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__caddr_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__blksize_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____mode_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_long in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____intptr_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__div_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int16_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint32_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____blkcnt64_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__off_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_rwlockattr_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____nlink_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_char in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____quad_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__timer_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____pthread_list_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____ssize_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____socklen_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_barrier_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_quad_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int32_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint64_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fsfilcnt_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____off_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_mutexattr_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____pid_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsblkcnt64_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_char in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____off64_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__key_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____sig_atomic_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int32_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fd_mask in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____id_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,419 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int32_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,419 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,419 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____gid_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,419 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____timer_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,419 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fsblkcnt_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,419 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_int in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,419 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__dev_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,419 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int8_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,419 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____key_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,419 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint8_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,420 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__loff_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,420 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__uint in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,420 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____clockid_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,420 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__clockid_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,420 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__nlink_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,420 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int64_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,420 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_attr_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,420 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__wchar_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,420 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____useconds_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,420 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fd_mask in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,420 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_once_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,421 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uid_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,421 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ssize_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,421 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____ino_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,421 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____sigset_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,421 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____ino64_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,421 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__quad_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,421 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int16_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,421 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_spinlock_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,421 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_cond_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,421 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____blkcnt_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,421 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__id_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,422 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__gid_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,422 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ldiv_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,422 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int64_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,422 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__daddr_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,422 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int8_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,422 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_short in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,422 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_barrierattr_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,422 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsid_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,422 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__register_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,422 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ulong in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,422 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsfilcnt64_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,422 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_long in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,422 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ino_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,422 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__clock_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,422 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____swblk_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,423 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pid_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,423 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____WAIT_STATUS in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,423 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_quad_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,423 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ushort in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,423 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsfilcnt_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,423 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__suseconds_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,423 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____loff_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,423 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____time_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,423 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int8_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,423 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____qaddr_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,423 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint16_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,423 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____blksize_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,423 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fsid_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,423 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____clock_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,423 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____daddr_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,423 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int64_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,423 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_condattr_t in test-0504_true-valid-memsafety.i [2018-04-11 13:16:19,437 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1c05abc37 [2018-04-11 13:16:19,441 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 13:16:19,442 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 13:16:19,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 13:16:19,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 13:16:19,447 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 13:16:19,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 01:16:19" (1/1) ... [2018-04-11 13:16:19,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2146c475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:16:19, skipping insertion in model container [2018-04-11 13:16:19,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 01:16:19" (1/1) ... [2018-04-11 13:16:19,460 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 13:16:19,484 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 13:16:19,610 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 13:16:19,648 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 13:16:19,654 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 113 non ball SCCs. Number of states in SCCs 113. [2018-04-11 13:16:19,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:16:19 WrapperNode [2018-04-11 13:16:19,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 13:16:19,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 13:16:19,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 13:16:19,684 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 13:16:19,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:16:19" (1/1) ... [2018-04-11 13:16:19,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:16:19" (1/1) ... [2018-04-11 13:16:19,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:16:19" (1/1) ... [2018-04-11 13:16:19,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:16:19" (1/1) ... [2018-04-11 13:16:19,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:16:19" (1/1) ... [2018-04-11 13:16:19,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:16:19" (1/1) ... [2018-04-11 13:16:19,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:16:19" (1/1) ... [2018-04-11 13:16:19,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 13:16:19,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 13:16:19,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 13:16:19,725 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 13:16:19,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:16:19" (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 13:16:19,811 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 13:16:19,811 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 13:16:19,811 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 13:16:19,811 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 13:16:19,811 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 13:16:19,811 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 13:16:19,811 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 13:16:19,811 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 13:16:19,811 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 13:16:19,811 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 13:16:19,811 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 13:16:19,811 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 13:16:19,811 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 13:16:19,812 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 13:16:19,812 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 13:16:19,812 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 13:16:19,812 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 13:16:19,812 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 13:16:19,812 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 13:16:19,812 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 13:16:19,812 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 13:16:19,812 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 13:16:19,812 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 13:16:19,812 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 13:16:19,813 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 13:16:19,813 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 13:16:19,813 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 13:16:19,813 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 13:16:19,813 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 13:16:19,813 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 13:16:19,813 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 13:16:19,813 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 13:16:19,813 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 13:16:19,814 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 13:16:19,814 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 13:16:19,814 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 13:16:19,814 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 13:16:19,814 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 13:16:19,814 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 13:16:19,814 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 13:16:19,814 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 13:16:19,815 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 13:16:19,815 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 13:16:19,815 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 13:16:19,815 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 13:16:19,815 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 13:16:19,815 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 13:16:19,815 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 13:16:19,815 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 13:16:19,815 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 13:16:19,815 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 13:16:19,816 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 13:16:19,816 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 13:16:19,816 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 13:16:19,816 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 13:16:19,816 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 13:16:19,816 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 13:16:19,816 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 13:16:19,816 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 13:16:19,816 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 13:16:19,817 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 13:16:19,817 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 13:16:19,817 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 13:16:19,817 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 13:16:19,817 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 13:16:19,817 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 13:16:19,817 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 13:16:19,817 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 13:16:19,817 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 13:16:19,817 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 13:16:19,818 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 13:16:19,818 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 13:16:19,818 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 13:16:19,818 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 13:16:19,818 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 13:16:19,818 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 13:16:19,818 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 13:16:19,818 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 13:16:19,818 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 13:16:19,818 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 13:16:19,818 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 13:16:19,819 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 13:16:19,819 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 13:16:19,819 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 13:16:19,819 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 13:16:19,819 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 13:16:19,819 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 13:16:19,819 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 13:16:19,819 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 13:16:19,819 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 13:16:19,819 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 13:16:19,820 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 13:16:19,820 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 13:16:19,820 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 13:16:19,820 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 13:16:19,820 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 13:16:19,820 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 13:16:19,820 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 13:16:19,820 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 13:16:19,820 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 13:16:19,820 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 13:16:19,821 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 13:16:19,821 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 13:16:19,821 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 13:16:19,821 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 13:16:19,821 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 13:16:19,821 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 13:16:19,821 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 13:16:19,821 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 13:16:19,821 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 13:16:19,821 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 13:16:19,822 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 13:16:19,822 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 13:16:19,822 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 13:16:19,822 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 13:16:19,822 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 13:16:20,172 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 13:16:20,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 01:16:20 BoogieIcfgContainer [2018-04-11 13:16:20,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 13:16:20,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 13:16:20,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 13:16:20,176 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 13:16:20,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 01:16:19" (1/3) ... [2018-04-11 13:16:20,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302b12d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 01:16:20, skipping insertion in model container [2018-04-11 13:16:20,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:16:19" (2/3) ... [2018-04-11 13:16:20,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302b12d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 01:16:20, skipping insertion in model container [2018-04-11 13:16:20,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 01:16:20" (3/3) ... [2018-04-11 13:16:20,178 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0504_true-valid-memsafety.i [2018-04-11 13:16:20,184 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-11 13:16:20,191 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-04-11 13:16:20,225 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 13:16:20,225 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 13:16:20,225 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 13:16:20,225 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-11 13:16:20,226 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-11 13:16:20,226 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 13:16:20,226 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 13:16:20,226 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 13:16:20,226 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 13:16:20,226 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 13:16:20,239 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-04-11 13:16:20,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-04-11 13:16:20,247 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:20,248 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:20,248 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:20,252 INFO L82 PathProgramCache]: Analyzing trace with hash -671861095, now seen corresponding path program 1 times [2018-04-11 13:16:20,290 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:20,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:20,341 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 13:16:20,343 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:16:20,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 13:16:20,344 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:20,345 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 13:16:20,345 INFO L182 omatonBuilderFactory]: Interpolants [101#true, 102#false] [2018-04-11 13:16:20,345 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 13:16:20,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-11 13:16:20,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-11 13:16:20,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-11 13:16:20,360 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-04-11 13:16:20,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:20,379 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2018-04-11 13:16:20,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-11 13:16:20,380 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-04-11 13:16:20,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:20,389 INFO L225 Difference]: With dead ends: 98 [2018-04-11 13:16:20,389 INFO L226 Difference]: Without dead ends: 95 [2018-04-11 13:16:20,391 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-11 13:16:20,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-11 13:16:20,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-04-11 13:16:20,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-04-11 13:16:20,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-04-11 13:16:20,418 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 10 [2018-04-11 13:16:20,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:20,418 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-04-11 13:16:20,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-11 13:16:20,418 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-04-11 13:16:20,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-11 13:16:20,419 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:20,419 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:20,419 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:20,419 INFO L82 PathProgramCache]: Analyzing trace with hash 117051847, now seen corresponding path program 1 times [2018-04-11 13:16:20,420 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:20,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:20,467 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 13:16:20,467 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:16:20,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:16:20,468 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:20,468 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 13:16:20,468 INFO L182 omatonBuilderFactory]: Interpolants [296#true, 297#false, 298#(and (= main_~first~0.offset 0) (= main_~first~0.base 0))] [2018-04-11 13:16:20,468 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 13:16:20,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 13:16:20,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 13:16:20,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:16:20,470 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 3 states. [2018-04-11 13:16:20,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:20,499 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2018-04-11 13:16:20,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 13:16:20,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-04-11 13:16:20,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:20,500 INFO L225 Difference]: With dead ends: 150 [2018-04-11 13:16:20,500 INFO L226 Difference]: Without dead ends: 150 [2018-04-11 13:16:20,501 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:16:20,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-11 13:16:20,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 126. [2018-04-11 13:16:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-11 13:16:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 156 transitions. [2018-04-11 13:16:20,509 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 156 transitions. Word has length 12 [2018-04-11 13:16:20,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:20,509 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 156 transitions. [2018-04-11 13:16:20,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 13:16:20,509 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 156 transitions. [2018-04-11 13:16:20,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 13:16:20,509 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:20,509 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:20,509 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:20,510 INFO L82 PathProgramCache]: Analyzing trace with hash -666360665, now seen corresponding path program 1 times [2018-04-11 13:16:20,510 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:20,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:20,528 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 13:16:20,529 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:16:20,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 13:16:20,529 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:20,529 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 13:16:20,529 INFO L182 omatonBuilderFactory]: Interpolants [576#false, 577#(= |#valid| |old(#valid)|), 575#true] [2018-04-11 13:16:20,530 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 13:16:20,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 13:16:20,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 13:16:20,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:16:20,530 INFO L87 Difference]: Start difference. First operand 126 states and 156 transitions. Second operand 3 states. [2018-04-11 13:16:20,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:20,577 INFO L93 Difference]: Finished difference Result 128 states and 157 transitions. [2018-04-11 13:16:20,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 13:16:20,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-04-11 13:16:20,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:20,578 INFO L225 Difference]: With dead ends: 128 [2018-04-11 13:16:20,579 INFO L226 Difference]: Without dead ends: 124 [2018-04-11 13:16:20,579 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:16:20,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-11 13:16:20,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-04-11 13:16:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-11 13:16:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 153 transitions. [2018-04-11 13:16:20,583 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 153 transitions. Word has length 13 [2018-04-11 13:16:20,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:20,583 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 153 transitions. [2018-04-11 13:16:20,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 13:16:20,583 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 153 transitions. [2018-04-11 13:16:20,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 13:16:20,584 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:20,584 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:20,584 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:20,584 INFO L82 PathProgramCache]: Analyzing trace with hash -667226745, now seen corresponding path program 1 times [2018-04-11 13:16:20,584 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:20,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:20,611 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 13:16:20,611 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:16:20,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:16:20,611 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:20,611 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 13:16:20,612 INFO L182 omatonBuilderFactory]: Interpolants [832#(= 1 (select |#valid| |main_#t~malloc1.base|)), 833#(= 1 (select |#valid| main_~x~0.base)), 830#true, 831#false] [2018-04-11 13:16:20,612 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 13:16:20,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:16:20,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:16:20,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:16:20,612 INFO L87 Difference]: Start difference. First operand 124 states and 153 transitions. Second operand 4 states. [2018-04-11 13:16:20,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:20,712 INFO L93 Difference]: Finished difference Result 145 states and 168 transitions. [2018-04-11 13:16:20,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 13:16:20,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-11 13:16:20,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:20,713 INFO L225 Difference]: With dead ends: 145 [2018-04-11 13:16:20,713 INFO L226 Difference]: Without dead ends: 145 [2018-04-11 13:16:20,714 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 13:16:20,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-04-11 13:16:20,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2018-04-11 13:16:20,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-11 13:16:20,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 138 transitions. [2018-04-11 13:16:20,719 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 138 transitions. Word has length 13 [2018-04-11 13:16:20,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:20,720 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 138 transitions. [2018-04-11 13:16:20,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:16:20,720 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 138 transitions. [2018-04-11 13:16:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 13:16:20,720 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:20,721 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:20,721 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:20,721 INFO L82 PathProgramCache]: Analyzing trace with hash -667226744, now seen corresponding path program 1 times [2018-04-11 13:16:20,722 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:20,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:20,776 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 13:16:20,776 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:16:20,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:16:20,778 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:20,778 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 13:16:20,778 INFO L182 omatonBuilderFactory]: Interpolants [1098#true, 1099#false, 1100#(and (= 20 (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 1101#(and (= main_~x~0.offset 0) (= 20 (select |#length| main_~x~0.base)))] [2018-04-11 13:16:20,778 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 13:16:20,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:16:20,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:16:20,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:16:20,779 INFO L87 Difference]: Start difference. First operand 116 states and 138 transitions. Second operand 4 states. [2018-04-11 13:16:20,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:20,890 INFO L93 Difference]: Finished difference Result 160 states and 182 transitions. [2018-04-11 13:16:20,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 13:16:20,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-11 13:16:20,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:20,892 INFO L225 Difference]: With dead ends: 160 [2018-04-11 13:16:20,892 INFO L226 Difference]: Without dead ends: 160 [2018-04-11 13:16:20,892 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 13:16:20,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-04-11 13:16:20,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 117. [2018-04-11 13:16:20,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-04-11 13:16:20,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2018-04-11 13:16:20,898 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 13 [2018-04-11 13:16:20,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:20,898 INFO L459 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2018-04-11 13:16:20,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:16:20,898 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2018-04-11 13:16:20,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 13:16:20,899 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:20,899 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:20,899 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:20,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1900820966, now seen corresponding path program 1 times [2018-04-11 13:16:20,900 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:20,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:21,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:21,005 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:16:21,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 13:16:21,006 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:21,006 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 13:16:21,006 INFO L182 omatonBuilderFactory]: Interpolants [1382#true, 1383#false, 1384#(and (= 20 (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 1385#(and (= main_~x~0.offset 0) (= 20 (select |#length| main_~x~0.base))), 1386#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset 0) (= 20 (select |#length| main_~x~0.base)))] [2018-04-11 13:16:21,006 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 13:16:21,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:16:21,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:16:21,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:16:21,007 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand 5 states. [2018-04-11 13:16:21,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:21,135 INFO L93 Difference]: Finished difference Result 214 states and 236 transitions. [2018-04-11 13:16:21,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 13:16:21,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-11 13:16:21,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:21,136 INFO L225 Difference]: With dead ends: 214 [2018-04-11 13:16:21,136 INFO L226 Difference]: Without dead ends: 214 [2018-04-11 13:16:21,136 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:16:21,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-11 13:16:21,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 108. [2018-04-11 13:16:21,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-11 13:16:21,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2018-04-11 13:16:21,146 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 25 [2018-04-11 13:16:21,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:21,146 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2018-04-11 13:16:21,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:16:21,146 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2018-04-11 13:16:21,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 13:16:21,147 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:21,147 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 13:16:21,147 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:21,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1204092197, now seen corresponding path program 1 times [2018-04-11 13:16:21,148 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:21,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:21,198 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 13:16:21,198 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:16:21,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:16:21,198 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:21,198 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 13:16:21,198 INFO L182 omatonBuilderFactory]: Interpolants [1714#true, 1715#false, 1716#(= 1 (select |#valid| |main_#t~malloc3.base|)), 1717#(= 1 (select |#valid| main_~y~0.base))] [2018-04-11 13:16:21,199 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 13:16:21,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:16:21,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:16:21,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:16:21,199 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand 4 states. [2018-04-11 13:16:21,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:21,298 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2018-04-11 13:16:21,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 13:16:21,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-04-11 13:16:21,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:21,299 INFO L225 Difference]: With dead ends: 160 [2018-04-11 13:16:21,300 INFO L226 Difference]: Without dead ends: 160 [2018-04-11 13:16:21,300 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 13:16:21,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-04-11 13:16:21,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 104. [2018-04-11 13:16:21,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-04-11 13:16:21,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2018-04-11 13:16:21,303 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 26 [2018-04-11 13:16:21,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:21,303 INFO L459 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2018-04-11 13:16:21,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:16:21,304 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2018-04-11 13:16:21,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 13:16:21,304 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:21,304 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 13:16:21,304 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:21,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1204092198, now seen corresponding path program 1 times [2018-04-11 13:16:21,305 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:21,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:21,351 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 13:16:21,351 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:16:21,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:16:21,351 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:21,351 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 13:16:21,351 INFO L182 omatonBuilderFactory]: Interpolants [1984#true, 1985#false, 1986#(and (= 0 |main_#t~malloc3.offset|) (= 12 (select |#length| |main_#t~malloc3.base|))), 1987#(and (= 12 (select |#length| main_~y~0.base)) (= main_~y~0.offset 0))] [2018-04-11 13:16:21,351 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 13:16:21,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:16:21,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:16:21,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:16:21,352 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand 4 states. [2018-04-11 13:16:21,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:21,402 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2018-04-11 13:16:21,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 13:16:21,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-04-11 13:16:21,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:21,403 INFO L225 Difference]: With dead ends: 148 [2018-04-11 13:16:21,403 INFO L226 Difference]: Without dead ends: 148 [2018-04-11 13:16:21,404 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 13:16:21,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-11 13:16:21,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 100. [2018-04-11 13:16:21,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-11 13:16:21,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2018-04-11 13:16:21,407 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 26 [2018-04-11 13:16:21,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:21,407 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2018-04-11 13:16:21,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:16:21,407 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2018-04-11 13:16:21,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 13:16:21,408 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:21,408 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] [2018-04-11 13:16:21,408 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:21,408 INFO L82 PathProgramCache]: Analyzing trace with hash -230772510, now seen corresponding path program 1 times [2018-04-11 13:16:21,409 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:21,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:21,440 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 13:16:21,440 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:16:21,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:16:21,441 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:21,441 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 13:16:21,441 INFO L182 omatonBuilderFactory]: Interpolants [2240#(= 1 (select |#valid| main_~x~0.base)), 2241#(= 1 (select |#valid| main_~first~0.base)), 2238#true, 2239#false] [2018-04-11 13:16:21,441 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 13:16:21,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:16:21,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:16:21,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:16:21,442 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand 4 states. [2018-04-11 13:16:21,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:21,508 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2018-04-11 13:16:21,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:16:21,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-04-11 13:16:21,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:21,509 INFO L225 Difference]: With dead ends: 130 [2018-04-11 13:16:21,509 INFO L226 Difference]: Without dead ends: 130 [2018-04-11 13:16:21,509 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 13:16:21,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-04-11 13:16:21,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 103. [2018-04-11 13:16:21,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-11 13:16:21,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2018-04-11 13:16:21,511 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 28 [2018-04-11 13:16:21,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:21,511 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2018-04-11 13:16:21,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:16:21,511 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2018-04-11 13:16:21,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 13:16:21,512 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:21,512 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] [2018-04-11 13:16:21,512 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:21,512 INFO L82 PathProgramCache]: Analyzing trace with hash -230772509, now seen corresponding path program 1 times [2018-04-11 13:16:21,513 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:21,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:21,621 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 13:16:21,621 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:16:21,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 13:16:21,622 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:21,622 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 13:16:21,622 INFO L182 omatonBuilderFactory]: Interpolants [2480#(and (= 20 (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 2481#(and (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 2482#(and (= 20 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)), 2478#true, 2479#false] [2018-04-11 13:16:21,622 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 13:16:21,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:16:21,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:16:21,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:16:21,623 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand 5 states. [2018-04-11 13:16:21,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:21,729 INFO L93 Difference]: Finished difference Result 184 states and 203 transitions. [2018-04-11 13:16:21,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:16:21,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-11 13:16:21,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:21,736 INFO L225 Difference]: With dead ends: 184 [2018-04-11 13:16:21,736 INFO L226 Difference]: Without dead ends: 184 [2018-04-11 13:16:21,737 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:16:21,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-11 13:16:21,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 133. [2018-04-11 13:16:21,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-11 13:16:21,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 151 transitions. [2018-04-11 13:16:21,741 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 151 transitions. Word has length 28 [2018-04-11 13:16:21,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:21,741 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 151 transitions. [2018-04-11 13:16:21,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:16:21,742 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 151 transitions. [2018-04-11 13:16:21,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 13:16:21,742 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:21,742 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:21,742 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:21,746 INFO L82 PathProgramCache]: Analyzing trace with hash -456182561, now seen corresponding path program 1 times [2018-04-11 13:16:21,746 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:21,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:21,807 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 13:16:21,807 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:16:21,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 13:16:21,807 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:21,807 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 13:16:21,807 INFO L182 omatonBuilderFactory]: Interpolants [2806#true, 2807#false, 2808#(= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)), 2809#(= 1 (select |#valid| |main_#t~mem4.base|)), 2810#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))), 2811#(= 1 (select |#valid| |main_#t~mem5.base|))] [2018-04-11 13:16:21,807 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 13:16:21,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 13:16:21,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 13:16:21,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:16:21,808 INFO L87 Difference]: Start difference. First operand 133 states and 151 transitions. Second operand 6 states. [2018-04-11 13:16:21,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:21,911 INFO L93 Difference]: Finished difference Result 202 states and 225 transitions. [2018-04-11 13:16:21,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 13:16:21,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-04-11 13:16:21,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:21,912 INFO L225 Difference]: With dead ends: 202 [2018-04-11 13:16:21,912 INFO L226 Difference]: Without dead ends: 202 [2018-04-11 13:16:21,913 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:16:21,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-04-11 13:16:21,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 149. [2018-04-11 13:16:21,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-11 13:16:21,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2018-04-11 13:16:21,915 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 29 [2018-04-11 13:16:21,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:21,915 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2018-04-11 13:16:21,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 13:16:21,915 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2018-04-11 13:16:21,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 13:16:21,916 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:21,916 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:21,916 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:21,916 INFO L82 PathProgramCache]: Analyzing trace with hash -456182560, now seen corresponding path program 1 times [2018-04-11 13:16:21,917 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:21,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:22,061 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 13:16:22,061 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:16:22,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 13:16:22,061 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:22,061 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 13:16:22,062 INFO L182 omatonBuilderFactory]: Interpolants [3169#true, 3170#false, 3171#(and (= 20 (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 3172#(and (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 3173#(and (= 1 (select |#valid| main_~x~0.base)) (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 3174#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 20 (select |#length| main_~x~0.base)) (= (select |#valid| main_~x~0.base) 1)), 3175#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 20 (select |#length| main_~x~0.base))), 3176#(and (= 0 |main_#t~mem4.offset|) (= 20 (select |#length| |main_#t~mem4.base|))), 3177#(and (= 20 (select |#length| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset))), 3178#(and (= 20 (select |#length| |main_#t~mem5.base|)) (= |main_#t~mem5.offset| 0))] [2018-04-11 13:16:22,062 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 13:16:22,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 13:16:22,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 13:16:22,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:16:22,063 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand 10 states. [2018-04-11 13:16:22,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:22,414 INFO L93 Difference]: Finished difference Result 243 states and 263 transitions. [2018-04-11 13:16:22,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 13:16:22,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-04-11 13:16:22,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:22,415 INFO L225 Difference]: With dead ends: 243 [2018-04-11 13:16:22,415 INFO L226 Difference]: Without dead ends: 243 [2018-04-11 13:16:22,415 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-04-11 13:16:22,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-11 13:16:22,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 149. [2018-04-11 13:16:22,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-11 13:16:22,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 167 transitions. [2018-04-11 13:16:22,417 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 167 transitions. Word has length 29 [2018-04-11 13:16:22,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:22,418 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 167 transitions. [2018-04-11 13:16:22,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 13:16:22,418 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 167 transitions. [2018-04-11 13:16:22,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 13:16:22,418 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:22,418 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] [2018-04-11 13:16:22,418 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:22,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1435986156, now seen corresponding path program 1 times [2018-04-11 13:16:22,419 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:22,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:22,444 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 13:16:22,444 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:16:22,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 13:16:22,444 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:22,444 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 13:16:22,445 INFO L182 omatonBuilderFactory]: Interpolants [3592#true, 3593#false, 3594#(not (= 0 |main_#t~malloc1.base|)), 3595#(not (= 0 main_~x~0.base)), 3596#(not (= 0 main_~first~0.base))] [2018-04-11 13:16:22,445 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 13:16:22,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:16:22,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:16:22,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:16:22,445 INFO L87 Difference]: Start difference. First operand 149 states and 167 transitions. Second operand 5 states. [2018-04-11 13:16:22,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:22,492 INFO L93 Difference]: Finished difference Result 153 states and 163 transitions. [2018-04-11 13:16:22,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:16:22,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-11 13:16:22,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:22,493 INFO L225 Difference]: With dead ends: 153 [2018-04-11 13:16:22,493 INFO L226 Difference]: Without dead ends: 153 [2018-04-11 13:16:22,493 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 13:16:22,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-11 13:16:22,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 148. [2018-04-11 13:16:22,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-11 13:16:22,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 161 transitions. [2018-04-11 13:16:22,495 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 161 transitions. Word has length 29 [2018-04-11 13:16:22,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:22,495 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 161 transitions. [2018-04-11 13:16:22,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:16:22,496 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions. [2018-04-11 13:16:22,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 13:16:22,496 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:22,496 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] [2018-04-11 13:16:22,496 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:22,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1565919907, now seen corresponding path program 1 times [2018-04-11 13:16:22,497 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:22,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:22,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:16:22,528 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:16:22,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:16:22,528 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:22,528 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 13:16:22,528 INFO L182 omatonBuilderFactory]: Interpolants [3904#false, 3905#(= main_~first~0.base main_~x~1.base), 3906#(= 1 (select |#valid| main_~x~1.base)), 3903#true] [2018-04-11 13:16:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:16:22,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:16:22,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:16:22,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:16:22,529 INFO L87 Difference]: Start difference. First operand 148 states and 161 transitions. Second operand 4 states. [2018-04-11 13:16:22,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:22,575 INFO L93 Difference]: Finished difference Result 162 states and 176 transitions. [2018-04-11 13:16:22,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:16:22,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-04-11 13:16:22,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:22,576 INFO L225 Difference]: With dead ends: 162 [2018-04-11 13:16:22,576 INFO L226 Difference]: Without dead ends: 162 [2018-04-11 13:16:22,576 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 13:16:22,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-11 13:16:22,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 151. [2018-04-11 13:16:22,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-04-11 13:16:22,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 166 transitions. [2018-04-11 13:16:22,579 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 166 transitions. Word has length 30 [2018-04-11 13:16:22,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:22,580 INFO L459 AbstractCegarLoop]: Abstraction has 151 states and 166 transitions. [2018-04-11 13:16:22,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:16:22,580 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 166 transitions. [2018-04-11 13:16:22,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 13:16:22,581 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:22,581 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] [2018-04-11 13:16:22,581 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:22,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1565919908, now seen corresponding path program 1 times [2018-04-11 13:16:22,581 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:22,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:22,633 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 13:16:22,634 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:16:22,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 13:16:22,634 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:22,634 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 13:16:22,634 INFO L182 omatonBuilderFactory]: Interpolants [4224#(and (= 20 (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 4225#(and (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 4226#(and (= 20 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)), 4227#(and (= 20 (select |#length| main_~x~1.base)) (= main_~x~1.offset 0)), 4222#true, 4223#false] [2018-04-11 13:16:22,635 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 13:16:22,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 13:16:22,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 13:16:22,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:16:22,635 INFO L87 Difference]: Start difference. First operand 151 states and 166 transitions. Second operand 6 states. [2018-04-11 13:16:22,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:22,758 INFO L93 Difference]: Finished difference Result 227 states and 247 transitions. [2018-04-11 13:16:22,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 13:16:22,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-04-11 13:16:22,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:22,759 INFO L225 Difference]: With dead ends: 227 [2018-04-11 13:16:22,759 INFO L226 Difference]: Without dead ends: 227 [2018-04-11 13:16:22,759 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:16:22,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-04-11 13:16:22,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 165. [2018-04-11 13:16:22,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-04-11 13:16:22,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 186 transitions. [2018-04-11 13:16:22,762 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 186 transitions. Word has length 30 [2018-04-11 13:16:22,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:22,762 INFO L459 AbstractCegarLoop]: Abstraction has 165 states and 186 transitions. [2018-04-11 13:16:22,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 13:16:22,762 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 186 transitions. [2018-04-11 13:16:22,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 13:16:22,762 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:22,762 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 13:16:22,762 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:22,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1482847976, now seen corresponding path program 1 times [2018-04-11 13:16:22,763 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:22,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:22,822 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 13:16:22,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:16:22,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 13:16:22,822 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:22,822 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 13:16:22,822 INFO L182 omatonBuilderFactory]: Interpolants [4630#true, 4631#false, 4632#(= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)), 4633#(= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)), 4634#(= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)), 4635#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))), 4636#(= 1 (select |#valid| |main_#t~mem7.base|)), 4637#(= 1 (select |#valid| main_~y~1.base))] [2018-04-11 13:16:22,822 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 13:16:22,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:16:22,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:16:22,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:16:22,823 INFO L87 Difference]: Start difference. First operand 165 states and 186 transitions. Second operand 8 states. [2018-04-11 13:16:23,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:23,084 INFO L93 Difference]: Finished difference Result 237 states and 265 transitions. [2018-04-11 13:16:23,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:16:23,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-04-11 13:16:23,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:23,085 INFO L225 Difference]: With dead ends: 237 [2018-04-11 13:16:23,085 INFO L226 Difference]: Without dead ends: 237 [2018-04-11 13:16:23,085 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-04-11 13:16:23,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-04-11 13:16:23,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 177. [2018-04-11 13:16:23,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-04-11 13:16:23,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 201 transitions. [2018-04-11 13:16:23,089 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 201 transitions. Word has length 34 [2018-04-11 13:16:23,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:23,089 INFO L459 AbstractCegarLoop]: Abstraction has 177 states and 201 transitions. [2018-04-11 13:16:23,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:16:23,090 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 201 transitions. [2018-04-11 13:16:23,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 13:16:23,090 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:23,090 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 13:16:23,090 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:23,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1482847977, now seen corresponding path program 1 times [2018-04-11 13:16:23,091 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:23,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:23,158 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 13:16:23,158 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:16:23,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 13:16:23,159 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:23,159 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 13:16:23,159 INFO L182 omatonBuilderFactory]: Interpolants [5072#(and (= main_~x~1.offset |main_#t~mem7.offset|) (= main_~x~1.base |main_#t~mem7.base|)), 5073#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base)), 5067#true, 5068#false, 5069#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 5070#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 5071#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset)))] [2018-04-11 13:16:23,159 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 13:16:23,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 13:16:23,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 13:16:23,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:16:23,160 INFO L87 Difference]: Start difference. First operand 177 states and 201 transitions. Second operand 7 states. [2018-04-11 13:16:23,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:23,302 INFO L93 Difference]: Finished difference Result 234 states and 261 transitions. [2018-04-11 13:16:23,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 13:16:23,303 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-04-11 13:16:23,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:23,303 INFO L225 Difference]: With dead ends: 234 [2018-04-11 13:16:23,303 INFO L226 Difference]: Without dead ends: 234 [2018-04-11 13:16:23,303 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-04-11 13:16:23,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-04-11 13:16:23,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 176. [2018-04-11 13:16:23,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-11 13:16:23,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 198 transitions. [2018-04-11 13:16:23,306 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 198 transitions. Word has length 34 [2018-04-11 13:16:23,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:23,306 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 198 transitions. [2018-04-11 13:16:23,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 13:16:23,306 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 198 transitions. [2018-04-11 13:16:23,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 13:16:23,307 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:23,307 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] [2018-04-11 13:16:23,307 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:23,307 INFO L82 PathProgramCache]: Analyzing trace with hash 794616337, now seen corresponding path program 1 times [2018-04-11 13:16:23,308 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:23,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:23,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:23,432 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:23,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 13:16:23,432 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:23,433 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 13:16:23,433 INFO L182 omatonBuilderFactory]: Interpolants [5504#(and (= main_~first~0.base 0) (= 0 main_~first~0.offset)), 5497#true, 5498#false, 5499#(= 0 |main_#t~malloc1.offset|), 5500#(= 0 main_~x~0.offset), 5501#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 main_~x~0.offset)), 5502#(and (= 0 main_~first~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))), 5503#(and (= 0 |main_#t~mem6.base|) (= 0 |main_#t~mem6.offset|))] [2018-04-11 13:16:23,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:23,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:16:23,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:16:23,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:16:23,433 INFO L87 Difference]: Start difference. First operand 176 states and 198 transitions. Second operand 8 states. [2018-04-11 13:16:23,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:23,567 INFO L93 Difference]: Finished difference Result 211 states and 231 transitions. [2018-04-11 13:16:23,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 13:16:23,567 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-04-11 13:16:23,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:23,568 INFO L225 Difference]: With dead ends: 211 [2018-04-11 13:16:23,568 INFO L226 Difference]: Without dead ends: 211 [2018-04-11 13:16:23,568 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-04-11 13:16:23,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-04-11 13:16:23,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 181. [2018-04-11 13:16:23,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-11 13:16:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 203 transitions. [2018-04-11 13:16:23,570 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 203 transitions. Word has length 39 [2018-04-11 13:16:23,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:23,571 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 203 transitions. [2018-04-11 13:16:23,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:16:23,571 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 203 transitions. [2018-04-11 13:16:23,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 13:16:23,571 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:23,571 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:23,571 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:23,572 INFO L82 PathProgramCache]: Analyzing trace with hash 932480026, now seen corresponding path program 1 times [2018-04-11 13:16:23,572 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:23,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:23,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:23,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-11 13:16:23,616 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:23,616 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 13:16:23,616 INFO L182 omatonBuilderFactory]: Interpolants [5920#(or (= main_~last~0.base |main_#t~malloc1.base|) (= 1 (select |#valid| main_~last~0.base))), 5921#(or (= 1 (select |#valid| main_~last~0.base)) (= main_~x~0.base main_~last~0.base)), 5915#true, 5916#false, 5917#(= 1 (select |#valid| |main_#t~malloc1.base|)), 5918#(= 1 (select |#valid| main_~x~0.base)), 5919#(= 1 (select |#valid| main_~last~0.base))] [2018-04-11 13:16:23,616 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:23,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 13:16:23,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 13:16:23,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:16:23,617 INFO L87 Difference]: Start difference. First operand 181 states and 203 transitions. Second operand 7 states. [2018-04-11 13:16:23,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:23,747 INFO L93 Difference]: Finished difference Result 207 states and 230 transitions. [2018-04-11 13:16:23,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:16:23,747 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-04-11 13:16:23,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:23,748 INFO L225 Difference]: With dead ends: 207 [2018-04-11 13:16:23,748 INFO L226 Difference]: Without dead ends: 207 [2018-04-11 13:16:23,749 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:16:23,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-04-11 13:16:23,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 180. [2018-04-11 13:16:23,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-11 13:16:23,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 201 transitions. [2018-04-11 13:16:23,752 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 201 transitions. Word has length 39 [2018-04-11 13:16:23,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:23,752 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 201 transitions. [2018-04-11 13:16:23,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 13:16:23,752 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 201 transitions. [2018-04-11 13:16:23,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 13:16:23,753 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:23,753 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:23,753 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:23,753 INFO L82 PathProgramCache]: Analyzing trace with hash 932480027, now seen corresponding path program 1 times [2018-04-11 13:16:23,754 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:23,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:23,855 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:23,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-11 13:16:23,855 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:23,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 13:16:23,856 INFO L182 omatonBuilderFactory]: Interpolants [6320#(and (= 20 (select |#length| main_~last~0.base)) (= main_~last~0.offset 0)), 6314#true, 6315#false, 6316#(and (= 20 (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 6317#(and (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 6318#(and (= 1 (select |#valid| main_~x~0.base)) (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 6319#(and (= 20 (select |#length| main_~last~0.base)) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0))] [2018-04-11 13:16:23,856 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:23,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 13:16:23,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 13:16:23,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:16:23,857 INFO L87 Difference]: Start difference. First operand 180 states and 201 transitions. Second operand 7 states. [2018-04-11 13:16:24,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:24,107 INFO L93 Difference]: Finished difference Result 269 states and 296 transitions. [2018-04-11 13:16:24,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 13:16:24,108 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-04-11 13:16:24,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:24,109 INFO L225 Difference]: With dead ends: 269 [2018-04-11 13:16:24,109 INFO L226 Difference]: Without dead ends: 269 [2018-04-11 13:16:24,109 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:16:24,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-11 13:16:24,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 179. [2018-04-11 13:16:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-11 13:16:24,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 199 transitions. [2018-04-11 13:16:24,113 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 199 transitions. Word has length 39 [2018-04-11 13:16:24,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:24,113 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 199 transitions. [2018-04-11 13:16:24,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 13:16:24,114 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 199 transitions. [2018-04-11 13:16:24,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 13:16:24,114 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:24,114 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] [2018-04-11 13:16:24,114 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:24,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1136697955, now seen corresponding path program 1 times [2018-04-11 13:16:24,115 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:24,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:24,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:24,235 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:24,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-11 13:16:24,236 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:24,236 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 13:16:24,236 INFO L182 omatonBuilderFactory]: Interpolants [6785#true, 6786#false, 6787#(= |#valid| |old(#valid)|), 6788#(= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0)), 6789#(= (store |#valid| main_~x~0.base 0) |old(#valid)|), 6790#(= (store |#valid| main_~first~0.base 0) |old(#valid)|), 6791#(= |old(#valid)| (store |#valid| main_~x~1.base 0))] [2018-04-11 13:16:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:24,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 13:16:24,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 13:16:24,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:16:24,237 INFO L87 Difference]: Start difference. First operand 179 states and 199 transitions. Second operand 7 states. [2018-04-11 13:16:24,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:24,400 INFO L93 Difference]: Finished difference Result 182 states and 201 transitions. [2018-04-11 13:16:24,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 13:16:24,401 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-04-11 13:16:24,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:24,402 INFO L225 Difference]: With dead ends: 182 [2018-04-11 13:16:24,402 INFO L226 Difference]: Without dead ends: 167 [2018-04-11 13:16:24,402 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-04-11 13:16:24,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-11 13:16:24,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2018-04-11 13:16:24,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-11 13:16:24,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 185 transitions. [2018-04-11 13:16:24,405 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 185 transitions. Word has length 40 [2018-04-11 13:16:24,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:24,405 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 185 transitions. [2018-04-11 13:16:24,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 13:16:24,406 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 185 transitions. [2018-04-11 13:16:24,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 13:16:24,406 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:24,406 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] [2018-04-11 13:16:24,406 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:24,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1024639304, now seen corresponding path program 1 times [2018-04-11 13:16:24,407 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:24,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:24,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:24,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:24,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-11 13:16:24,482 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:24,482 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 13:16:24,482 INFO L182 omatonBuilderFactory]: Interpolants [7152#(and (= 20 (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 7153#(and (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 7154#(and (= 1 (select |#valid| main_~x~0.base)) (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 7155#(and (= 20 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)), 7150#true, 7151#false] [2018-04-11 13:16:24,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:24,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 13:16:24,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 13:16:24,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:16:24,483 INFO L87 Difference]: Start difference. First operand 166 states and 185 transitions. Second operand 6 states. [2018-04-11 13:16:24,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:24,681 INFO L93 Difference]: Finished difference Result 286 states and 317 transitions. [2018-04-11 13:16:24,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 13:16:24,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-04-11 13:16:24,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:24,683 INFO L225 Difference]: With dead ends: 286 [2018-04-11 13:16:24,683 INFO L226 Difference]: Without dead ends: 286 [2018-04-11 13:16:24,683 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-04-11 13:16:24,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-04-11 13:16:24,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 188. [2018-04-11 13:16:24,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-11 13:16:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 209 transitions. [2018-04-11 13:16:24,686 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 209 transitions. Word has length 44 [2018-04-11 13:16:24,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:24,686 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 209 transitions. [2018-04-11 13:16:24,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 13:16:24,686 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 209 transitions. [2018-04-11 13:16:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 13:16:24,686 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:24,687 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:24,687 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:24,687 INFO L82 PathProgramCache]: Analyzing trace with hash 703750570, now seen corresponding path program 1 times [2018-04-11 13:16:24,687 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:24,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:24,773 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:24,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 13:16:24,773 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:24,774 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 13:16:24,774 INFO L182 omatonBuilderFactory]: Interpolants [7648#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~y~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 7649#(or (= main_~y~0.base |main_#t~mem4.base|) (= 1 (select |#valid| |main_#t~mem4.base|))), 7650#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= (select |#valid| main_~y~0.base) 1)), 7651#(= 1 (select |#valid| |main_#t~mem5.base|)), 7643#true, 7644#false, 7645#(= (select |#valid| main_~y~0.base) 1), 7646#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 7647#(or (= |main_#t~malloc3.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))] [2018-04-11 13:16:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:24,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 13:16:24,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 13:16:24,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:16:24,775 INFO L87 Difference]: Start difference. First operand 188 states and 209 transitions. Second operand 9 states. [2018-04-11 13:16:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:24,925 INFO L93 Difference]: Finished difference Result 212 states and 236 transitions. [2018-04-11 13:16:24,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 13:16:24,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-04-11 13:16:24,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:24,926 INFO L225 Difference]: With dead ends: 212 [2018-04-11 13:16:24,926 INFO L226 Difference]: Without dead ends: 212 [2018-04-11 13:16:24,927 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-04-11 13:16:24,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-11 13:16:24,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 187. [2018-04-11 13:16:24,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-04-11 13:16:24,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 207 transitions. [2018-04-11 13:16:24,929 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 207 transitions. Word has length 45 [2018-04-11 13:16:24,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:24,929 INFO L459 AbstractCegarLoop]: Abstraction has 187 states and 207 transitions. [2018-04-11 13:16:24,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 13:16:24,929 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 207 transitions. [2018-04-11 13:16:24,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 13:16:24,929 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:24,929 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:24,929 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:24,929 INFO L82 PathProgramCache]: Analyzing trace with hash 703750571, now seen corresponding path program 1 times [2018-04-11 13:16:24,930 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:24,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:25,098 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:25,098 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:25,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 13:16:25,098 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:25,098 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 13:16:25,099 INFO L182 omatonBuilderFactory]: Interpolants [8064#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 8065#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 8066#(and (<= 12 (select |#length| |main_#t~mem4.base|)) (= 0 |main_#t~mem4.offset|)), 8067#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset))), 8068#(and (<= 12 (select |#length| |main_#t~mem5.base|)) (= |main_#t~mem5.offset| 0)), 8059#true, 8060#false, 8061#(and (= 0 |main_#t~malloc3.offset|) (= 12 (select |#length| |main_#t~malloc3.base|))), 8062#(and (= 12 (select |#length| main_~y~0.base)) (= 0 main_~y~0.offset)), 8063#(and (= (select |#valid| main_~y~0.base) 1) (= (select |#length| main_~y~0.base) 12) (= 0 main_~y~0.offset))] [2018-04-11 13:16:25,099 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:25,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 13:16:25,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 13:16:25,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:16:25,099 INFO L87 Difference]: Start difference. First operand 187 states and 207 transitions. Second operand 10 states. [2018-04-11 13:16:25,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:25,498 INFO L93 Difference]: Finished difference Result 298 states and 327 transitions. [2018-04-11 13:16:25,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 13:16:25,498 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-04-11 13:16:25,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:25,500 INFO L225 Difference]: With dead ends: 298 [2018-04-11 13:16:25,500 INFO L226 Difference]: Without dead ends: 298 [2018-04-11 13:16:25,500 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:16:25,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-04-11 13:16:25,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 167. [2018-04-11 13:16:25,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-04-11 13:16:25,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 185 transitions. [2018-04-11 13:16:25,504 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 185 transitions. Word has length 45 [2018-04-11 13:16:25,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:25,505 INFO L459 AbstractCegarLoop]: Abstraction has 167 states and 185 transitions. [2018-04-11 13:16:25,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 13:16:25,505 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 185 transitions. [2018-04-11 13:16:25,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 13:16:25,505 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:25,506 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] [2018-04-11 13:16:25,506 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:25,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1130858695, now seen corresponding path program 1 times [2018-04-11 13:16:25,509 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:25,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:25,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:16:25,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:16:25,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 13:16:25,607 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:25,607 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 13:16:25,608 INFO L182 omatonBuilderFactory]: Interpolants [8560#false, 8561#(= 0 |main_#t~malloc1.offset|), 8562#(= 0 main_~x~0.offset), 8563#(= 0 main_~first~0.offset), 8564#(and (= main_~first~0.offset 0) (= main_~x~1.offset 0) (= main_~first~0.base main_~x~1.base)), 8565#(and (<= 16 (select |#length| main_~x~1.base)) (= main_~x~1.offset 0)), 8559#true] [2018-04-11 13:16:25,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:16:25,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 13:16:25,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 13:16:25,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:16:25,608 INFO L87 Difference]: Start difference. First operand 167 states and 185 transitions. Second operand 7 states. [2018-04-11 13:16:25,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:25,724 INFO L93 Difference]: Finished difference Result 195 states and 214 transitions. [2018-04-11 13:16:25,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 13:16:25,724 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-04-11 13:16:25,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:25,725 INFO L225 Difference]: With dead ends: 195 [2018-04-11 13:16:25,725 INFO L226 Difference]: Without dead ends: 195 [2018-04-11 13:16:25,725 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:16:25,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-04-11 13:16:25,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 145. [2018-04-11 13:16:25,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-11 13:16:25,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 161 transitions. [2018-04-11 13:16:25,727 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 161 transitions. Word has length 46 [2018-04-11 13:16:25,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:25,727 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 161 transitions. [2018-04-11 13:16:25,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 13:16:25,727 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 161 transitions. [2018-04-11 13:16:25,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 13:16:25,727 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:25,727 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] [2018-04-11 13:16:25,728 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:25,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1086492925, now seen corresponding path program 1 times [2018-04-11 13:16:25,728 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:25,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:25,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:25,776 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:16:25,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 13:16:25,776 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:25,776 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 13:16:25,776 INFO L182 omatonBuilderFactory]: Interpolants [8928#(= 1 (select |#valid| main_~y~1.base)), 8921#true, 8922#false, 8923#(= (select |#valid| main_~y~0.base) 1), 8924#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 8925#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 8926#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))), 8927#(= 1 (select |#valid| |main_#t~mem7.base|))] [2018-04-11 13:16:25,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:25,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:16:25,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:16:25,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:16:25,777 INFO L87 Difference]: Start difference. First operand 145 states and 161 transitions. Second operand 8 states. [2018-04-11 13:16:26,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:26,183 INFO L93 Difference]: Finished difference Result 183 states and 200 transitions. [2018-04-11 13:16:26,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 13:16:26,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-04-11 13:16:26,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:26,185 INFO L225 Difference]: With dead ends: 183 [2018-04-11 13:16:26,185 INFO L226 Difference]: Without dead ends: 183 [2018-04-11 13:16:26,185 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-04-11 13:16:26,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-11 13:16:26,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 157. [2018-04-11 13:16:26,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-04-11 13:16:26,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 176 transitions. [2018-04-11 13:16:26,189 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 176 transitions. Word has length 50 [2018-04-11 13:16:26,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:26,189 INFO L459 AbstractCegarLoop]: Abstraction has 157 states and 176 transitions. [2018-04-11 13:16:26,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:16:26,189 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 176 transitions. [2018-04-11 13:16:26,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 13:16:26,190 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:26,190 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] [2018-04-11 13:16:26,190 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:26,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1086492926, now seen corresponding path program 1 times [2018-04-11 13:16:26,191 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:26,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:26,290 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:16:26,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 13:16:26,291 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:26,291 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 13:16:26,291 INFO L182 omatonBuilderFactory]: Interpolants [9284#true, 9285#false, 9286#(and (= 0 |main_#t~malloc3.offset|) (= 12 (select |#length| |main_#t~malloc3.base|))), 9287#(and (= 12 (select |#length| main_~y~0.base)) (= 0 main_~y~0.offset)), 9288#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 9289#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset))), 9290#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)))), 9291#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 9292#(and (= 12 (select |#length| main_~y~1.base)) (= main_~y~1.offset 0))] [2018-04-11 13:16:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:26,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 13:16:26,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 13:16:26,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:16:26,292 INFO L87 Difference]: Start difference. First operand 157 states and 176 transitions. Second operand 9 states. [2018-04-11 13:16:26,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:26,623 INFO L93 Difference]: Finished difference Result 296 states and 330 transitions. [2018-04-11 13:16:26,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:16:26,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-04-11 13:16:26,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:26,624 INFO L225 Difference]: With dead ends: 296 [2018-04-11 13:16:26,624 INFO L226 Difference]: Without dead ends: 296 [2018-04-11 13:16:26,624 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:16:26,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-04-11 13:16:26,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 157. [2018-04-11 13:16:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-04-11 13:16:26,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 175 transitions. [2018-04-11 13:16:26,627 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 175 transitions. Word has length 50 [2018-04-11 13:16:26,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:26,627 INFO L459 AbstractCegarLoop]: Abstraction has 157 states and 175 transitions. [2018-04-11 13:16:26,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 13:16:26,627 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 175 transitions. [2018-04-11 13:16:26,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 13:16:26,627 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:26,627 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:26,627 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:26,628 INFO L82 PathProgramCache]: Analyzing trace with hash 442651197, now seen corresponding path program 1 times [2018-04-11 13:16:26,628 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:26,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:26,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:26,682 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:16:26,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 13:16:26,682 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:26,682 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 13:16:26,682 INFO L182 omatonBuilderFactory]: Interpolants [9766#true, 9767#false, 9768#(= 0 |main_#t~malloc3.offset|), 9769#(= 0 main_~y~0.offset), 9770#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 9771#(= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset)), 9772#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset)), 9773#(= 0 |main_#t~mem7.offset|), 9774#(= 0 main_~y~1.offset), 9775#(= main_~z~0.offset 0)] [2018-04-11 13:16:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:26,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 13:16:26,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 13:16:26,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:16:26,683 INFO L87 Difference]: Start difference. First operand 157 states and 175 transitions. Second operand 10 states. [2018-04-11 13:16:27,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:27,100 INFO L93 Difference]: Finished difference Result 370 states and 407 transitions. [2018-04-11 13:16:27,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 13:16:27,100 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-04-11 13:16:27,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:27,101 INFO L225 Difference]: With dead ends: 370 [2018-04-11 13:16:27,101 INFO L226 Difference]: Without dead ends: 370 [2018-04-11 13:16:27,101 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:16:27,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-04-11 13:16:27,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 159. [2018-04-11 13:16:27,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-04-11 13:16:27,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 177 transitions. [2018-04-11 13:16:27,104 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 177 transitions. Word has length 52 [2018-04-11 13:16:27,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:27,104 INFO L459 AbstractCegarLoop]: Abstraction has 159 states and 177 transitions. [2018-04-11 13:16:27,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 13:16:27,104 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 177 transitions. [2018-04-11 13:16:27,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 13:16:27,105 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:27,105 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:27,105 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:27,105 INFO L82 PathProgramCache]: Analyzing trace with hash 837285383, now seen corresponding path program 1 times [2018-04-11 13:16:27,106 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:27,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:27,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-11 13:16:27,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:16:27,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:16:27,132 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:27,132 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 13:16:27,132 INFO L182 omatonBuilderFactory]: Interpolants [10336#true, 10337#false, 10338#(= main_~z~0.base main_~y~1.base), 10339#(= 1 (select |#valid| main_~z~0.base))] [2018-04-11 13:16:27,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-11 13:16:27,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:16:27,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:16:27,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:16:27,133 INFO L87 Difference]: Start difference. First operand 159 states and 177 transitions. Second operand 4 states. [2018-04-11 13:16:27,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:27,165 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2018-04-11 13:16:27,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:16:27,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-04-11 13:16:27,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:27,166 INFO L225 Difference]: With dead ends: 158 [2018-04-11 13:16:27,166 INFO L226 Difference]: Without dead ends: 158 [2018-04-11 13:16:27,166 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 13:16:27,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-11 13:16:27,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-04-11 13:16:27,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-11 13:16:27,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 175 transitions. [2018-04-11 13:16:27,168 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 175 transitions. Word has length 53 [2018-04-11 13:16:27,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:27,168 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 175 transitions. [2018-04-11 13:16:27,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:16:27,168 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 175 transitions. [2018-04-11 13:16:27,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 13:16:27,169 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:27,169 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:27,169 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:27,169 INFO L82 PathProgramCache]: Analyzing trace with hash -2106709023, now seen corresponding path program 1 times [2018-04-11 13:16:27,169 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:27,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:27,391 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:27,391 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:27,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 13:16:27,391 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:27,391 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 13:16:27,392 INFO L182 omatonBuilderFactory]: Interpolants [10658#true, 10659#false, 10660#(= 0 |main_#t~malloc1.offset|), 10661#(= main_~x~0.offset 0), 10662#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 10663#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 10664#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= (select |#valid| main_~last~0.base) 1)), 10665#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset)), 10666#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~x~0.base main_~last~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset)), 10667#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset)), 10668#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 10669#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~x~1.offset)) (= main_~x~1.base main_~first~0.base)), 10670#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset))), 10671#(and (= main_~x~1.offset |main_#t~mem7.offset|) (= main_~x~1.base |main_#t~mem7.base|)), 10672#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base))] [2018-04-11 13:16:27,392 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:27,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 13:16:27,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 13:16:27,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-04-11 13:16:27,392 INFO L87 Difference]: Start difference. First operand 158 states and 175 transitions. Second operand 15 states. [2018-04-11 13:16:27,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:27,983 INFO L93 Difference]: Finished difference Result 257 states and 278 transitions. [2018-04-11 13:16:27,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 13:16:27,983 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2018-04-11 13:16:27,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:27,984 INFO L225 Difference]: With dead ends: 257 [2018-04-11 13:16:27,984 INFO L226 Difference]: Without dead ends: 257 [2018-04-11 13:16:27,985 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=824, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 13:16:27,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-04-11 13:16:27,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 185. [2018-04-11 13:16:27,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-11 13:16:27,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 204 transitions. [2018-04-11 13:16:27,987 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 204 transitions. Word has length 53 [2018-04-11 13:16:27,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:27,987 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 204 transitions. [2018-04-11 13:16:27,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 13:16:27,988 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 204 transitions. [2018-04-11 13:16:27,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 13:16:27,988 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:27,988 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] [2018-04-11 13:16:27,988 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:27,988 INFO L82 PathProgramCache]: Analyzing trace with hash 80923932, now seen corresponding path program 1 times [2018-04-11 13:16:27,989 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:27,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:28,088 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:28,088 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:28,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-11 13:16:28,089 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:28,089 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 13:16:28,089 INFO L182 omatonBuilderFactory]: Interpolants [11155#true, 11156#false, 11157#(= 1 (select |#valid| main_~x~0.base)), 11158#(not (= main_~x~0.base |main_#t~malloc3.base|)), 11159#(not (= main_~x~0.base main_~y~0.base)), 11160#(not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 11161#(not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 11162#(not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))), 11163#(not (= main_~x~1.base |main_#t~mem7.base|)), 11164#(not (= main_~x~1.base main_~y~1.base))] [2018-04-11 13:16:28,089 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:28,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 13:16:28,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 13:16:28,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:16:28,090 INFO L87 Difference]: Start difference. First operand 185 states and 204 transitions. Second operand 10 states. [2018-04-11 13:16:28,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:28,417 INFO L93 Difference]: Finished difference Result 347 states and 378 transitions. [2018-04-11 13:16:28,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 13:16:28,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-04-11 13:16:28,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:28,418 INFO L225 Difference]: With dead ends: 347 [2018-04-11 13:16:28,418 INFO L226 Difference]: Without dead ends: 347 [2018-04-11 13:16:28,419 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2018-04-11 13:16:28,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-04-11 13:16:28,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 185. [2018-04-11 13:16:28,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-11 13:16:28,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 203 transitions. [2018-04-11 13:16:28,423 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 203 transitions. Word has length 55 [2018-04-11 13:16:28,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:28,423 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 203 transitions. [2018-04-11 13:16:28,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 13:16:28,424 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 203 transitions. [2018-04-11 13:16:28,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 13:16:28,424 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:28,424 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] [2018-04-11 13:16:28,424 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:28,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1907155547, now seen corresponding path program 1 times [2018-04-11 13:16:28,425 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:28,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:28,765 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:28,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:28,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 13:16:28,765 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:28,765 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 13:16:28,765 INFO L182 omatonBuilderFactory]: Interpolants [11721#true, 11722#false, 11723#(= 0 |main_#t~malloc1.offset|), 11724#(= 0 main_~x~0.offset), 11725#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 11726#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~x~0.offset)), 11727#(and (= main_~y~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 11728#(and (= main_~x~0.base |main_#t~mem4.base|) (= 1 (select |#valid| main_~x~0.base)) (= main_~y~0.offset 0) (= 0 main_~x~0.offset)), 11729#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~y~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (= 0 main_~x~0.offset)), 11730#(and (or (not (= main_~y~0.base |main_#t~mem5.base|)) (= main_~x~0.base |main_#t~mem5.base|)) (or (and (= 1 (select |#valid| main_~x~0.base)) (= main_~y~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= main_~y~0.base |main_#t~mem5.base|)) (= 0 main_~x~0.offset)), 11731#(and (or (and (= 1 (select |#valid| main_~x~0.base)) (= main_~y~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 11732#(and (or (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (= 1 (select |#valid| main_~x~0.base)))) (= 0 main_~x~0.offset)), 11733#(and (or (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0))))) (= 0 main_~first~0.offset)), 11734#(and (= main_~x~1.offset 0) (or (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)))))), 11735#(and (= main_~x~1.offset 0) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0))) (= main_~x~1.base (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0))) (= main_~x~1.base |main_#t~mem7.base|))), 11736#(and (or (not (= 0 main_~y~1.offset)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (= main_~y~1.base main_~x~1.base)) (= main_~x~1.offset 0)), 11737#(or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= main_~z~0.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))) (not (= 0 main_~z~0.offset))), 11738#(or (not (= 0 main_~z~0.offset)) (and (= 1 (select |#valid| |main_#t~mem8.base|)) (not (= main_~z~0.base |main_#t~mem8.base|)))), 11739#(or (not (= 0 main_~z~0.offset)) (and (= 1 (select |#valid| main_~y~1.base)) (not (= main_~z~0.base main_~y~1.base)))), 11740#(and (= 1 (select |#valid| main_~y~1.base)) (not (= main_~z~0.base main_~y~1.base))), 11741#(= 1 (select |#valid| main_~y~1.base))] [2018-04-11 13:16:28,765 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:28,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 13:16:28,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 13:16:28,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-04-11 13:16:28,766 INFO L87 Difference]: Start difference. First operand 185 states and 203 transitions. Second operand 21 states. [2018-04-11 13:16:29,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:29,765 INFO L93 Difference]: Finished difference Result 349 states and 384 transitions. [2018-04-11 13:16:29,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 13:16:29,765 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2018-04-11 13:16:29,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:29,766 INFO L225 Difference]: With dead ends: 349 [2018-04-11 13:16:29,766 INFO L226 Difference]: Without dead ends: 349 [2018-04-11 13:16:29,767 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=381, Invalid=2069, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 13:16:29,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-04-11 13:16:29,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 221. [2018-04-11 13:16:29,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-11 13:16:29,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 243 transitions. [2018-04-11 13:16:29,770 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 243 transitions. Word has length 57 [2018-04-11 13:16:29,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:29,771 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 243 transitions. [2018-04-11 13:16:29,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 13:16:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 243 transitions. [2018-04-11 13:16:29,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 13:16:29,771 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:29,772 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] [2018-04-11 13:16:29,772 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:29,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1907155548, now seen corresponding path program 1 times [2018-04-11 13:16:29,772 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:29,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:30,183 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:30,183 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:30,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 13:16:30,183 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:30,184 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 13:16:30,184 INFO L182 omatonBuilderFactory]: Interpolants [12384#(and (or (= main_~y~0.base main_~x~0.base) (and (not (= main_~y~0.base |main_#t~mem5.base|)) (= main_~y~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)))) (= 0 main_~x~0.offset)), 12385#(and (or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) main_~x~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 main_~x~0.offset)), 12386#(and (= 0 main_~first~0.offset) (or (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)))), 12387#(and (= main_~x~1.offset 0) (or (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0))))), 12388#(and (= main_~x~1.offset 0) (or (= main_~x~1.base |main_#t~mem7.base|) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) 0)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0))))), 12389#(and (= main_~x~1.offset 0) (or (not (= 0 main_~y~1.offset)) (= main_~y~1.base main_~x~1.base) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))))), 12390#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))), 12391#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset |main_#t~mem8.offset|) (= main_~x~1.base |main_#t~mem8.base|))), 12392#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base))), 12393#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base)), 12375#true, 12376#false, 12377#(= 0 |main_#t~malloc1.offset|), 12378#(= 0 main_~x~0.offset), 12379#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 12380#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~x~0.offset)), 12381#(and (or (= main_~y~0.base main_~x~0.base) (and (= main_~y~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))) (= 0 main_~x~0.offset)), 12382#(and (or (= main_~y~0.base main_~x~0.base) (and (= main_~x~0.base |main_#t~mem4.base|) (= main_~y~0.offset 0) (= |main_#t~mem4.offset| main_~x~0.offset))) (= 0 main_~x~0.offset)), 12383#(and (or (and (= main_~y~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= main_~y~0.base main_~x~0.base)) (= 0 main_~x~0.offset))] [2018-04-11 13:16:30,184 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:30,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 13:16:30,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 13:16:30,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-04-11 13:16:30,185 INFO L87 Difference]: Start difference. First operand 221 states and 243 transitions. Second operand 19 states. [2018-04-11 13:16:31,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:31,225 INFO L93 Difference]: Finished difference Result 380 states and 422 transitions. [2018-04-11 13:16:31,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 13:16:31,225 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2018-04-11 13:16:31,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:31,226 INFO L225 Difference]: With dead ends: 380 [2018-04-11 13:16:31,226 INFO L226 Difference]: Without dead ends: 380 [2018-04-11 13:16:31,227 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=384, Invalid=2166, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 13:16:31,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-04-11 13:16:31,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 220. [2018-04-11 13:16:31,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-11 13:16:31,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 240 transitions. [2018-04-11 13:16:31,231 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 240 transitions. Word has length 57 [2018-04-11 13:16:31,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:31,231 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 240 transitions. [2018-04-11 13:16:31,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 13:16:31,245 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 240 transitions. [2018-04-11 13:16:31,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 13:16:31,245 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:31,245 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:31,246 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:31,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1007721596, now seen corresponding path program 1 times [2018-04-11 13:16:31,246 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:31,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:31,340 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:31,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 13:16:31,340 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:31,340 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 13:16:31,340 INFO L182 omatonBuilderFactory]: Interpolants [13072#(= 1 (select |#valid| main_~x~1.base)), 13063#true, 13064#false, 13065#(= 0 |main_#t~malloc1.offset|), 13066#(= 0 main_~x~0.offset), 13067#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 13068#(and (= 0 main_~first~0.offset) (= 1 (select |#valid| main_~first~0.base))), 13069#(and (= main_~x~1.offset 0) (= 1 (select |#valid| main_~x~1.base))), 13070#(or (not (= 0 main_~z~0.offset)) (and (not (= main_~z~0.base main_~x~1.base)) (= 1 (select |#valid| main_~x~1.base)))), 13071#(and (not (= main_~z~0.base main_~x~1.base)) (= 1 (select |#valid| main_~x~1.base)))] [2018-04-11 13:16:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:31,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 13:16:31,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 13:16:31,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:16:31,341 INFO L87 Difference]: Start difference. First operand 220 states and 240 transitions. Second operand 10 states. [2018-04-11 13:16:31,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:31,589 INFO L93 Difference]: Finished difference Result 246 states and 261 transitions. [2018-04-11 13:16:31,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 13:16:31,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-04-11 13:16:31,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:31,590 INFO L225 Difference]: With dead ends: 246 [2018-04-11 13:16:31,590 INFO L226 Difference]: Without dead ends: 246 [2018-04-11 13:16:31,590 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:16:31,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-04-11 13:16:31,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 215. [2018-04-11 13:16:31,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-04-11 13:16:31,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 234 transitions. [2018-04-11 13:16:31,592 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 234 transitions. Word has length 58 [2018-04-11 13:16:31,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:31,592 INFO L459 AbstractCegarLoop]: Abstraction has 215 states and 234 transitions. [2018-04-11 13:16:31,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 13:16:31,592 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 234 transitions. [2018-04-11 13:16:31,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 13:16:31,593 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:31,593 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:31,593 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:31,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1701339320, now seen corresponding path program 1 times [2018-04-11 13:16:31,593 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:31,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:31,739 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:31,739 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:31,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-11 13:16:31,739 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:31,739 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 13:16:31,739 INFO L182 omatonBuilderFactory]: Interpolants [13568#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset)), 13569#(and (not (= main_~x~0.base main_~last~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12)))) (= main_~last~0.base main_~first~0.base) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12)))) (= main_~last~0.offset main_~first~0.offset)), 13570#(and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))), 13571#(and (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))), 13572#(and (= 1 (select |#valid| |main_#t~mem6.base|)) (not (= main_~x~1.base |main_#t~mem6.base|))), 13573#(and (not (= main_~x~1.base main_~first~0.base)) (= 1 (select |#valid| main_~first~0.base))), 13574#(= 1 (select |#valid| main_~first~0.base)), 13563#true, 13564#false, 13565#(= 1 (select |#valid| main_~x~0.base)), 13566#(and (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 13567#(and (= main_~last~0.base main_~first~0.base) (not (= main_~first~0.base |main_#t~malloc1.base|)) (= main_~last~0.offset main_~first~0.offset) (= 1 (select |#valid| |main_#t~malloc1.base|)))] [2018-04-11 13:16:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:31,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 13:16:31,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 13:16:31,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-04-11 13:16:31,740 INFO L87 Difference]: Start difference. First operand 215 states and 234 transitions. Second operand 12 states. [2018-04-11 13:16:32,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:32,064 INFO L93 Difference]: Finished difference Result 311 states and 335 transitions. [2018-04-11 13:16:32,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 13:16:32,064 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-04-11 13:16:32,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:32,065 INFO L225 Difference]: With dead ends: 311 [2018-04-11 13:16:32,065 INFO L226 Difference]: Without dead ends: 311 [2018-04-11 13:16:32,065 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:16:32,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-04-11 13:16:32,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 276. [2018-04-11 13:16:32,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-04-11 13:16:32,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 303 transitions. [2018-04-11 13:16:32,067 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 303 transitions. Word has length 58 [2018-04-11 13:16:32,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:32,068 INFO L459 AbstractCegarLoop]: Abstraction has 276 states and 303 transitions. [2018-04-11 13:16:32,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 13:16:32,068 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 303 transitions. [2018-04-11 13:16:32,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 13:16:32,068 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:32,068 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:32,068 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:32,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1701339321, now seen corresponding path program 1 times [2018-04-11 13:16:32,069 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:32,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:32,275 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:32,275 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:32,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-11 13:16:32,276 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:32,276 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 13:16:32,276 INFO L182 omatonBuilderFactory]: Interpolants [14192#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= 0 main_~first~0.offset) (= 20 (select |#length| |main_#t~malloc1.base|)) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset main_~first~0.offset)), 14193#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 14194#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~last~0.base)) (= 20 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~first~0.offset 12)))) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~first~0.offset 12)))), 14195#(and (= main_~first~0.offset 0) (= 20 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 14196#(and (= 0 |main_#t~mem6.offset|) (= 20 (select |#length| |main_#t~mem6.base|))), 14197#(and (= 20 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)), 14186#true, 14187#false, 14188#(= 0 |main_#t~malloc1.offset|), 14189#(= main_~x~0.offset 0), 14190#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 14191#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset))] [2018-04-11 13:16:32,276 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:32,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 13:16:32,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 13:16:32,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-04-11 13:16:32,277 INFO L87 Difference]: Start difference. First operand 276 states and 303 transitions. Second operand 12 states. [2018-04-11 13:16:32,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:32,689 INFO L93 Difference]: Finished difference Result 329 states and 355 transitions. [2018-04-11 13:16:32,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 13:16:32,689 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-04-11 13:16:32,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:32,690 INFO L225 Difference]: With dead ends: 329 [2018-04-11 13:16:32,690 INFO L226 Difference]: Without dead ends: 329 [2018-04-11 13:16:32,691 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2018-04-11 13:16:32,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-04-11 13:16:32,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 289. [2018-04-11 13:16:32,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-04-11 13:16:32,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 321 transitions. [2018-04-11 13:16:32,694 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 321 transitions. Word has length 58 [2018-04-11 13:16:32,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:32,694 INFO L459 AbstractCegarLoop]: Abstraction has 289 states and 321 transitions. [2018-04-11 13:16:32,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 13:16:32,694 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 321 transitions. [2018-04-11 13:16:32,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 13:16:32,695 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:32,695 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:32,695 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:32,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1201910742, now seen corresponding path program 1 times [2018-04-11 13:16:32,696 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:32,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:32,905 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:32,905 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:32,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 13:16:32,905 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:32,905 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 13:16:32,906 INFO L182 omatonBuilderFactory]: Interpolants [14848#false, 14849#(= 0 |main_#t~malloc1.offset|), 14850#(= main_~x~0.offset 0), 14851#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 14852#(and (= main_~first~0.offset main_~last~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 14853#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.offset main_~last~0.offset) (= main_~last~0.base main_~first~0.base) (not (= 0 |main_#t~malloc1.base|))), 14854#(and (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~0.base)) (not (= 0 main_~x~0.base)) (= main_~last~0.base main_~first~0.base)), 14855#(and (not (= main_~x~0.base main_~last~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~first~0.offset 12)))) (= main_~last~0.base main_~first~0.base)), 14856#(not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))), 14857#(not (= 0 |main_#t~mem6.base|)), 14858#(not (= 0 main_~first~0.base)), 14847#true] [2018-04-11 13:16:32,906 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:32,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 13:16:32,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 13:16:32,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-04-11 13:16:32,906 INFO L87 Difference]: Start difference. First operand 289 states and 321 transitions. Second operand 12 states. [2018-04-11 13:16:33,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:33,252 INFO L93 Difference]: Finished difference Result 325 states and 350 transitions. [2018-04-11 13:16:33,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 13:16:33,253 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-04-11 13:16:33,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:33,253 INFO L225 Difference]: With dead ends: 325 [2018-04-11 13:16:33,253 INFO L226 Difference]: Without dead ends: 325 [2018-04-11 13:16:33,254 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:16:33,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-04-11 13:16:33,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 289. [2018-04-11 13:16:33,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-04-11 13:16:33,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 319 transitions. [2018-04-11 13:16:33,256 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 319 transitions. Word has length 59 [2018-04-11 13:16:33,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:33,256 INFO L459 AbstractCegarLoop]: Abstraction has 289 states and 319 transitions. [2018-04-11 13:16:33,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 13:16:33,256 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 319 transitions. [2018-04-11 13:16:33,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 13:16:33,257 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:33,257 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:33,257 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:33,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1395450630, now seen corresponding path program 1 times [2018-04-11 13:16:33,258 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:33,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:33,510 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:33,510 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:33,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 13:16:33,511 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:33,511 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 13:16:33,511 INFO L182 omatonBuilderFactory]: Interpolants [15500#true, 15501#false, 15502#(= 0 |main_#t~malloc1.offset|), 15503#(= main_~x~0.offset 0), 15504#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 15505#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 15506#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset main_~first~0.offset)), 15507#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 15508#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~first~0.offset 12)))), 15509#(and (= main_~first~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 15510#(= 0 |main_#t~mem6.offset|), 15511#(= 0 main_~first~0.offset), 15512#(and (= main_~first~0.offset 0) (= main_~first~0.offset main_~x~1.offset) (= main_~x~1.base main_~first~0.base)), 15513#(and (<= 0 main_~x~1.offset) (<= (+ main_~x~1.offset 16) (select |#length| main_~x~1.base)))] [2018-04-11 13:16:33,511 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:33,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 13:16:33,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 13:16:33,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:16:33,512 INFO L87 Difference]: Start difference. First operand 289 states and 319 transitions. Second operand 14 states. [2018-04-11 13:16:34,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:34,196 INFO L93 Difference]: Finished difference Result 397 states and 438 transitions. [2018-04-11 13:16:34,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 13:16:34,196 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2018-04-11 13:16:34,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:34,197 INFO L225 Difference]: With dead ends: 397 [2018-04-11 13:16:34,197 INFO L226 Difference]: Without dead ends: 397 [2018-04-11 13:16:34,197 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=323, Invalid=1009, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 13:16:34,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-04-11 13:16:34,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 329. [2018-04-11 13:16:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-04-11 13:16:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 369 transitions. [2018-04-11 13:16:34,200 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 369 transitions. Word has length 60 [2018-04-11 13:16:34,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:34,200 INFO L459 AbstractCegarLoop]: Abstraction has 329 states and 369 transitions. [2018-04-11 13:16:34,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 13:16:34,200 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 369 transitions. [2018-04-11 13:16:34,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 13:16:34,201 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:34,201 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:34,201 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:34,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1357207938, now seen corresponding path program 1 times [2018-04-11 13:16:34,201 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:34,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:34,610 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:34,610 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:34,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 13:16:34,610 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:34,610 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 13:16:34,610 INFO L182 omatonBuilderFactory]: Interpolants [16289#true, 16290#false, 16291#(= 0 |main_#t~malloc1.offset|), 16292#(= 0 main_~x~0.offset), 16293#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 main_~x~0.offset)), 16294#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 16295#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (or (= main_~y~0.base main_~x~0.base) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= 0 main_~x~0.offset)), 16296#(and (= main_~x~0.base |main_#t~mem4.base|) (or (and (= 0 |main_#t~mem4.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12)))) (= main_~y~0.base main_~x~0.base)) (= 0 main_~x~0.offset)), 16297#(and (or (= main_~y~0.base main_~x~0.base) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset)))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (= 0 main_~x~0.offset)), 16298#(and (or (= main_~y~0.base main_~x~0.base) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (not (= (+ main_~x~0.offset 8) |main_#t~mem5.offset|)) (= main_~x~0.base |main_#t~mem5.base|) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))))) (= 0 main_~x~0.offset)), 16299#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12)))) (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 16300#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12)))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 main_~x~0.offset)), 16301#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (= 0 main_~first~0.offset)), 16302#(and (or (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))) (= main_~x~1.offset 0)), 16303#(and (or (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (and (= 0 |main_#t~mem6.base|) (= 0 |main_#t~mem6.offset|))) (= main_~x~1.offset 0)), 16304#(and (or (and (= main_~first~0.base 0) (= 0 main_~first~0.offset)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))) (= main_~x~1.offset 0)), 16305#(and (or (and (= main_~first~0.base 0) (= 0 main_~first~0.offset)) (= main_~x~1.base |main_#t~mem7.base|)) (= main_~x~1.offset 0)), 16306#(and (or (and (= main_~first~0.base 0) (= 0 main_~first~0.offset)) (= main_~y~1.base main_~x~1.base)) (= main_~x~1.offset 0)), 16307#(or (and (= main_~first~0.base 0) (= 0 main_~first~0.offset)) (not (= 0 main_~z~0.offset))), 16308#(and (= main_~first~0.base 0) (= 0 main_~first~0.offset))] [2018-04-11 13:16:34,611 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:34,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 13:16:34,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 13:16:34,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-04-11 13:16:34,611 INFO L87 Difference]: Start difference. First operand 329 states and 369 transitions. Second operand 20 states. [2018-04-11 13:16:35,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:35,905 INFO L93 Difference]: Finished difference Result 492 states and 550 transitions. [2018-04-11 13:16:35,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-11 13:16:35,905 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2018-04-11 13:16:35,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:35,907 INFO L225 Difference]: With dead ends: 492 [2018-04-11 13:16:35,907 INFO L226 Difference]: Without dead ends: 492 [2018-04-11 13:16:35,907 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=570, Invalid=2736, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 13:16:35,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2018-04-11 13:16:35,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 334. [2018-04-11 13:16:35,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-04-11 13:16:35,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 374 transitions. [2018-04-11 13:16:35,910 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 374 transitions. Word has length 62 [2018-04-11 13:16:35,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:35,911 INFO L459 AbstractCegarLoop]: Abstraction has 334 states and 374 transitions. [2018-04-11 13:16:35,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 13:16:35,911 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 374 transitions. [2018-04-11 13:16:35,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 13:16:35,911 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:35,911 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:35,911 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:35,911 INFO L82 PathProgramCache]: Analyzing trace with hash 876226256, now seen corresponding path program 1 times [2018-04-11 13:16:35,912 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:35,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:36,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:36,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:36,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 13:16:36,185 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:36,185 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 13:16:36,185 INFO L182 omatonBuilderFactory]: Interpolants [17216#false, 17217#(= |#valid| |old(#valid)|), 17218#(and (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0)) (= 0 |main_#t~malloc1.offset|)), 17219#(and (= (store |#valid| main_~x~0.base 0) |old(#valid)|) (= 0 main_~x~0.offset)), 17220#(and (or (= main_~x~0.base |main_#t~malloc3.base|) (= (store (store |#valid| main_~x~0.base 0) |main_#t~malloc3.base| 0) |old(#valid)|)) (= 0 main_~x~0.offset)), 17221#(and (or (= main_~x~0.base main_~y~0.base) (= |old(#valid)| (store (store |#valid| main_~x~0.base 0) main_~y~0.base 0))) (= 0 main_~x~0.offset)), 17222#(and (or (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= (store (store |#valid| main_~x~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) |old(#valid)|)) (= 0 main_~x~0.offset)), 17223#(and (or (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= (store (store |#valid| main_~first~0.base 0) (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset) 0) |old(#valid)|)) (= 0 main_~first~0.offset)), 17224#(and (or (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= (store (store |#valid| main_~x~1.base 0) (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset) 0) |old(#valid)|)) (= main_~x~1.offset 0)), 17225#(and (or (= |old(#valid)| (store (store |#valid| main_~x~1.base 0) |main_#t~mem7.base| 0)) (= main_~x~1.base |main_#t~mem7.base|)) (= main_~x~1.offset 0)), 17226#(and (or (= |old(#valid)| (store (store |#valid| main_~x~1.base 0) main_~y~1.base 0)) (= main_~y~1.base main_~x~1.base)) (= main_~x~1.offset 0)), 17227#(or (not (= 0 main_~z~0.offset)) (and (= |old(#valid)| (store (store |#valid| main_~x~1.base 0) main_~z~0.base 0)) (not (= main_~z~0.base main_~x~1.base)))), 17228#(and (= |old(#valid)| (store (store |#valid| main_~x~1.base 0) main_~z~0.base 0)) (not (= main_~z~0.base main_~x~1.base))), 17229#(= |old(#valid)| (store |#valid| main_~x~1.base 0)), 17215#true] [2018-04-11 13:16:36,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:36,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 13:16:36,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 13:16:36,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-04-11 13:16:36,186 INFO L87 Difference]: Start difference. First operand 334 states and 374 transitions. Second operand 15 states. [2018-04-11 13:16:36,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:36,869 INFO L93 Difference]: Finished difference Result 338 states and 377 transitions. [2018-04-11 13:16:36,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 13:16:36,869 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-04-11 13:16:36,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:36,870 INFO L225 Difference]: With dead ends: 338 [2018-04-11 13:16:36,870 INFO L226 Difference]: Without dead ends: 316 [2018-04-11 13:16:36,870 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2018-04-11 13:16:36,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-04-11 13:16:36,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 314. [2018-04-11 13:16:36,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-04-11 13:16:36,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 353 transitions. [2018-04-11 13:16:36,872 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 353 transitions. Word has length 63 [2018-04-11 13:16:36,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:36,873 INFO L459 AbstractCegarLoop]: Abstraction has 314 states and 353 transitions. [2018-04-11 13:16:36,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 13:16:36,873 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 353 transitions. [2018-04-11 13:16:36,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 13:16:36,873 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:36,873 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:36,873 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:36,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1309823143, now seen corresponding path program 1 times [2018-04-11 13:16:36,874 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:36,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:16:36,951 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:36,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-11 13:16:36,951 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:36,952 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 13:16:36,952 INFO L182 omatonBuilderFactory]: Interpolants [17920#(and (= main_~first~0.base main_~last~0.base) (= 0 main_~first~0.offset) (= main_~last~0.offset 0)), 17921#(and (= main_~first~0.offset 0) (= main_~first~0.base main_~last~0.base) (<= (+ main_~last~0.offset 16) (select |#length| main_~last~0.base)) (= main_~last~0.offset 0)), 17922#(and (= main_~first~0.offset 0) (<= 16 (select |#length| main_~first~0.base))), 17916#true, 17917#false, 17918#(= 0 |main_#t~malloc1.offset|), 17919#(= 0 main_~x~0.offset)] [2018-04-11 13:16:36,952 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:16:36,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 13:16:36,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 13:16:36,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:16:36,952 INFO L87 Difference]: Start difference. First operand 314 states and 353 transitions. Second operand 7 states. [2018-04-11 13:16:37,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:37,051 INFO L93 Difference]: Finished difference Result 315 states and 352 transitions. [2018-04-11 13:16:37,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 13:16:37,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2018-04-11 13:16:37,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:37,052 INFO L225 Difference]: With dead ends: 315 [2018-04-11 13:16:37,052 INFO L226 Difference]: Without dead ends: 315 [2018-04-11 13:16:37,052 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-04-11 13:16:37,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-04-11 13:16:37,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 279. [2018-04-11 13:16:37,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-04-11 13:16:37,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 312 transitions. [2018-04-11 13:16:37,055 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 312 transitions. Word has length 63 [2018-04-11 13:16:37,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:37,055 INFO L459 AbstractCegarLoop]: Abstraction has 279 states and 312 transitions. [2018-04-11 13:16:37,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 13:16:37,055 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 312 transitions. [2018-04-11 13:16:37,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 13:16:37,056 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:37,056 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:37,056 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:37,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1547538933, now seen corresponding path program 1 times [2018-04-11 13:16:37,056 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:37,068 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:37,277 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:37,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 13:16:37,277 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:37,277 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 13:16:37,278 INFO L182 omatonBuilderFactory]: Interpolants [18530#true, 18531#false, 18532#(= 0 |main_#t~malloc1.offset|), 18533#(= main_~x~0.offset 0), 18534#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 18535#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0)), 18536#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset 0)), 18537#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0) (= 0 main_~x~0.offset)), 18538#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~first~0.offset 12)))), 18539#(and (= main_~first~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 18540#(= 0 |main_#t~mem6.offset|), 18541#(= 0 main_~first~0.offset), 18542#(and (= main_~first~0.offset 0) (= main_~first~0.offset main_~x~1.offset)), 18543#(<= main_~x~1.offset 0), 18544#(and (<= 0 main_~x~1.offset) (<= main_~x~1.offset 0))] [2018-04-11 13:16:37,278 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:37,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 13:16:37,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 13:16:37,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-04-11 13:16:37,278 INFO L87 Difference]: Start difference. First operand 279 states and 312 transitions. Second operand 15 states. [2018-04-11 13:16:37,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:37,751 INFO L93 Difference]: Finished difference Result 336 states and 370 transitions. [2018-04-11 13:16:37,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 13:16:37,752 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 64 [2018-04-11 13:16:37,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:37,752 INFO L225 Difference]: With dead ends: 336 [2018-04-11 13:16:37,752 INFO L226 Difference]: Without dead ends: 336 [2018-04-11 13:16:37,753 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 13:16:37,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-04-11 13:16:37,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 290. [2018-04-11 13:16:37,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-04-11 13:16:37,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 328 transitions. [2018-04-11 13:16:37,759 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 328 transitions. Word has length 64 [2018-04-11 13:16:37,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:37,759 INFO L459 AbstractCegarLoop]: Abstraction has 290 states and 328 transitions. [2018-04-11 13:16:37,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 13:16:37,760 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 328 transitions. [2018-04-11 13:16:37,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 13:16:37,760 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:37,760 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:37,760 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:37,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1547538882, now seen corresponding path program 1 times [2018-04-11 13:16:37,761 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:37,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:38,089 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:38,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:38,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 13:16:38,089 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:38,090 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 13:16:38,090 INFO L182 omatonBuilderFactory]: Interpolants [19210#true, 19211#false, 19212#(= 0 |main_#t~malloc1.offset|), 19213#(= main_~x~0.offset 0), 19214#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 19215#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 19216#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset main_~first~0.offset)), 19217#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 19218#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 19219#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12))) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~last~0.offset main_~first~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~first~0.offset 12)))), 19220#(and (= main_~first~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 19221#(and (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 19222#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) 0)) (= 0 |main_#t~mem6.offset|)), 19223#(and (= 0 main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) 0))), 19224#(= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)), 19225#(and (= main_~x~1.base |main_#t~mem7.base|) (= 1 (select |#valid| main_~x~1.base))), 19226#(and (= main_~x~1.base main_~y~1.base) (= 1 (select |#valid| main_~x~1.base))), 19227#(= 1 (select |#valid| main_~y~1.base))] [2018-04-11 13:16:38,090 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:38,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 13:16:38,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 13:16:38,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:16:38,091 INFO L87 Difference]: Start difference. First operand 290 states and 328 transitions. Second operand 18 states. [2018-04-11 13:16:38,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:38,692 INFO L93 Difference]: Finished difference Result 407 states and 458 transitions. [2018-04-11 13:16:38,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 13:16:38,693 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 64 [2018-04-11 13:16:38,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:38,693 INFO L225 Difference]: With dead ends: 407 [2018-04-11 13:16:38,693 INFO L226 Difference]: Without dead ends: 407 [2018-04-11 13:16:38,694 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=255, Invalid=1305, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 13:16:38,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-04-11 13:16:38,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 333. [2018-04-11 13:16:38,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-04-11 13:16:38,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 381 transitions. [2018-04-11 13:16:38,696 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 381 transitions. Word has length 64 [2018-04-11 13:16:38,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:38,697 INFO L459 AbstractCegarLoop]: Abstraction has 333 states and 381 transitions. [2018-04-11 13:16:38,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 13:16:38,697 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 381 transitions. [2018-04-11 13:16:38,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 13:16:38,697 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:38,697 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:38,697 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:38,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1547538881, now seen corresponding path program 1 times [2018-04-11 13:16:38,698 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:38,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:39,064 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:39,065 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:39,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 13:16:39,065 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:39,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:39,066 INFO L182 omatonBuilderFactory]: Interpolants [20015#true, 20016#false, 20017#(= 0 |main_#t~malloc1.offset|), 20018#(= main_~x~0.offset 0), 20019#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 20020#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 20021#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset main_~first~0.offset)), 20022#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 20023#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 20024#(and (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12))) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~last~0.offset main_~first~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~first~0.offset 12)))), 20025#(and (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 20026#(and (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 20027#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) 0)) (= (select (select |#memory_$Pointer$.offset| |main_#t~mem6.base|) 0) 0) (= 0 |main_#t~mem6.offset|)), 20028#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) 0) 0) (= 0 main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) 0))), 20029#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset))), 20030#(and (= main_~x~1.offset |main_#t~mem7.offset|) (= main_~x~1.base |main_#t~mem7.base|)), 20031#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base))] [2018-04-11 13:16:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:39,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 13:16:39,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 13:16:39,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:16:39,066 INFO L87 Difference]: Start difference. First operand 333 states and 381 transitions. Second operand 17 states. [2018-04-11 13:16:39,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:39,724 INFO L93 Difference]: Finished difference Result 390 states and 439 transitions. [2018-04-11 13:16:39,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 13:16:39,724 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 64 [2018-04-11 13:16:39,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:39,725 INFO L225 Difference]: With dead ends: 390 [2018-04-11 13:16:39,725 INFO L226 Difference]: Without dead ends: 390 [2018-04-11 13:16:39,725 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=1165, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 13:16:39,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-04-11 13:16:39,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 332. [2018-04-11 13:16:39,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-04-11 13:16:39,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 378 transitions. [2018-04-11 13:16:39,728 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 378 transitions. Word has length 64 [2018-04-11 13:16:39,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:39,728 INFO L459 AbstractCegarLoop]: Abstraction has 332 states and 378 transitions. [2018-04-11 13:16:39,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 13:16:39,728 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 378 transitions. [2018-04-11 13:16:39,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 13:16:39,729 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:39,729 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:39,729 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:39,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1847224236, now seen corresponding path program 1 times [2018-04-11 13:16:39,730 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:39,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:40,063 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:40,063 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:40,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 13:16:40,063 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:40,064 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 13:16:40,064 INFO L182 omatonBuilderFactory]: Interpolants [20800#false, 20801#(= 0 |main_#t~malloc1.offset|), 20802#(= 0 main_~x~0.offset), 20803#(and (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 20804#(and (= (select |#valid| main_~y~0.base) 1) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 20805#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 20806#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 20807#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= |main_#t~malloc1.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base |main_#t~malloc1.base|)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base)), 20808#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base)), 20809#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base)), 20810#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base main_~first~0.base)), 20811#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 20812#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset))) (= main_~x~1.base main_~first~0.base)), 20813#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))), 20814#(= 1 (select |#valid| |main_#t~mem7.base|)), 20815#(= 1 (select |#valid| main_~y~1.base)), 20799#true] [2018-04-11 13:16:40,064 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:40,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 13:16:40,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 13:16:40,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:16:40,065 INFO L87 Difference]: Start difference. First operand 332 states and 378 transitions. Second operand 17 states. [2018-04-11 13:16:40,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:40,595 INFO L93 Difference]: Finished difference Result 379 states and 432 transitions. [2018-04-11 13:16:40,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 13:16:40,596 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 69 [2018-04-11 13:16:40,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:40,596 INFO L225 Difference]: With dead ends: 379 [2018-04-11 13:16:40,596 INFO L226 Difference]: Without dead ends: 379 [2018-04-11 13:16:40,597 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=1002, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 13:16:40,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-04-11 13:16:40,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 333. [2018-04-11 13:16:40,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-04-11 13:16:40,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 380 transitions. [2018-04-11 13:16:40,599 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 380 transitions. Word has length 69 [2018-04-11 13:16:40,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:40,599 INFO L459 AbstractCegarLoop]: Abstraction has 333 states and 380 transitions. [2018-04-11 13:16:40,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 13:16:40,599 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 380 transitions. [2018-04-11 13:16:40,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 13:16:40,599 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:40,600 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:40,600 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:40,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1847224237, now seen corresponding path program 1 times [2018-04-11 13:16:40,600 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:40,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:40,858 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:40,873 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:40,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 13:16:40,873 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:40,873 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 13:16:40,874 INFO L182 omatonBuilderFactory]: Interpolants [21569#true, 21570#false, 21571#(= 0 |main_#t~malloc1.offset|), 21572#(= 0 main_~x~0.offset), 21573#(and (= 0 |main_#t~malloc3.offset|) (= 12 (select |#length| |main_#t~malloc3.base|)) (= 0 main_~x~0.offset)), 21574#(and (= 12 (select |#length| main_~y~0.base)) (= 0 main_~y~0.offset) (= 0 main_~x~0.offset)), 21575#(and (= 12 (select |#length| main_~y~0.base)) (= 0 main_~y~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 21576#(and (= 12 (select |#length| main_~y~0.base)) (= (select |#valid| main_~y~0.base) 1) (= 0 main_~y~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 21577#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 21578#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 1) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset)) (= (select |#valid| main_~last~0.base) 1)), 21579#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base |main_#t~malloc1.base|)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset))), 21580#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset))), 21581#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset))), 21582#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset))), 21583#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~x~1.offset)) (= main_~x~1.base main_~first~0.base)), 21584#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)))), 21585#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 21586#(and (= 12 (select |#length| main_~y~1.base)) (= main_~y~1.offset 0))] [2018-04-11 13:16:40,874 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:40,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 13:16:40,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 13:16:40,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:16:40,874 INFO L87 Difference]: Start difference. First operand 333 states and 380 transitions. Second operand 18 states. [2018-04-11 13:16:41,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:41,695 INFO L93 Difference]: Finished difference Result 452 states and 511 transitions. [2018-04-11 13:16:41,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 13:16:41,695 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 69 [2018-04-11 13:16:41,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:41,697 INFO L225 Difference]: With dead ends: 452 [2018-04-11 13:16:41,697 INFO L226 Difference]: Without dead ends: 452 [2018-04-11 13:16:41,697 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=324, Invalid=1482, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 13:16:41,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-04-11 13:16:41,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 333. [2018-04-11 13:16:41,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-04-11 13:16:41,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 379 transitions. [2018-04-11 13:16:41,701 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 379 transitions. Word has length 69 [2018-04-11 13:16:41,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:41,701 INFO L459 AbstractCegarLoop]: Abstraction has 333 states and 379 transitions. [2018-04-11 13:16:41,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 13:16:41,702 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 379 transitions. [2018-04-11 13:16:41,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 13:16:41,702 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:41,702 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:41,702 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:41,703 INFO L82 PathProgramCache]: Analyzing trace with hash -922209364, now seen corresponding path program 2 times [2018-04-11 13:16:41,703 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:41,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:42,341 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:42,341 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:42,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 13:16:42,342 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:42,342 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 13:16:42,342 INFO L182 omatonBuilderFactory]: Interpolants [22432#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0)), 22433#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0)), 22434#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0)), 22435#(and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~x~0.base main_~last~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0)), 22436#(and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~x~0.base main_~last~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0) (= 12 (select |#length| |main_#t~malloc3.base|))), 22437#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~y~0.base main_~last~0.base))))), 22438#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base |main_#t~mem4.base|)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~y~0.base main_~last~0.base))))), 22439#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base main_~first~0.base) (or (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (not (= main_~y~0.base main_~last~0.base))) (= 12 (select |#length| main_~first~0.base))) (= main_~last~0.offset 0)), 22440#(and (not (= main_~x~0.base main_~last~0.base)) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= |main_#t~mem5.base| main_~last~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~y~0.base main_~last~0.base)))) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0)), 22441#(and (not (= main_~x~0.base main_~last~0.base)) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~y~0.base main_~last~0.base)))) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0)), 22442#(and (or (= 12 (select |#length| main_~first~0.base)) (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)))) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0)), 22443#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0)), 22444#(= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)), 22445#(and (= main_~x~1.base main_~first~0.base) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset))), 22446#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))), 22447#(= 1 (select |#valid| |main_#t~mem7.base|)), 22448#(= 1 (select |#valid| main_~y~1.base)), 22426#true, 22427#false, 22428#(= 0 |main_#t~malloc1.offset|), 22429#(= 0 main_~x~0.offset), 22430#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 22431#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset))] [2018-04-11 13:16:42,342 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:42,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 13:16:42,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 13:16:42,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:16:42,342 INFO L87 Difference]: Start difference. First operand 333 states and 379 transitions. Second operand 23 states. [2018-04-11 13:16:43,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:43,545 INFO L93 Difference]: Finished difference Result 465 states and 525 transitions. [2018-04-11 13:16:43,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 13:16:43,545 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 69 [2018-04-11 13:16:43,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:43,546 INFO L225 Difference]: With dead ends: 465 [2018-04-11 13:16:43,546 INFO L226 Difference]: Without dead ends: 465 [2018-04-11 13:16:43,546 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=511, Invalid=2459, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 13:16:43,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-04-11 13:16:43,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 365. [2018-04-11 13:16:43,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-04-11 13:16:43,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 415 transitions. [2018-04-11 13:16:43,549 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 415 transitions. Word has length 69 [2018-04-11 13:16:43,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:43,549 INFO L459 AbstractCegarLoop]: Abstraction has 365 states and 415 transitions. [2018-04-11 13:16:43,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 13:16:43,549 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 415 transitions. [2018-04-11 13:16:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 13:16:43,549 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:43,549 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:43,549 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:43,549 INFO L82 PathProgramCache]: Analyzing trace with hash -922209363, now seen corresponding path program 2 times [2018-04-11 13:16:43,550 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:43,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:44,095 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:44,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 13:16:44,095 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:44,096 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 13:16:44,096 INFO L182 omatonBuilderFactory]: Interpolants [23360#(and (or (and (= main_~first~0.base main_~last~0.base) (= 12 (select |#length| main_~first~0.base))) (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~x~0.base main_~last~0.base)) (not (= main_~last~0.base |main_#t~mem4.base|)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~y~0.base main_~last~0.base)))) (= main_~last~0.offset 0)), 23361#(and (= main_~last~0.offset 0) (or (and (= main_~first~0.base main_~last~0.base) (= 12 (select |#length| main_~first~0.base))) (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~x~0.base main_~last~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (not (= main_~y~0.base main_~last~0.base))))), 23362#(and (= main_~last~0.offset 0) (or (and (= main_~first~0.base main_~last~0.base) (= 12 (select |#length| main_~first~0.base))) (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= |main_#t~mem5.base| main_~last~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~y~0.base main_~last~0.base))))), 23363#(and (or (and (= main_~first~0.base main_~last~0.base) (= 12 (select |#length| main_~first~0.base))) (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~x~0.base main_~last~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~y~0.base main_~last~0.base)))) (= main_~last~0.offset 0)), 23364#(and (or (and (= main_~first~0.base main_~last~0.base) (= 12 (select |#length| main_~first~0.base))) (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~x~0.base main_~last~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset))) (= main_~last~0.offset 0)), 23365#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~last~0.offset 0)), 23366#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 23367#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~x~1.offset)) (= main_~x~1.base main_~first~0.base)), 23368#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset))), 23369#(and (= main_~x~1.offset |main_#t~mem7.offset|) (= main_~x~1.base |main_#t~mem7.base|)), 23370#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base)), 23348#true, 23349#false, 23350#(= 0 |main_#t~malloc1.offset|), 23351#(= 0 main_~x~0.offset), 23352#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 23353#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 23354#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0)), 23355#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~last~0.offset 0)), 23356#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~last~0.offset 0)), 23357#(and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~x~0.base main_~last~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~last~0.offset 0)), 23358#(and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~x~0.base main_~last~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~last~0.offset 0) (= 12 (select |#length| |main_#t~malloc3.base|))), 23359#(and (or (and (= main_~first~0.base main_~last~0.base) (= 12 (select |#length| main_~first~0.base))) (and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~x~0.base main_~last~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~y~0.base main_~last~0.base)))) (= main_~last~0.offset 0))] [2018-04-11 13:16:44,096 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:44,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 13:16:44,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 13:16:44,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:16:44,096 INFO L87 Difference]: Start difference. First operand 365 states and 415 transitions. Second operand 23 states. [2018-04-11 13:16:45,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:45,234 INFO L93 Difference]: Finished difference Result 462 states and 521 transitions. [2018-04-11 13:16:45,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 13:16:45,235 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 69 [2018-04-11 13:16:45,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:45,236 INFO L225 Difference]: With dead ends: 462 [2018-04-11 13:16:45,236 INFO L226 Difference]: Without dead ends: 462 [2018-04-11 13:16:45,236 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=493, Invalid=2369, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 13:16:45,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-04-11 13:16:45,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 364. [2018-04-11 13:16:45,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-04-11 13:16:45,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 412 transitions. [2018-04-11 13:16:45,239 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 412 transitions. Word has length 69 [2018-04-11 13:16:45,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:45,239 INFO L459 AbstractCegarLoop]: Abstraction has 364 states and 412 transitions. [2018-04-11 13:16:45,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 13:16:45,239 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 412 transitions. [2018-04-11 13:16:45,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 13:16:45,240 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:45,240 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:45,240 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:45,240 INFO L82 PathProgramCache]: Analyzing trace with hash 924848251, now seen corresponding path program 2 times [2018-04-11 13:16:45,241 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:45,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:45,715 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:45,715 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:45,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 13:16:45,715 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:45,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:45,715 INFO L182 omatonBuilderFactory]: Interpolants [24264#true, 24265#false, 24266#(= 0 |main_#t~malloc1.offset|), 24267#(= main_~x~0.offset 0), 24268#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 24269#(and (= main_~first~0.offset main_~last~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0)), 24270#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.offset main_~last~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset 0)), 24271#(and (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0) (= 0 main_~x~0.offset)), 24272#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0)), 24273#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16)) main_~last~0.offset)), 24274#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16))) (= main_~last~0.offset main_~first~0.offset)), 24275#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= main_~x~0.offset 0)), 24276#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12)))), 24277#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) (+ 0 12))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem6.base|) (+ 0 12)))), 24278#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (<= 1 main_~first~0.offset) (<= (+ main_~first~0.offset 1) 0)), 24279#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (and (or (<= 1 main_~first~0.offset) (<= (+ main_~first~0.offset 1) 0)) (not (= 0 main_~x~1.offset)))), 24280#(or (not (= 0 main_~x~1.offset)) (and (= 0 |main_#t~mem6.base|) (= 0 |main_#t~mem6.offset|))), 24281#(or (and (= main_~first~0.base 0) (= 0 main_~first~0.offset)) (not (= 0 main_~x~1.offset))), 24282#(and (= main_~first~0.base 0) (= 0 main_~first~0.offset))] [2018-04-11 13:16:45,716 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:45,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 13:16:45,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 13:16:45,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2018-04-11 13:16:45,716 INFO L87 Difference]: Start difference. First operand 364 states and 412 transitions. Second operand 19 states. [2018-04-11 13:16:46,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:46,343 INFO L93 Difference]: Finished difference Result 416 states and 467 transitions. [2018-04-11 13:16:46,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 13:16:46,343 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2018-04-11 13:16:46,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:46,344 INFO L225 Difference]: With dead ends: 416 [2018-04-11 13:16:46,344 INFO L226 Difference]: Without dead ends: 416 [2018-04-11 13:16:46,344 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=254, Invalid=1306, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 13:16:46,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-04-11 13:16:46,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 369. [2018-04-11 13:16:46,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-04-11 13:16:46,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 417 transitions. [2018-04-11 13:16:46,346 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 417 transitions. Word has length 69 [2018-04-11 13:16:46,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:46,346 INFO L459 AbstractCegarLoop]: Abstraction has 369 states and 417 transitions. [2018-04-11 13:16:46,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 13:16:46,347 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 417 transitions. [2018-04-11 13:16:46,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-11 13:16:46,347 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:46,347 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:46,347 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:46,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1394475917, now seen corresponding path program 2 times [2018-04-11 13:16:46,348 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:46,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:46,705 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:46,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 13:16:46,705 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:46,705 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 13:16:46,705 INFO L182 omatonBuilderFactory]: Interpolants [25120#(and (= main_~first~0.offset main_~last~0.offset) (= (store (store |#valid| |main_#t~malloc1.base| 0) main_~first~0.base 0) |old(#valid)|) (= main_~last~0.base main_~first~0.base) (not (= main_~first~0.base |main_#t~malloc1.base|))), 25121#(and (not (= main_~first~0.base main_~x~0.base)) (= main_~first~0.offset main_~last~0.offset) (= (store (store |#valid| main_~x~0.base 0) main_~first~0.base 0) |old(#valid)|) (= main_~last~0.base main_~first~0.base)), 25122#(and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~first~0.offset 12)))) (not (= main_~x~0.base main_~last~0.base)) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12)) 0) main_~first~0.base 0) |old(#valid)|) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset)), 25123#(and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) 0) main_~first~0.base 0) |old(#valid)|)), 25124#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) 0) main_~x~1.base 0) |old(#valid)|) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))), 25125#(and (not (= main_~x~1.base |main_#t~mem6.base|)) (= (store (store |#valid| |main_#t~mem6.base| 0) main_~x~1.base 0) |old(#valid)|)), 25126#(and (= (store (store |#valid| main_~first~0.base 0) main_~x~1.base 0) |old(#valid)|) (not (= main_~x~1.base main_~first~0.base))), 25127#(= (store |#valid| main_~first~0.base 0) |old(#valid)|), 25128#(= |old(#valid)| (store |#valid| main_~x~1.base 0)), 25113#true, 25114#false, 25115#(= |#valid| |old(#valid)|), 25116#(and (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0)) (= 0 |main_#t~malloc1.offset|)), 25117#(and (= main_~x~0.offset 0) (= (store |#valid| main_~x~0.base 0) |old(#valid)|)), 25118#(and (= 1 (select |#valid| main_~x~0.base)) (= (store |#valid| main_~x~0.base 0) |old(#valid)|) (= 0 main_~x~0.offset)), 25119#(and (= main_~first~0.offset main_~last~0.offset) (= (store |#valid| main_~first~0.base 0) |old(#valid)|) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1))] [2018-04-11 13:16:46,705 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:46,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 13:16:46,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 13:16:46,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-04-11 13:16:46,706 INFO L87 Difference]: Start difference. First operand 369 states and 417 transitions. Second operand 16 states. [2018-04-11 13:16:47,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:47,125 INFO L93 Difference]: Finished difference Result 388 states and 435 transitions. [2018-04-11 13:16:47,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 13:16:47,125 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 70 [2018-04-11 13:16:47,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:47,126 INFO L225 Difference]: With dead ends: 388 [2018-04-11 13:16:47,126 INFO L226 Difference]: Without dead ends: 362 [2018-04-11 13:16:47,126 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2018-04-11 13:16:47,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-04-11 13:16:47,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2018-04-11 13:16:47,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-04-11 13:16:47,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 408 transitions. [2018-04-11 13:16:47,128 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 408 transitions. Word has length 70 [2018-04-11 13:16:47,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:47,129 INFO L459 AbstractCegarLoop]: Abstraction has 361 states and 408 transitions. [2018-04-11 13:16:47,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 13:16:47,129 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 408 transitions. [2018-04-11 13:16:47,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-04-11 13:16:47,129 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:47,129 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:47,129 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:47,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1361000748, now seen corresponding path program 1 times [2018-04-11 13:16:47,130 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:47,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:47,390 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:47,390 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:47,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 13:16:47,390 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:47,391 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 13:16:47,391 INFO L182 omatonBuilderFactory]: Interpolants [25898#true, 25899#false, 25900#(= 0 |main_#t~malloc1.offset|), 25901#(= 0 main_~x~0.offset), 25902#(and (= 0 |main_#t~malloc3.offset|) (= 0 main_~x~0.offset)), 25903#(and (= 0 main_~y~0.offset) (= 0 main_~x~0.offset)), 25904#(and (= 0 main_~y~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 25905#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 25906#(and (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset)) (= (select |#valid| main_~last~0.base) 1)), 25907#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset))), 25908#(and (not (= main_~x~0.base main_~last~0.base)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset))), 25909#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset))), 25910#(= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset)), 25911#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~x~1.offset)) (= main_~x~1.base main_~first~0.base)), 25912#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset)), 25913#(= 0 |main_#t~mem7.offset|), 25914#(= 0 main_~y~1.offset), 25915#(= main_~z~0.offset 0)] [2018-04-11 13:16:47,391 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:47,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 13:16:47,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 13:16:47,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:16:47,391 INFO L87 Difference]: Start difference. First operand 361 states and 408 transitions. Second operand 18 states. [2018-04-11 13:16:48,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:48,314 INFO L93 Difference]: Finished difference Result 616 states and 701 transitions. [2018-04-11 13:16:48,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-11 13:16:48,314 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 71 [2018-04-11 13:16:48,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:48,316 INFO L225 Difference]: With dead ends: 616 [2018-04-11 13:16:48,316 INFO L226 Difference]: Without dead ends: 616 [2018-04-11 13:16:48,317 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=689, Invalid=2503, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 13:16:48,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-04-11 13:16:48,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 363. [2018-04-11 13:16:48,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-04-11 13:16:48,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 410 transitions. [2018-04-11 13:16:48,320 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 410 transitions. Word has length 71 [2018-04-11 13:16:48,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:48,320 INFO L459 AbstractCegarLoop]: Abstraction has 363 states and 410 transitions. [2018-04-11 13:16:48,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 13:16:48,320 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 410 transitions. [2018-04-11 13:16:48,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-11 13:16:48,321 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:48,321 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:48,321 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:48,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1705474632, now seen corresponding path program 2 times [2018-04-11 13:16:48,322 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:48,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:48,559 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 11 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:48,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:48,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 13:16:48,560 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:48,560 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 13:16:48,560 INFO L182 omatonBuilderFactory]: Interpolants [26979#true, 26980#false, 26981#(= 0 |main_#t~malloc1.offset|), 26982#(= main_~x~0.offset 0), 26983#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 26984#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 26985#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 26986#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base)), 26987#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base)), 26988#(and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 26989#(and (not (= main_~first~0.base main_~x~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= (select |#valid| main_~first~0.base) 1)), 26990#(and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base))), 26991#(and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base))), 26992#(and (not (= main_~x~0.base main_~first~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~first~0.base))), 26993#(and (not (= main_~x~0.base main_~first~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 26994#(= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)), 26995#(and (= main_~x~1.base main_~first~0.base) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset))), 26996#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))), 26997#(= 1 (select |#valid| |main_#t~mem7.base|)), 26998#(= 1 (select |#valid| main_~y~1.base))] [2018-04-11 13:16:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 11 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:48,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 13:16:48,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 13:16:48,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-04-11 13:16:48,561 INFO L87 Difference]: Start difference. First operand 363 states and 410 transitions. Second operand 20 states. [2018-04-11 13:16:49,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:49,224 INFO L93 Difference]: Finished difference Result 480 states and 540 transitions. [2018-04-11 13:16:49,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 13:16:49,224 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2018-04-11 13:16:49,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:49,225 INFO L225 Difference]: With dead ends: 480 [2018-04-11 13:16:49,225 INFO L226 Difference]: Without dead ends: 480 [2018-04-11 13:16:49,225 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=270, Invalid=1136, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 13:16:49,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-04-11 13:16:49,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 391. [2018-04-11 13:16:49,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-04-11 13:16:49,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 442 transitions. [2018-04-11 13:16:49,228 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 442 transitions. Word has length 72 [2018-04-11 13:16:49,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:49,228 INFO L459 AbstractCegarLoop]: Abstraction has 391 states and 442 transitions. [2018-04-11 13:16:49,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 13:16:49,228 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 442 transitions. [2018-04-11 13:16:49,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-11 13:16:49,228 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:49,228 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:49,229 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:49,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1705474633, now seen corresponding path program 1 times [2018-04-11 13:16:49,229 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:49,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:49,566 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 11 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:49,566 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:49,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 13:16:49,566 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:49,566 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 13:16:49,566 INFO L182 omatonBuilderFactory]: Interpolants [27910#true, 27911#false, 27912#(= 0 |main_#t~malloc1.offset|), 27913#(= main_~x~0.offset 0), 27914#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 27915#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 27916#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= (select |#valid| main_~last~0.base) 1)), 27917#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset)), 27918#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset)), 27919#(and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= (select |#valid| main_~last~0.base) 1)), 27920#(and (not (= main_~first~0.base main_~x~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= (select |#valid| main_~first~0.base) 1)), 27921#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base))), 27922#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base))), 27923#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~x~0.base main_~first~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~first~0.base))), 27924#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~x~0.base main_~first~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 27925#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 27926#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~x~1.offset)) (= main_~x~1.base main_~first~0.base)), 27927#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset))), 27928#(and (= main_~x~1.offset |main_#t~mem7.offset|) (= main_~x~1.base |main_#t~mem7.base|)), 27929#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base))] [2018-04-11 13:16:49,566 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 11 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:49,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 13:16:49,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 13:16:49,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2018-04-11 13:16:49,567 INFO L87 Difference]: Start difference. First operand 391 states and 442 transitions. Second operand 20 states. [2018-04-11 13:16:50,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:50,337 INFO L93 Difference]: Finished difference Result 478 states and 537 transitions. [2018-04-11 13:16:50,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 13:16:50,338 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2018-04-11 13:16:50,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:50,339 INFO L225 Difference]: With dead ends: 478 [2018-04-11 13:16:50,339 INFO L226 Difference]: Without dead ends: 478 [2018-04-11 13:16:50,339 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=280, Invalid=1202, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 13:16:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-04-11 13:16:50,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 390. [2018-04-11 13:16:50,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-04-11 13:16:50,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 439 transitions. [2018-04-11 13:16:50,341 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 439 transitions. Word has length 72 [2018-04-11 13:16:50,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:50,341 INFO L459 AbstractCegarLoop]: Abstraction has 390 states and 439 transitions. [2018-04-11 13:16:50,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 13:16:50,341 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 439 transitions. [2018-04-11 13:16:50,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-11 13:16:50,342 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:50,342 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:50,342 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:50,342 INFO L82 PathProgramCache]: Analyzing trace with hash -235913050, now seen corresponding path program 2 times [2018-04-11 13:16:50,343 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:50,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:50,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:50,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 13:16:50,713 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:50,713 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 13:16:50,713 INFO L182 omatonBuilderFactory]: Interpolants [28840#true, 28841#false, 28842#(= 0 |main_#t~malloc1.offset|), 28843#(= 0 main_~x~0.offset), 28844#(and (= (select |#valid| main_~y~0.base) 1) (= 0 main_~x~0.offset)), 28845#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 0 main_~x~0.offset)), 28846#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~x~0.offset)), 28847#(and (= main_~y~0.offset 0) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base))), 28848#(and (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~y~0.offset 0) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base))), 28849#(and (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~y~0.base)) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset))), 28850#(and (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~y~0.base)) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset))), 28851#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~y~0.base)) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset))), 28852#(and (or (= main_~x~0.base main_~y~0.base) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~y~0.base)))) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset))), 28853#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))))), 28854#(or (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)))) (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset))), 28855#(or (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset 0)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0) (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))))), 28856#(or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0) |main_#t~mem7.base|))) (and (= main_~x~1.base |main_#t~mem7.base|) (= main_~x~1.offset 0))), 28857#(or (not (= 0 main_~y~1.offset)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset) main_~y~1.base))) (and (= main_~y~1.base main_~x~1.base) (= main_~x~1.offset 0))), 28858#(or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= main_~z~0.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))) (not (= 0 main_~z~0.offset))), 28859#(or (not (= 0 main_~z~0.offset)) (and (= 1 (select |#valid| |main_#t~mem8.base|)) (not (= main_~z~0.base |main_#t~mem8.base|)))), 28860#(or (not (= 0 main_~z~0.offset)) (and (= 1 (select |#valid| main_~y~1.base)) (not (= main_~z~0.base main_~y~1.base)))), 28861#(and (= 1 (select |#valid| main_~y~1.base)) (not (= main_~z~0.base main_~y~1.base))), 28862#(= 1 (select |#valid| main_~y~1.base))] [2018-04-11 13:16:50,713 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:50,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 13:16:50,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 13:16:50,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:16:50,713 INFO L87 Difference]: Start difference. First operand 390 states and 439 transitions. Second operand 23 states. [2018-04-11 13:16:51,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:51,922 INFO L93 Difference]: Finished difference Result 430 states and 487 transitions. [2018-04-11 13:16:51,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 13:16:51,922 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 73 [2018-04-11 13:16:51,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:51,923 INFO L225 Difference]: With dead ends: 430 [2018-04-11 13:16:51,923 INFO L226 Difference]: Without dead ends: 430 [2018-04-11 13:16:51,923 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=414, Invalid=2342, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 13:16:51,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-04-11 13:16:51,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 395. [2018-04-11 13:16:51,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-04-11 13:16:51,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 446 transitions. [2018-04-11 13:16:51,926 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 446 transitions. Word has length 73 [2018-04-11 13:16:51,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:51,926 INFO L459 AbstractCegarLoop]: Abstraction has 395 states and 446 transitions. [2018-04-11 13:16:51,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 13:16:51,926 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 446 transitions. [2018-04-11 13:16:51,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-11 13:16:51,927 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:51,927 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:51,927 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:51,927 INFO L82 PathProgramCache]: Analyzing trace with hash -235913049, now seen corresponding path program 2 times [2018-04-11 13:16:51,928 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:51,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:52,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:52,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 13:16:52,379 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:52,379 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 13:16:52,380 INFO L182 omatonBuilderFactory]: Interpolants [29760#(and (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (or (= main_~x~0.base main_~y~0.base) (and (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| |main_#t~mem4.base|)) (= 0 |main_#t~mem4.offset|) (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base))))), 29761#(and (or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~y~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset))) (= main_~x~0.base main_~y~0.base)) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset))), 29762#(and (or (= main_~x~0.base main_~y~0.base) (and (not (= main_~y~0.base |main_#t~mem5.base|)) (= main_~y~0.offset 0) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset)) (= 12 (select |#length| |main_#t~mem5.base|)))) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset))), 29763#(and (or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= main_~y~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset))) (= main_~x~0.base main_~y~0.base)) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset))), 29764#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)))), 29765#(or (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0))))), 29766#(or (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset 0)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0))))), 29767#(or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) 0))) (and (= main_~x~1.base |main_#t~mem7.base|) (= main_~x~1.offset 0))), 29768#(or (and (or (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= 0 main_~y~1.offset))) (or (not (= 0 main_~y~1.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)))) (and (= main_~y~1.base main_~x~1.base) (= main_~x~1.offset 0))), 29769#(and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (not (= 0 main_~z~0.offset))) (or (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= 0 main_~z~0.offset)))), 29770#(or (and (= 0 |main_#t~mem8.offset|) (= 12 (select |#length| |main_#t~mem8.base|))) (not (= 0 main_~z~0.offset))), 29771#(and (or (not (= 0 main_~z~0.offset)) (= 12 (select |#length| main_~y~1.base))) (or (not (= 0 main_~z~0.offset)) (= main_~y~1.offset 0))), 29772#(and (= 12 (select |#length| main_~y~1.base)) (= main_~y~1.offset 0)), 29750#true, 29751#false, 29752#(= 0 |main_#t~malloc1.offset|), 29753#(= 0 main_~x~0.offset), 29754#(and (= 0 |main_#t~malloc3.offset|) (= 12 (select |#length| |main_#t~malloc3.base|)) (= 0 main_~x~0.offset)), 29755#(and (= 12 (select |#length| main_~y~0.base)) (= 0 main_~y~0.offset) (= 0 main_~x~0.offset)), 29756#(and (= 12 (select |#length| main_~y~0.base)) (= (select |#valid| main_~y~0.base) 1) (= 0 main_~y~0.offset) (= 0 main_~x~0.offset)), 29757#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 29758#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 29759#(and (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (or (= main_~x~0.base main_~y~0.base) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))] [2018-04-11 13:16:52,380 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:52,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 13:16:52,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 13:16:52,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:16:52,380 INFO L87 Difference]: Start difference. First operand 395 states and 446 transitions. Second operand 23 states. [2018-04-11 13:16:54,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:54,719 INFO L93 Difference]: Finished difference Result 582 states and 653 transitions. [2018-04-11 13:16:54,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-11 13:16:54,719 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 73 [2018-04-11 13:16:54,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:54,720 INFO L225 Difference]: With dead ends: 582 [2018-04-11 13:16:54,720 INFO L226 Difference]: Without dead ends: 582 [2018-04-11 13:16:54,721 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=681, Invalid=3741, Unknown=0, NotChecked=0, Total=4422 [2018-04-11 13:16:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-04-11 13:16:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 395. [2018-04-11 13:16:54,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-04-11 13:16:54,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 445 transitions. [2018-04-11 13:16:54,724 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 445 transitions. Word has length 73 [2018-04-11 13:16:54,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:54,724 INFO L459 AbstractCegarLoop]: Abstraction has 395 states and 445 transitions. [2018-04-11 13:16:54,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 13:16:54,724 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 445 transitions. [2018-04-11 13:16:54,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-04-11 13:16:54,724 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:54,724 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:54,725 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:54,725 INFO L82 PathProgramCache]: Analyzing trace with hash 920828838, now seen corresponding path program 1 times [2018-04-11 13:16:54,725 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:54,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:55,054 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:55,054 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:55,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 13:16:55,055 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:55,055 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 13:16:55,055 INFO L182 omatonBuilderFactory]: Interpolants [30848#(and (= 0 main_~y~0.offset) (= 0 main_~x~0.offset)), 30849#(and (= (select |#valid| main_~y~0.base) 1) (= 0 main_~y~0.offset) (= 0 main_~x~0.offset)), 30850#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 30851#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 30852#(and (= main_~y~0.offset 0) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 30853#(and (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 |main_#t~mem4.offset|) (= main_~y~0.offset 0) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base))), 30854#(and (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~y~0.base)) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset))), 30855#(and (not (= main_~y~0.base |main_#t~mem5.base|)) (= main_~y~0.offset 0) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset))), 30856#(and (= main_~y~0.offset 0) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset))), 30857#(and (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (or (= main_~x~0.base main_~y~0.base) (and (= main_~y~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset))))), 30858#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))), 30859#(or (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset))), 30860#(or (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0))), 30861#(or (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) 0)) (and (= main_~x~1.base |main_#t~mem7.base|) (= main_~x~1.offset 0))), 30862#(or (not (= 0 main_~y~1.offset)) (and (= main_~y~1.base main_~x~1.base) (= main_~x~1.offset 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset))), 30863#(or (= 0 (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (not (= 0 main_~z~0.offset))), 30864#(or (not (= 0 main_~z~0.offset)) (= 0 |main_#t~mem8.offset|)), 30865#(or (not (= 0 main_~z~0.offset)) (= 0 main_~y~1.offset)), 30866#(= 0 main_~y~1.offset), 30867#(= main_~z~0.offset 0), 30843#true, 30844#false, 30845#(= 0 |main_#t~malloc1.offset|), 30846#(= 0 main_~x~0.offset), 30847#(and (= 0 |main_#t~malloc3.offset|) (= 0 main_~x~0.offset))] [2018-04-11 13:16:55,055 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:55,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 13:16:55,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 13:16:55,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2018-04-11 13:16:55,056 INFO L87 Difference]: Start difference. First operand 395 states and 445 transitions. Second operand 25 states. [2018-04-11 13:16:57,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:16:57,229 INFO L93 Difference]: Finished difference Result 568 states and 643 transitions. [2018-04-11 13:16:57,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-11 13:16:57,229 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 75 [2018-04-11 13:16:57,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:16:57,230 INFO L225 Difference]: With dead ends: 568 [2018-04-11 13:16:57,230 INFO L226 Difference]: Without dead ends: 568 [2018-04-11 13:16:57,231 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=997, Invalid=4855, Unknown=0, NotChecked=0, Total=5852 [2018-04-11 13:16:57,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-04-11 13:16:57,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 397. [2018-04-11 13:16:57,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-04-11 13:16:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 447 transitions. [2018-04-11 13:16:57,233 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 447 transitions. Word has length 75 [2018-04-11 13:16:57,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:16:57,234 INFO L459 AbstractCegarLoop]: Abstraction has 397 states and 447 transitions. [2018-04-11 13:16:57,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 13:16:57,234 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 447 transitions. [2018-04-11 13:16:57,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-11 13:16:57,234 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:16:57,234 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:16:57,234 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:16:57,234 INFO L82 PathProgramCache]: Analyzing trace with hash 585496780, now seen corresponding path program 1 times [2018-04-11 13:16:57,235 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:16:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:16:57,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:16:57,752 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:57,752 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:16:57,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 13:16:57,752 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:16:57,752 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 13:16:57,752 INFO L182 omatonBuilderFactory]: Interpolants [31941#true, 31942#false, 31943#(= 0 |main_#t~malloc1.offset|), 31944#(= 0 main_~x~0.offset), 31945#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 31946#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~x~0.offset)), 31947#(and (or (= main_~x~0.base main_~y~0.base) (and (= main_~y~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 31948#(and (or (and (= main_~y~0.offset 0) (= |main_#t~mem4.offset| main_~x~0.offset)) (= main_~x~0.base main_~y~0.base)) (= main_~x~0.base |main_#t~mem4.base|) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 31949#(and (or (= main_~x~0.base main_~y~0.base) (and (= main_~y~0.offset 0) (= (select |#valid| main_~y~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 31950#(and (or (not (= main_~y~0.base |main_#t~mem5.base|)) (= main_~x~0.base |main_#t~mem5.base|)) (or (= main_~x~0.base main_~y~0.base) (and (= main_~y~0.offset 0) (= (select |#valid| main_~y~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)))) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 31951#(and (or (= main_~x~0.base main_~y~0.base) (and (= main_~y~0.offset 0) (= (select |#valid| main_~y~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)))) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 31952#(and (or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) main_~x~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 31953#(and (or (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 1) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 31954#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (or (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) |main_#t~malloc1.base|)))) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base)), 31955#(and (not (= main_~x~0.base main_~last~0.base)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (or (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0))))), 31956#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (or (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0))))), 31957#(and (= 0 main_~first~0.offset) (or (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)))), 31958#(and (= main_~x~1.base main_~first~0.base) (= main_~x~1.offset 0) (or (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)) 0)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)) 0))) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)))), 31959#(and (= main_~x~1.offset 0) (or (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0))))), 31960#(and (= main_~x~1.offset 0) (or (= main_~x~1.base |main_#t~mem7.base|) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) 0)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0))))), 31961#(and (= main_~x~1.offset 0) (or (not (= 0 main_~y~1.offset)) (= main_~y~1.base main_~x~1.base) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))))), 31962#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))), 31963#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset |main_#t~mem8.offset|) (= main_~x~1.base |main_#t~mem8.base|))), 31964#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base))), 31965#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base))] [2018-04-11 13:16:57,752 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:16:57,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 13:16:57,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 13:16:57,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2018-04-11 13:16:57,753 INFO L87 Difference]: Start difference. First operand 397 states and 447 transitions. Second operand 25 states. [2018-04-11 13:17:00,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:00,240 INFO L93 Difference]: Finished difference Result 657 states and 738 transitions. [2018-04-11 13:17:00,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-11 13:17:00,241 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 76 [2018-04-11 13:17:00,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:00,242 INFO L225 Difference]: With dead ends: 657 [2018-04-11 13:17:00,242 INFO L226 Difference]: Without dead ends: 657 [2018-04-11 13:17:00,242 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=687, Invalid=4005, Unknown=0, NotChecked=0, Total=4692 [2018-04-11 13:17:00,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-04-11 13:17:00,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 431. [2018-04-11 13:17:00,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-04-11 13:17:00,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 484 transitions. [2018-04-11 13:17:00,245 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 484 transitions. Word has length 76 [2018-04-11 13:17:00,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:00,245 INFO L459 AbstractCegarLoop]: Abstraction has 431 states and 484 transitions. [2018-04-11 13:17:00,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 13:17:00,245 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 484 transitions. [2018-04-11 13:17:00,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-11 13:17:00,246 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:00,246 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:00,246 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:00,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1737685681, now seen corresponding path program 3 times [2018-04-11 13:17:00,247 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:00,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:00,769 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 14 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:00,769 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:00,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 13:17:00,770 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:00,770 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 13:17:00,770 INFO L182 omatonBuilderFactory]: Interpolants [33152#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 main_~x~0.offset)), 33153#(and (= 0 (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~first~0.offset 12))) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0)), 33154#(and (= 0 (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~first~0.offset 12))) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (not (= main_~first~0.base |main_#t~malloc1.base|)) (= main_~last~0.offset 0)), 33155#(and (= 0 (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~first~0.offset 12))) (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0) (= 0 main_~x~0.offset)), 33156#(and (= main_~first~0.offset 0) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (or (= (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12)) main_~x~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~first~0.offset 12)))) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~first~0.offset 12)))), 33157#(and (not (= main_~first~0.base main_~x~0.base)) (= main_~first~0.offset 0) (or (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) main_~x~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= (select |#valid| main_~first~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 33158#(and (= main_~first~0.offset 0) (or (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 33159#(and (= main_~first~0.offset 0) (or (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 33160#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (or (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 33161#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (or (and (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= 1 (select |#valid| main_~last~0.base)) (not (= main_~first~0.base main_~last~0.base))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 33162#(and (= main_~first~0.offset 0) (or (and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 33163#(and (= main_~first~0.offset 0) (or (and (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 33164#(and (= 0 |main_#t~mem6.offset|) (or (and (= 1 (select |#valid| |main_#t~mem6.base|)) (not (= main_~x~1.base |main_#t~mem6.base|))) (= 0 |main_#t~mem6.base|))), 33165#(and (= 0 main_~first~0.offset) (or (and (not (= main_~x~1.base main_~first~0.base)) (= 1 (select |#valid| main_~first~0.base))) (= main_~first~0.base 0))), 33166#(and (= 0 main_~first~0.offset) (or (= main_~first~0.base 0) (= 1 (select |#valid| main_~first~0.base)))), 33167#(= 1 (select |#valid| main_~first~0.base)), 33148#true, 33149#false, 33150#(= 0 |main_#t~malloc1.offset|), 33151#(= main_~x~0.offset 0)] [2018-04-11 13:17:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 14 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:00,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 13:17:00,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 13:17:00,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-04-11 13:17:00,770 INFO L87 Difference]: Start difference. First operand 431 states and 484 transitions. Second operand 20 states. [2018-04-11 13:17:02,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:02,102 INFO L93 Difference]: Finished difference Result 601 states and 667 transitions. [2018-04-11 13:17:02,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 13:17:02,103 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 77 [2018-04-11 13:17:02,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:02,104 INFO L225 Difference]: With dead ends: 601 [2018-04-11 13:17:02,105 INFO L226 Difference]: Without dead ends: 601 [2018-04-11 13:17:02,105 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=312, Invalid=1328, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 13:17:02,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-04-11 13:17:02,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 464. [2018-04-11 13:17:02,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2018-04-11 13:17:02,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 521 transitions. [2018-04-11 13:17:02,109 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 521 transitions. Word has length 77 [2018-04-11 13:17:02,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:02,109 INFO L459 AbstractCegarLoop]: Abstraction has 464 states and 521 transitions. [2018-04-11 13:17:02,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 13:17:02,109 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 521 transitions. [2018-04-11 13:17:02,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-11 13:17:02,109 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:02,110 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:02,110 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:02,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1737685682, now seen corresponding path program 2 times [2018-04-11 13:17:02,110 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:02,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:02,556 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 23 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:02,556 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:02,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 13:17:02,556 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:02,557 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 13:17:02,557 INFO L182 omatonBuilderFactory]: Interpolants [34280#true, 34281#false, 34282#(= 0 |main_#t~malloc1.offset|), 34283#(= 0 main_~x~0.offset), 34284#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 34285#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 34286#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= 0 main_~first~0.offset) (= 20 (select |#length| |main_#t~malloc1.base|)) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset main_~first~0.offset)), 34287#(and (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 34288#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 34289#(and (= main_~first~0.offset 0) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~first~0.offset 12))) (= 20 (select |#length| main_~x~0.base)) (= (select |#valid| main_~x~0.base) 1) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~first~0.offset 12)))), 34290#(and (not (= main_~first~0.base main_~x~0.base)) (= main_~first~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~first~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 20 (select |#length| main_~x~0.base)) (= (select |#valid| main_~x~0.base) 1)), 34291#(and (= main_~first~0.offset 0) (= 20 (select |#length| main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base)) (= (select |#valid| main_~last~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 34292#(and (= main_~first~0.offset 0) (= 20 (select |#length| main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 34293#(and (= main_~first~0.offset 0) (= 20 (select |#length| main_~last~0.base)) (not (= main_~x~0.base main_~first~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 34294#(and (= main_~first~0.offset 0) (= 20 (select |#length| main_~last~0.base)) (not (= main_~x~0.base main_~first~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 34295#(and (= main_~first~0.offset 0) (= 20 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 34296#(and (= 0 |main_#t~mem6.offset|) (= 20 (select |#length| |main_#t~mem6.base|))), 34297#(and (= 20 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset))] [2018-04-11 13:17:02,557 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 23 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:02,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 13:17:02,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 13:17:02,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:17:02,557 INFO L87 Difference]: Start difference. First operand 464 states and 521 transitions. Second operand 18 states. [2018-04-11 13:17:03,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:03,332 INFO L93 Difference]: Finished difference Result 569 states and 636 transitions. [2018-04-11 13:17:03,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 13:17:03,332 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-04-11 13:17:03,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:03,333 INFO L225 Difference]: With dead ends: 569 [2018-04-11 13:17:03,333 INFO L226 Difference]: Without dead ends: 569 [2018-04-11 13:17:03,333 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=286, Invalid=1120, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 13:17:03,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-04-11 13:17:03,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 500. [2018-04-11 13:17:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-04-11 13:17:03,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 563 transitions. [2018-04-11 13:17:03,336 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 563 transitions. Word has length 77 [2018-04-11 13:17:03,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:03,337 INFO L459 AbstractCegarLoop]: Abstraction has 500 states and 563 transitions. [2018-04-11 13:17:03,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 13:17:03,337 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 563 transitions. [2018-04-11 13:17:03,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-11 13:17:03,337 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:03,337 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:03,337 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:03,337 INFO L82 PathProgramCache]: Analyzing trace with hash -935493869, now seen corresponding path program 2 times [2018-04-11 13:17:03,338 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:03,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:03,612 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:03,612 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:03,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 13:17:03,612 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:03,612 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 13:17:03,612 INFO L182 omatonBuilderFactory]: Interpolants [35412#true, 35413#false, 35414#(= 0 |main_#t~malloc1.offset|), 35415#(= 0 main_~x~0.offset), 35416#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 35417#(and (not (= main_~x~0.base |main_#t~malloc3.base|)) (= 0 main_~x~0.offset)), 35418#(and (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 35419#(and (= (select |#valid| main_~y~0.base) 1) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 35420#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 0 main_~x~0.offset)), 35421#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~malloc3.base|)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 |main_#t~malloc3.offset|) (= 0 main_~x~0.offset)), 35422#(and (= main_~y~0.offset 0) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base))), 35423#(and (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~y~0.offset 0) (not (= main_~x~0.base |main_#t~mem4.base|)) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base))), 35424#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~y~0.base)) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset))), 35425#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (not (= main_~y~0.base |main_#t~mem5.base|)) (= main_~y~0.offset 0) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset))), 35426#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= main_~y~0.offset 0) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset))), 35427#(and (or (= main_~x~0.base main_~y~0.base) (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= main_~y~0.offset 0))) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset))), 35428#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)))), 35429#(or (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0))) (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset))), 35430#(or (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0))) (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset 0))), 35431#(or (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0))) (and (= main_~x~1.base |main_#t~mem7.base|) (= main_~x~1.offset 0))), 35432#(or (not (= 0 main_~y~1.offset)) (and (= main_~y~1.base main_~x~1.base) (= main_~x~1.offset 0)) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))), 35433#(or (not (= 0 main_~z~0.offset)) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))), 35434#(or (not (= 0 main_~z~0.offset)) (not (= main_~x~1.base |main_#t~mem8.base|))), 35435#(or (not (= 0 main_~z~0.offset)) (not (= main_~x~1.base main_~y~1.base))), 35436#(not (= main_~x~1.base main_~y~1.base))] [2018-04-11 13:17:03,613 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:03,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 13:17:03,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 13:17:03,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-04-11 13:17:03,613 INFO L87 Difference]: Start difference. First operand 500 states and 563 transitions. Second operand 25 states. [2018-04-11 13:17:05,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:05,750 INFO L93 Difference]: Finished difference Result 750 states and 845 transitions. [2018-04-11 13:17:05,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-11 13:17:05,750 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 78 [2018-04-11 13:17:05,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:05,751 INFO L225 Difference]: With dead ends: 750 [2018-04-11 13:17:05,751 INFO L226 Difference]: Without dead ends: 750 [2018-04-11 13:17:05,752 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1445 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=984, Invalid=5022, Unknown=0, NotChecked=0, Total=6006 [2018-04-11 13:17:05,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-04-11 13:17:05,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 500. [2018-04-11 13:17:05,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-04-11 13:17:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 562 transitions. [2018-04-11 13:17:05,755 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 562 transitions. Word has length 78 [2018-04-11 13:17:05,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:05,755 INFO L459 AbstractCegarLoop]: Abstraction has 500 states and 562 transitions. [2018-04-11 13:17:05,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 13:17:05,755 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 562 transitions. [2018-04-11 13:17:05,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-11 13:17:05,756 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:05,756 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-11 13:17:05,756 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:05,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1966319363, now seen corresponding path program 3 times [2018-04-11 13:17:05,756 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:05,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 11 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:06,002 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:06,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 13:17:06,003 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:06,003 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 13:17:06,003 INFO L182 omatonBuilderFactory]: Interpolants [36800#(= 0 |main_#t~malloc1.offset|), 36801#(= main_~x~0.offset 0), 36802#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 36803#(and (= main_~first~0.offset main_~last~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 36804#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.offset main_~last~0.offset) (= main_~last~0.base main_~first~0.base) (not (= 0 |main_#t~malloc1.base|))), 36805#(and (= main_~first~0.offset main_~last~0.offset) (not (= 0 main_~x~0.base)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base)), 36806#(and (not (= main_~last~0.base main_~x~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~first~0.offset 12)))) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 36807#(and (not (= main_~first~0.base main_~x~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= (select |#valid| main_~first~0.base) 1)), 36808#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base))), 36809#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base))), 36810#(and (not (= main_~x~0.base main_~first~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~last~0.base main_~first~0.base))), 36811#(and (not (= main_~x~0.base main_~first~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))), 36812#(not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))), 36813#(not (= 0 |main_#t~mem6.base|)), 36814#(not (= 0 main_~first~0.base)), 36798#true, 36799#false] [2018-04-11 13:17:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 11 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:06,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 13:17:06,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 13:17:06,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:17:06,004 INFO L87 Difference]: Start difference. First operand 500 states and 562 transitions. Second operand 17 states. [2018-04-11 13:17:06,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:06,495 INFO L93 Difference]: Finished difference Result 554 states and 616 transitions. [2018-04-11 13:17:06,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 13:17:06,495 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 78 [2018-04-11 13:17:06,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:06,496 INFO L225 Difference]: With dead ends: 554 [2018-04-11 13:17:06,497 INFO L226 Difference]: Without dead ends: 554 [2018-04-11 13:17:06,497 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2018-04-11 13:17:06,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-04-11 13:17:06,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 475. [2018-04-11 13:17:06,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2018-04-11 13:17:06,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 530 transitions. [2018-04-11 13:17:06,499 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 530 transitions. Word has length 78 [2018-04-11 13:17:06,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:06,500 INFO L459 AbstractCegarLoop]: Abstraction has 475 states and 530 transitions. [2018-04-11 13:17:06,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 13:17:06,500 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 530 transitions. [2018-04-11 13:17:06,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-11 13:17:06,500 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:06,500 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:06,500 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:06,500 INFO L82 PathProgramCache]: Analyzing trace with hash 87224978, now seen corresponding path program 3 times [2018-04-11 13:17:06,501 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:06,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:07,231 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:07,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:07,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-11 13:17:07,232 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:07,232 INFO L182 omatonBuilderFactory]: Interpolants [37888#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0) main_~x~0.offset) (= main_~y~0.offset 0) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0))), 37889#(and (or (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0) main_~x~0.offset) (= main_~y~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0))) (= main_~x~0.base main_~y~0.base)) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset))), 37890#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) 0) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) 0)))), 37891#(or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) 0) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) 0))) (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset))), 37892#(or (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset 0)) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) 0)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) 0)))), 37893#(or (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0)) 0)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0)) 0))) (and (= main_~x~1.base |main_#t~mem7.base|) (= main_~x~1.offset 0))), 37894#(or (not (= 0 main_~y~1.offset)) (and (= main_~y~1.base main_~x~1.base) (= main_~x~1.offset 0)) (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) 0)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) 0)))), 37895#(or (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) 0)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) 0))) (not (= 0 main_~z~0.offset))), 37896#(or (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| |main_#t~mem8.base|) 0)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem8.base|) 0))) (not (= 0 main_~z~0.offset))), 37897#(or (not (= 0 main_~y~1.offset)) (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))), 37898#(or (not (= 0 main_~y~1.offset)) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))), 37899#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))), 37900#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset |main_#t~mem8.offset|) (= main_~x~1.base |main_#t~mem8.base|))), 37901#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base))), 37902#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base)), 37871#true, 37872#false, 37873#(= 0 |main_#t~malloc1.offset|), 37874#(= 0 main_~x~0.offset), 37875#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 37876#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 37877#(and (not (= main_~x~0.base |main_#t~malloc3.base|)) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~x~0.offset)), 37878#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~y~0.offset) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 37879#(and (= main_~x~0.base |main_#t~mem4.base|) (= |main_#t~mem4.offset| main_~x~0.offset) (= 0 main_~y~0.offset) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 37880#(and (= (select |#valid| main_~y~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset) main_~x~0.offset) (= 0 main_~y~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 37881#(and (= 1 (select |#valid| main_~y~0.base)) (not (= main_~y~0.base |main_#t~mem5.base|)) (= main_~y~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 37882#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 37883#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~malloc3.base|)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 |main_#t~malloc3.offset|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 37884#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (= main_~y~0.offset 0) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 37885#(and (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 |main_#t~mem4.offset|) (= main_~y~0.offset 0) (not (= main_~x~0.base |main_#t~mem4.base|)) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (= (select (select |#memory_$Pointer$.offset| |main_#t~mem4.base|) 0) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem4.base|) 0))), 37886#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0) main_~x~0.offset) (= main_~y~0.offset 0) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0))), 37887#(and (not (= main_~x~0.base |main_#t~mem5.base|)) (= main_~y~0.offset 0) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (= (select (select |#memory_$Pointer$.offset| |main_#t~mem5.base|) 0) main_~x~0.offset) (not (= (+ |main_#t~mem5.offset| 4) 0)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem5.base|) 0)))] [2018-04-11 13:17:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:07,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 13:17:07,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 13:17:07,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2018-04-11 13:17:07,232 INFO L87 Difference]: Start difference. First operand 475 states and 530 transitions. Second operand 32 states. [2018-04-11 13:17:09,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:09,697 INFO L93 Difference]: Finished difference Result 770 states and 862 transitions. [2018-04-11 13:17:09,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-11 13:17:09,697 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 80 [2018-04-11 13:17:09,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:09,698 INFO L225 Difference]: With dead ends: 770 [2018-04-11 13:17:09,699 INFO L226 Difference]: Without dead ends: 770 [2018-04-11 13:17:09,699 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=701, Invalid=5619, Unknown=0, NotChecked=0, Total=6320 [2018-04-11 13:17:09,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2018-04-11 13:17:09,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 517. [2018-04-11 13:17:09,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2018-04-11 13:17:09,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 574 transitions. [2018-04-11 13:17:09,703 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 574 transitions. Word has length 80 [2018-04-11 13:17:09,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:09,704 INFO L459 AbstractCegarLoop]: Abstraction has 517 states and 574 transitions. [2018-04-11 13:17:09,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 13:17:09,704 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 574 transitions. [2018-04-11 13:17:09,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-11 13:17:09,704 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:09,705 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:09,705 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:09,705 INFO L82 PathProgramCache]: Analyzing trace with hash 239872403, now seen corresponding path program 1 times [2018-04-11 13:17:09,705 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:09,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:10,140 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:10,140 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:10,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 13:17:10,141 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:10,141 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 13:17:10,141 INFO L182 omatonBuilderFactory]: Interpolants [39296#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 39297#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset main_~first~0.offset)), 39298#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 39299#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 12 (select |#length| |main_#t~malloc3.base|)) (= 0 main_~x~0.offset)), 39300#(and (or (not (= main_~first~0.base main_~y~0.base)) (= 12 (select |#length| main_~first~0.base))) (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 39301#(and (or (not (= main_~first~0.base main_~y~0.base)) (= 12 (select |#length| main_~first~0.base))) (not (= main_~x~0.base main_~last~0.base)) (= (select |#valid| main_~y~0.base) 1) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 39302#(and (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~first~0.base main_~y~0.base)) (= 1 (select |#valid| main_~y~0.base)))) (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 39303#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))) (= 0 main_~x~0.offset)), 39304#(and (= main_~first~0.offset 0) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12))) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~first~0.offset 12)))), 39305#(and (= main_~first~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 39306#(and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0))) (= main_~first~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 39307#(and (= main_~first~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0))) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 39308#(and (= 0 |main_#t~mem6.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) 0))) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) 0)))), 39309#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) 0))) (= 0 main_~first~0.offset) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) 0)))), 39310#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) 0))) (= 0 main_~first~0.offset)), 39311#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))), 39312#(= 1 (select |#valid| |main_#t~mem7.base|)), 39313#(= 1 (select |#valid| main_~y~1.base)), 39291#true, 39292#false, 39293#(= 0 |main_#t~malloc1.offset|), 39294#(= main_~x~0.offset 0), 39295#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset))] [2018-04-11 13:17:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:10,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 13:17:10,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 13:17:10,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:17:10,142 INFO L87 Difference]: Start difference. First operand 517 states and 574 transitions. Second operand 23 states. [2018-04-11 13:17:10,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:10,998 INFO L93 Difference]: Finished difference Result 599 states and 665 transitions. [2018-04-11 13:17:10,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 13:17:10,998 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 80 [2018-04-11 13:17:10,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:10,999 INFO L225 Difference]: With dead ends: 599 [2018-04-11 13:17:10,999 INFO L226 Difference]: Without dead ends: 599 [2018-04-11 13:17:10,999 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=372, Invalid=1980, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 13:17:10,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-04-11 13:17:11,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 537. [2018-04-11 13:17:11,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-04-11 13:17:11,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 596 transitions. [2018-04-11 13:17:11,002 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 596 transitions. Word has length 80 [2018-04-11 13:17:11,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:11,003 INFO L459 AbstractCegarLoop]: Abstraction has 537 states and 596 transitions. [2018-04-11 13:17:11,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 13:17:11,003 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 596 transitions. [2018-04-11 13:17:11,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-11 13:17:11,003 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:11,003 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:11,003 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:11,003 INFO L82 PathProgramCache]: Analyzing trace with hash 239872404, now seen corresponding path program 1 times [2018-04-11 13:17:11,004 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:11,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:11,363 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:11,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 13:17:11,364 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:11,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:11,364 INFO L182 omatonBuilderFactory]: Interpolants [40512#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 40513#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= 0 |main_#t~malloc3.offset|) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 12 (select |#length| |main_#t~malloc3.base|)) (= 0 main_~x~0.offset)), 40514#(and (= 12 (select |#length| main_~y~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 main_~y~0.offset) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 40515#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 40516#(and (= main_~first~0.offset 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12))) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~last~0.offset main_~first~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~first~0.offset 12)))), 40517#(and (= main_~first~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 40518#(and (= main_~first~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 40519#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem6.base|) 0)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) 0))) (= 0 |main_#t~mem6.offset|)), 40520#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) 0))) (= 0 main_~first~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) 0))), 40521#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)))), 40522#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 40523#(and (= 12 (select |#length| main_~y~1.base)) (= main_~y~1.offset 0)), 40505#true, 40506#false, 40507#(= 0 |main_#t~malloc1.offset|), 40508#(= main_~x~0.offset 0), 40509#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 40510#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 40511#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset main_~first~0.offset))] [2018-04-11 13:17:11,364 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:11,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 13:17:11,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 13:17:11,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-04-11 13:17:11,364 INFO L87 Difference]: Start difference. First operand 537 states and 596 transitions. Second operand 19 states. [2018-04-11 13:17:12,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:12,052 INFO L93 Difference]: Finished difference Result 646 states and 715 transitions. [2018-04-11 13:17:12,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 13:17:12,052 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 80 [2018-04-11 13:17:12,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:12,054 INFO L225 Difference]: With dead ends: 646 [2018-04-11 13:17:12,054 INFO L226 Difference]: Without dead ends: 646 [2018-04-11 13:17:12,054 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=1218, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 13:17:12,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-04-11 13:17:12,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 556. [2018-04-11 13:17:12,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-04-11 13:17:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 621 transitions. [2018-04-11 13:17:12,060 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 621 transitions. Word has length 80 [2018-04-11 13:17:12,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:12,061 INFO L459 AbstractCegarLoop]: Abstraction has 556 states and 621 transitions. [2018-04-11 13:17:12,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 13:17:12,061 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 621 transitions. [2018-04-11 13:17:12,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-11 13:17:12,061 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:12,062 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:12,062 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:12,062 INFO L82 PathProgramCache]: Analyzing trace with hash 619900589, now seen corresponding path program 1 times [2018-04-11 13:17:12,062 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:12,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:12,307 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:12,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 13:17:12,307 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:12,307 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 13:17:12,307 INFO L182 omatonBuilderFactory]: Interpolants [41769#true, 41770#false, 41771#(= (select |#valid| main_~x~0.base) 1), 41772#(and (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 41773#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset main_~first~0.offset) (= 1 (select |#valid| |main_#t~malloc1.base|))), 41774#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset)), 41775#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base main_~last~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~first~0.base)) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset)), 41776#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~first~0.base)) (= main_~x~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12)))) (= main_~last~0.base main_~first~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12)) main_~first~0.base)) (= main_~last~0.offset main_~first~0.offset)), 41777#(and (not (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) main_~first~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~first~0.base)) (= main_~x~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))), 41778#(and (not (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) main_~first~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0) main_~first~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))), 41779#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0) main_~x~1.base)) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))), 41780#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) 0) main_~x~1.base)) (= 1 (select |#valid| |main_#t~mem6.base|)) (not (= main_~x~1.base |main_#t~mem6.base|))), 41781#(and (not (= (select (select |#memory_$Pointer$.base| main_~first~0.base) 0) main_~x~1.base)) (not (= main_~x~1.base main_~first~0.base)) (= 1 (select |#valid| main_~first~0.base))), 41782#(and (or (not (= 0 main_~y~1.offset)) (not (= main_~y~1.base main_~first~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset) main_~x~1.base))) (not (= main_~x~1.base main_~first~0.base)) (= 1 (select |#valid| main_~first~0.base))), 41783#(or (not (= (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset) main_~x~1.base)) (not (= 0 main_~z~0.offset)) (and (not (= main_~x~1.base main_~first~0.base)) (= 1 (select |#valid| main_~first~0.base)) (not (= main_~z~0.base main_~first~0.base)))), 41784#(or (not (= 0 main_~z~0.offset)) (not (= |main_#t~mem8.base| main_~x~1.base)) (and (not (= main_~x~1.base main_~first~0.base)) (= 1 (select |#valid| main_~first~0.base)) (not (= main_~z~0.base main_~first~0.base)))), 41785#(or (not (= main_~y~1.base main_~x~1.base)) (not (= 0 main_~z~0.offset)) (and (not (= main_~x~1.base main_~first~0.base)) (= 1 (select |#valid| main_~first~0.base)) (not (= main_~z~0.base main_~first~0.base)))), 41786#(or (not (= main_~y~1.base main_~x~1.base)) (and (not (= main_~x~1.base main_~first~0.base)) (= 1 (select |#valid| main_~first~0.base)) (not (= main_~z~0.base main_~first~0.base)))), 41787#(or (and (not (= main_~x~1.base main_~first~0.base)) (= 1 (select |#valid| main_~first~0.base))) (not (= main_~y~1.base main_~x~1.base))), 41788#(and (not (= main_~x~1.base main_~first~0.base)) (= 1 (select |#valid| main_~first~0.base))), 41789#(= 1 (select |#valid| main_~first~0.base))] [2018-04-11 13:17:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:12,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 13:17:12,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 13:17:12,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-04-11 13:17:12,308 INFO L87 Difference]: Start difference. First operand 556 states and 621 transitions. Second operand 21 states. [2018-04-11 13:17:12,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:12,996 INFO L93 Difference]: Finished difference Result 618 states and 695 transitions. [2018-04-11 13:17:12,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 13:17:12,996 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 81 [2018-04-11 13:17:12,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:12,997 INFO L225 Difference]: With dead ends: 618 [2018-04-11 13:17:12,998 INFO L226 Difference]: Without dead ends: 618 [2018-04-11 13:17:12,998 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=244, Invalid=1238, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 13:17:12,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-04-11 13:17:13,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 560. [2018-04-11 13:17:13,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-04-11 13:17:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 626 transitions. [2018-04-11 13:17:13,001 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 626 transitions. Word has length 81 [2018-04-11 13:17:13,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:13,001 INFO L459 AbstractCegarLoop]: Abstraction has 560 states and 626 transitions. [2018-04-11 13:17:13,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 13:17:13,001 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 626 transitions. [2018-04-11 13:17:13,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-11 13:17:13,002 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:13,002 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:13,002 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:13,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1410851501, now seen corresponding path program 1 times [2018-04-11 13:17:13,002 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:13,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:13,376 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:13,376 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:13,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 13:17:13,377 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:13,377 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 13:17:13,377 INFO L182 omatonBuilderFactory]: Interpolants [43009#true, 43010#false, 43011#(= 0 |main_#t~malloc1.offset|), 43012#(= main_~x~0.offset 0), 43013#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 43014#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 43015#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset main_~first~0.offset)), 43016#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 43017#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= 0 |main_#t~malloc3.offset|) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 43018#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 main_~y~0.offset) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 43019#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 43020#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12))) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~last~0.offset main_~first~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~first~0.offset 12)))), 43021#(and (= main_~first~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 43022#(and (= main_~first~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 43023#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem6.base|) 0)) (= 0 |main_#t~mem6.offset|)), 43024#(and (= 0 main_~first~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) 0))), 43025#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset)), 43026#(= 0 |main_#t~mem7.offset|), 43027#(= 0 main_~y~1.offset), 43028#(= main_~z~0.offset 0)] [2018-04-11 13:17:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:13,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 13:17:13,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 13:17:13,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-04-11 13:17:13,377 INFO L87 Difference]: Start difference. First operand 560 states and 626 transitions. Second operand 20 states. [2018-04-11 13:17:14,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:14,186 INFO L93 Difference]: Finished difference Result 705 states and 780 transitions. [2018-04-11 13:17:14,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 13:17:14,186 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 82 [2018-04-11 13:17:14,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:14,188 INFO L225 Difference]: With dead ends: 705 [2018-04-11 13:17:14,188 INFO L226 Difference]: Without dead ends: 705 [2018-04-11 13:17:14,188 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=397, Invalid=2153, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 13:17:14,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2018-04-11 13:17:14,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 562. [2018-04-11 13:17:14,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2018-04-11 13:17:14,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 628 transitions. [2018-04-11 13:17:14,192 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 628 transitions. Word has length 82 [2018-04-11 13:17:14,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:14,192 INFO L459 AbstractCegarLoop]: Abstraction has 562 states and 628 transitions. [2018-04-11 13:17:14,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 13:17:14,192 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 628 transitions. [2018-04-11 13:17:14,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-11 13:17:14,193 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:14,193 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-11 13:17:14,193 INFO L408 AbstractCegarLoop]: === Iteration 67 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:14,193 INFO L82 PathProgramCache]: Analyzing trace with hash -729413042, now seen corresponding path program 2 times [2018-04-11 13:17:14,194 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:14,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 23 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:14,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:14,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 13:17:14,803 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:14,803 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 13:17:14,803 INFO L182 omatonBuilderFactory]: Interpolants [44361#true, 44362#false, 44363#(and (= 20 (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 44364#(and (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 44365#(and (= 1 (select |#valid| main_~x~0.base)) (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 44366#(and (= 20 (select |#length| main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 44367#(and (= 20 (select |#length| main_~last~0.base)) (= 0 main_~first~0.offset) (= 20 (select |#length| |main_#t~malloc1.base|)) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|)), 44368#(and (= 20 (select |#length| main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 44369#(and (= 20 (select |#length| main_~last~0.base)) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 44370#(and (= main_~first~0.offset 0) (= (select |#length| main_~last~0.base) 20) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= 20 (select |#length| main_~x~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 44371#(and (= main_~first~0.offset 0) (<= 20 (select |#length| main_~first~0.base)) (= (select |#valid| main_~first~0.base) 1) (= 20 (select |#length| main_~x~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 44372#(and (= main_~first~0.offset 0) (= (select |#length| main_~last~0.base) 20) (<= 20 (select |#length| main_~first~0.base)) (= (select |#valid| main_~first~0.base) 1) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0)), 44373#(and (= main_~first~0.offset 0) (or (and (= main_~first~0.base |main_#t~malloc1.base|) (= (select |#length| |main_#t~malloc1.base|) (select |#length| main_~last~0.base))) (= (select |#valid| main_~first~0.base) 1)) (<= 20 (select |#length| main_~first~0.base)) (= main_~last~0.offset 0)), 44374#(and (= main_~first~0.offset 0) (<= 20 (select |#length| main_~first~0.base)) (or (and (= (select |#length| main_~x~0.base) (select |#length| main_~last~0.base)) (= main_~first~0.base main_~x~0.base)) (= (select |#valid| main_~first~0.base) 1)) (= main_~last~0.offset 0)), 44375#(and (= main_~first~0.offset 0) (= 1 (select |#valid| main_~x~0.base)) (<= 20 (select |#length| main_~first~0.base)) (= (select |#valid| main_~first~0.base) 1) (= main_~last~0.offset 0)), 44376#(and (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (<= 20 (select |#length| main_~first~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= (select |#valid| main_~first~0.base) 1) (= main_~last~0.offset 0)), 44377#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~last~0.base)) (<= 20 (select |#length| main_~first~0.base))) (= main_~last~0.offset 0)), 44378#(and (= main_~first~0.offset 0) (<= 20 (select |#length| main_~first~0.base)) (not (= (select |#length| main_~last~0.base) 12))), 44379#(and (= main_~first~0.offset 0) (<= 20 (select |#length| main_~first~0.base)))] [2018-04-11 13:17:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 23 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:14,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 13:17:14,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 13:17:14,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-04-11 13:17:14,803 INFO L87 Difference]: Start difference. First operand 562 states and 628 transitions. Second operand 19 states. [2018-04-11 13:17:15,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:15,293 INFO L93 Difference]: Finished difference Result 693 states and 784 transitions. [2018-04-11 13:17:15,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 13:17:15,293 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 82 [2018-04-11 13:17:15,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:15,294 INFO L225 Difference]: With dead ends: 693 [2018-04-11 13:17:15,294 INFO L226 Difference]: Without dead ends: 693 [2018-04-11 13:17:15,294 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 10 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=270, Invalid=660, Unknown=0, NotChecked=0, Total=930 [2018-04-11 13:17:15,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2018-04-11 13:17:15,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 562. [2018-04-11 13:17:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2018-04-11 13:17:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 627 transitions. [2018-04-11 13:17:15,297 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 627 transitions. Word has length 82 [2018-04-11 13:17:15,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:15,297 INFO L459 AbstractCegarLoop]: Abstraction has 562 states and 627 transitions. [2018-04-11 13:17:15,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 13:17:15,297 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 627 transitions. [2018-04-11 13:17:15,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-11 13:17:15,298 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:15,298 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-11 13:17:15,298 INFO L408 AbstractCegarLoop]: === Iteration 68 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:15,298 INFO L82 PathProgramCache]: Analyzing trace with hash -339351177, now seen corresponding path program 2 times [2018-04-11 13:17:15,298 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:15,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:15,884 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 23 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:15,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:15,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 13:17:15,885 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:15,885 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 13:17:15,885 INFO L182 omatonBuilderFactory]: Interpolants [45664#false, 45665#(= 0 |main_#t~malloc1.offset|), 45666#(= 0 main_~x~0.offset), 45667#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 45668#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 45669#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset main_~first~0.offset)), 45670#(and (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 45671#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 45672#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 45673#(and (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12)) main_~x~0.base) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 45674#(and (not (= main_~first~0.base main_~x~0.base)) (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) main_~x~0.base) (= (select |#valid| main_~first~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 45675#(and (= main_~first~0.offset 0) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~first~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) 0) 0) (not (= main_~last~0.base main_~first~0.base)) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~last~0.base) 0)) (not (= 0 (+ main_~last~0.offset 12))) (= (select |#valid| main_~last~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 45676#(and (= main_~first~0.offset 0) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) 0) 0) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base)) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~last~0.base) 0)) (not (= 0 (+ main_~last~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 45677#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) 0) 0) (not (= main_~last~0.base main_~first~0.base)) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~last~0.base) 0)) (not (= 0 (+ main_~last~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 45678#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) 0) 0) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~last~0.base) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 45679#(and (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 45680#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) 0)) (= (select (select |#memory_$Pointer$.offset| |main_#t~mem6.base|) 0) 0) (= 0 |main_#t~mem6.offset|)), 45681#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) 0) 0) (= 0 main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) 0))), 45682#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~x~1.offset)) (= main_~x~1.base main_~first~0.base)), 45683#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset))), 45684#(and (= main_~x~1.offset |main_#t~mem7.offset|) (= main_~x~1.base |main_#t~mem7.base|)), 45685#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base)), 45663#true] [2018-04-11 13:17:15,885 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 23 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:15,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 13:17:15,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 13:17:15,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:17:15,885 INFO L87 Difference]: Start difference. First operand 562 states and 627 transitions. Second operand 23 states. [2018-04-11 13:17:16,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:16,848 INFO L93 Difference]: Finished difference Result 689 states and 770 transitions. [2018-04-11 13:17:16,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 13:17:16,849 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 83 [2018-04-11 13:17:16,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:16,850 INFO L225 Difference]: With dead ends: 689 [2018-04-11 13:17:16,850 INFO L226 Difference]: Without dead ends: 689 [2018-04-11 13:17:16,850 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=337, Invalid=2015, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 13:17:16,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2018-04-11 13:17:16,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 603. [2018-04-11 13:17:16,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-04-11 13:17:16,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 675 transitions. [2018-04-11 13:17:16,853 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 675 transitions. Word has length 83 [2018-04-11 13:17:16,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:16,853 INFO L459 AbstractCegarLoop]: Abstraction has 603 states and 675 transitions. [2018-04-11 13:17:16,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 13:17:16,853 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 675 transitions. [2018-04-11 13:17:16,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-11 13:17:16,854 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:16,854 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:16,854 INFO L408 AbstractCegarLoop]: === Iteration 69 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:16,854 INFO L82 PathProgramCache]: Analyzing trace with hash 179904679, now seen corresponding path program 3 times [2018-04-11 13:17:16,854 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:16,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 11 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 13:17:17,474 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:17,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 13:17:17,474 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:17,475 INFO L182 omatonBuilderFactory]: Interpolants [47040#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (not (= main_~x~0.base |main_#t~malloc3.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 47041#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base main_~y~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 47042#(and (= 0 |main_#t~mem4.offset|) (= main_~x~0.base |main_#t~mem4.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 47043#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 47044#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (not (= main_~y~0.base |main_#t~mem5.base|)) (not (= (+ main_~x~0.offset 8) |main_#t~mem5.offset|)) (= main_~x~0.base |main_#t~mem5.base|) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 main_~x~0.offset)), 47045#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 47046#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 main_~x~0.offset)), 47047#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12)))) (= main_~x~0.base main_~y~0.base))), 47048#(and (not (= main_~x~0.base |main_#t~mem4.base|)) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12)))) (= main_~x~0.base main_~y~0.base))), 47049#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12)))) (= main_~x~0.base main_~y~0.base))), 47050#(and (not (= main_~x~0.base |main_#t~mem5.base|)) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12)))) (= main_~x~0.base main_~y~0.base))), 47051#(and (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12)))) (= main_~x~0.base main_~y~0.base))), 47052#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12)))) (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset))), 47053#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset))), 47054#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset 0))), 47055#(or (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset 0)) (and (= 0 |main_#t~mem6.base|) (= 0 |main_#t~mem6.offset|))), 47056#(or (and (= main_~first~0.base 0) (= 0 main_~first~0.offset)) (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset 0))), 47057#(or (and (= main_~first~0.base 0) (= 0 main_~first~0.offset)) (and (= main_~x~1.base |main_#t~mem7.base|) (= main_~x~1.offset 0))), 47058#(or (and (= main_~first~0.base 0) (= 0 main_~first~0.offset)) (and (= main_~y~1.base main_~x~1.base) (= main_~x~1.offset 0))), 47059#(or (and (= main_~first~0.base 0) (= 0 main_~first~0.offset)) (not (= 0 main_~z~0.offset))), 47060#(and (= main_~first~0.base 0) (= 0 main_~first~0.offset)), 47034#true, 47035#false, 47036#(= 0 |main_#t~malloc1.offset|), 47037#(= 0 main_~x~0.offset), 47038#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 1 (select |#valid| main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 main_~x~0.offset)), 47039#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset))] [2018-04-11 13:17:17,475 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 11 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 13:17:17,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 13:17:17,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 13:17:17,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2018-04-11 13:17:17,475 INFO L87 Difference]: Start difference. First operand 603 states and 675 transitions. Second operand 27 states. [2018-04-11 13:17:19,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:19,423 INFO L93 Difference]: Finished difference Result 768 states and 857 transitions. [2018-04-11 13:17:19,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-11 13:17:19,423 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 85 [2018-04-11 13:17:19,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:19,424 INFO L225 Difference]: With dead ends: 768 [2018-04-11 13:17:19,424 INFO L226 Difference]: Without dead ends: 768 [2018-04-11 13:17:19,425 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1939 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1167, Invalid=5805, Unknown=0, NotChecked=0, Total=6972 [2018-04-11 13:17:19,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2018-04-11 13:17:19,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 603. [2018-04-11 13:17:19,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-04-11 13:17:19,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 675 transitions. [2018-04-11 13:17:19,428 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 675 transitions. Word has length 85 [2018-04-11 13:17:19,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:19,428 INFO L459 AbstractCegarLoop]: Abstraction has 603 states and 675 transitions. [2018-04-11 13:17:19,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 13:17:19,428 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 675 transitions. [2018-04-11 13:17:19,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-11 13:17:19,429 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:19,429 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:19,429 INFO L408 AbstractCegarLoop]: === Iteration 70 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:19,429 INFO L82 PathProgramCache]: Analyzing trace with hash -107906697, now seen corresponding path program 3 times [2018-04-11 13:17:19,429 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:19,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:20,023 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:20,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 13:17:20,023 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:20,024 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 13:17:20,024 INFO L182 omatonBuilderFactory]: Interpolants [48551#true, 48552#false, 48553#(= 0 |main_#t~malloc1.offset|), 48554#(= 0 main_~x~0.offset), 48555#(and (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 48556#(and (= (select |#valid| main_~y~0.base) 1) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 48557#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 48558#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 1) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0)), 48559#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base |main_#t~malloc1.base|)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0)), 48560#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0)), 48561#(and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0)), 48562#(and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= |main_#t~malloc3.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0) (= 12 (select |#length| |main_#t~malloc3.base|))), 48563#(and (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.offset 0) (or (and (= main_~first~0.base main_~last~0.base) (= 12 (select |#length| main_~first~0.base))) (and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= main_~y~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (not (= main_~y~0.base main_~last~0.base))))), 48564#(and (or (and (= main_~first~0.base main_~last~0.base) (= 12 (select |#length| main_~first~0.base))) (and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= main_~y~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (not (= main_~last~0.base |main_#t~mem4.base|)) (= main_~last~0.base main_~first~0.base) (not (= main_~y~0.base main_~last~0.base)))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.offset 0)), 48565#(and (not (= main_~last~0.base main_~x~0.base)) (or (and (= main_~first~0.base main_~last~0.base) (= 12 (select |#length| main_~first~0.base))) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (not (= main_~y~0.base main_~last~0.base)))) (= main_~last~0.offset 0)), 48566#(and (or (and (not (= |main_#t~mem5.base| main_~last~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (not (= main_~y~0.base main_~last~0.base))) (and (= main_~first~0.base main_~last~0.base) (= 12 (select |#length| main_~first~0.base)))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.offset 0)), 48567#(and (or (and (= main_~first~0.base main_~last~0.base) (= 12 (select |#length| main_~first~0.base))) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (not (= main_~y~0.base main_~last~0.base)))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.offset 0)), 48568#(and (or (and (= main_~first~0.base main_~last~0.base) (= 12 (select |#length| main_~first~0.base))) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.offset 0)), 48569#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0)), 48570#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 48571#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset))) (= main_~x~1.base main_~first~0.base)), 48572#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))), 48573#(= 1 (select |#valid| |main_#t~mem7.base|)), 48574#(= 1 (select |#valid| main_~y~1.base))] [2018-04-11 13:17:20,024 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:20,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 13:17:20,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 13:17:20,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:17:20,024 INFO L87 Difference]: Start difference. First operand 603 states and 675 transitions. Second operand 24 states. [2018-04-11 13:17:21,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:21,267 INFO L93 Difference]: Finished difference Result 704 states and 795 transitions. [2018-04-11 13:17:21,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 13:17:21,267 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2018-04-11 13:17:21,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:21,268 INFO L225 Difference]: With dead ends: 704 [2018-04-11 13:17:21,268 INFO L226 Difference]: Without dead ends: 704 [2018-04-11 13:17:21,269 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=460, Invalid=2192, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 13:17:21,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2018-04-11 13:17:21,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 635. [2018-04-11 13:17:21,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2018-04-11 13:17:21,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 711 transitions. [2018-04-11 13:17:21,273 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 711 transitions. Word has length 85 [2018-04-11 13:17:21,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:21,273 INFO L459 AbstractCegarLoop]: Abstraction has 635 states and 711 transitions. [2018-04-11 13:17:21,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 13:17:21,273 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 711 transitions. [2018-04-11 13:17:21,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-11 13:17:21,273 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:21,274 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:21,274 INFO L408 AbstractCegarLoop]: === Iteration 71 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:21,274 INFO L82 PathProgramCache]: Analyzing trace with hash -107906696, now seen corresponding path program 3 times [2018-04-11 13:17:21,274 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:21,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:22,095 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:22,095 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:22,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 13:17:22,095 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:22,095 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 13:17:22,095 INFO L182 omatonBuilderFactory]: Interpolants [49984#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset))), 49985#(and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset))), 49986#(and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)) (not (= main_~last~0.base |main_#t~malloc3.base|))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset))), 49987#(and (or (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)) (and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset)) (not (= main_~y~0.base main_~last~0.base)))) (not (= main_~last~0.base main_~x~0.base))), 49988#(and (not (= main_~last~0.base main_~x~0.base)) (or (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (not (= main_~last~0.base |main_#t~mem4.base|)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset)) (not (= main_~y~0.base main_~last~0.base))))), 49989#(and (or (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (not (= main_~y~0.base main_~last~0.base)))) (not (= main_~last~0.base main_~x~0.base))), 49990#(and (or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= |main_#t~mem5.base| main_~last~0.base)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset)) (not (= main_~y~0.base main_~last~0.base))) (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset))) (not (= main_~last~0.base main_~x~0.base))), 49991#(and (not (= main_~last~0.base main_~x~0.base)) (or (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset)) (not (= main_~y~0.base main_~last~0.base))))), 49992#(and (not (= main_~last~0.base main_~x~0.base)) (or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset))) (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)))), 49993#(and (not (= main_~last~0.base main_~x~0.base)) (or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset))) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base))))), 49994#(or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset))) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))), 49995#(or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~x~1.offset)) (= main_~x~1.base main_~first~0.base)) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))), 49996#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)))), 49997#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 49998#(and (= 12 (select |#length| main_~y~1.base)) (= main_~y~1.offset 0)), 49973#true, 49974#false, 49975#(= 0 |main_#t~malloc1.offset|), 49976#(= 0 main_~x~0.offset), 49977#(and (= 0 |main_#t~malloc3.offset|) (= 12 (select |#length| |main_#t~malloc3.base|)) (= 0 main_~x~0.offset)), 49978#(and (= 12 (select |#length| main_~y~0.base)) (= 0 main_~y~0.offset) (= 0 main_~x~0.offset)), 49979#(and (= 12 (select |#length| main_~y~0.base)) (= 0 main_~y~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 49980#(and (= 12 (select |#length| main_~y~0.base)) (= (select |#valid| main_~y~0.base) 1) (= 0 main_~y~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 49981#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 49982#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 1) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset)) (= (select |#valid| main_~last~0.base) 1)), 49983#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base |main_#t~malloc1.base|)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset)))] [2018-04-11 13:17:22,095 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:22,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 13:17:22,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 13:17:22,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2018-04-11 13:17:22,096 INFO L87 Difference]: Start difference. First operand 635 states and 711 transitions. Second operand 26 states. [2018-04-11 13:17:24,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:24,037 INFO L93 Difference]: Finished difference Result 779 states and 869 transitions. [2018-04-11 13:17:24,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-11 13:17:24,037 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 85 [2018-04-11 13:17:24,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:24,038 INFO L225 Difference]: With dead ends: 779 [2018-04-11 13:17:24,038 INFO L226 Difference]: Without dead ends: 779 [2018-04-11 13:17:24,039 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=652, Invalid=3638, Unknown=0, NotChecked=0, Total=4290 [2018-04-11 13:17:24,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-04-11 13:17:24,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 635. [2018-04-11 13:17:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2018-04-11 13:17:24,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 710 transitions. [2018-04-11 13:17:24,042 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 710 transitions. Word has length 85 [2018-04-11 13:17:24,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:24,043 INFO L459 AbstractCegarLoop]: Abstraction has 635 states and 710 transitions. [2018-04-11 13:17:24,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 13:17:24,043 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 710 transitions. [2018-04-11 13:17:24,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-11 13:17:24,043 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:24,043 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:24,043 INFO L408 AbstractCegarLoop]: === Iteration 72 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:24,043 INFO L82 PathProgramCache]: Analyzing trace with hash 929514871, now seen corresponding path program 4 times [2018-04-11 13:17:24,044 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:24,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:25,056 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 7 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:25,056 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:25,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-11 13:17:25,056 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:25,056 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 13:17:25,057 INFO L182 omatonBuilderFactory]: Interpolants [51520#(and (= 0 main_~first~0.offset) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~y~0.base main_~last~0.base))))), 51521#(and (= 0 main_~first~0.offset) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset)))), 51522#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset)))), 51523#(and (= main_~first~0.offset 0) (or (and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (= 12 (select |#length| main_~first~0.base)))), 51524#(and (= main_~first~0.offset 0) (or (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~x~1.offset)) (= main_~x~1.base main_~first~0.base)) (= 12 (select |#length| main_~first~0.base)))), 51525#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset))), 51526#(and (= main_~x~1.offset |main_#t~mem7.offset|) (= main_~x~1.base |main_#t~mem7.base|)), 51527#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base)), 51498#true, 51499#false, 51500#(= 0 |main_#t~malloc1.offset|), 51501#(= 0 main_~x~0.offset), 51502#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 51503#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 51504#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= (select |#valid| main_~last~0.base) 1)), 51505#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset)), 51506#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset)), 51507#(and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset)), 51508#(and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (or (not (= main_~last~0.base |main_#t~malloc3.base|)) (= 12 (select |#length| |main_#t~malloc3.base|))) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset)), 51509#(and (or (and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~y~0.base main_~last~0.base))) (and (= 12 (select |#length| main_~y~0.base)) (= main_~first~0.base main_~y~0.base))) (= 0 main_~first~0.offset)), 51510#(and (or (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base |main_#t~mem4.base|)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~y~0.base main_~last~0.base))) (and (= 12 (select |#length| main_~y~0.base)) (= main_~first~0.base main_~y~0.base))) (= 0 main_~first~0.offset)), 51511#(and (= 0 main_~first~0.offset) (or (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (not (= main_~y~0.base main_~last~0.base))) (and (= 12 (select |#length| main_~y~0.base)) (= main_~first~0.base main_~y~0.base)))), 51512#(and (or (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= |main_#t~mem5.base| main_~last~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~y~0.base main_~last~0.base))) (and (= 12 (select |#length| main_~y~0.base)) (= main_~first~0.base main_~y~0.base))) (= 0 main_~first~0.offset)), 51513#(and (or (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~y~0.base main_~last~0.base))) (and (= 12 (select |#length| main_~y~0.base)) (= main_~first~0.base main_~y~0.base))) (= 0 main_~first~0.offset)), 51514#(and (= 0 main_~first~0.offset) (or (and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset)) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))), 51515#(and (= 0 main_~first~0.offset) (or (and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= 12 (select |#length| |main_#t~malloc3.base|))) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (= main_~first~0.base |main_#t~malloc3.base|) (= 12 (select |#length| |main_#t~malloc3.base|))))), 51516#(and (= 0 main_~first~0.offset) (or (and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~y~0.base main_~last~0.base))) (= 12 (select |#length| main_~first~0.base)))), 51517#(and (or (= 12 (select |#length| main_~first~0.base)) (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base |main_#t~mem4.base|)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~y~0.base main_~last~0.base)))) (= 0 main_~first~0.offset)), 51518#(and (= 0 main_~first~0.offset) (or (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (not (= main_~y~0.base main_~last~0.base))) (= 12 (select |#length| main_~first~0.base)))), 51519#(and (or (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= |main_#t~mem5.base| main_~last~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~y~0.base main_~last~0.base))) (= 12 (select |#length| main_~first~0.base))) (= 0 main_~first~0.offset))] [2018-04-11 13:17:25,057 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 7 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:25,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 13:17:25,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 13:17:25,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-04-11 13:17:25,057 INFO L87 Difference]: Start difference. First operand 635 states and 710 transitions. Second operand 30 states. [2018-04-11 13:17:26,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:26,650 INFO L93 Difference]: Finished difference Result 764 states and 860 transitions. [2018-04-11 13:17:26,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 13:17:26,650 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 85 [2018-04-11 13:17:26,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:26,652 INFO L225 Difference]: With dead ends: 764 [2018-04-11 13:17:26,652 INFO L226 Difference]: Without dead ends: 764 [2018-04-11 13:17:26,652 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=654, Invalid=3378, Unknown=0, NotChecked=0, Total=4032 [2018-04-11 13:17:26,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-04-11 13:17:26,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 651. [2018-04-11 13:17:26,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-04-11 13:17:26,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 727 transitions. [2018-04-11 13:17:26,655 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 727 transitions. Word has length 85 [2018-04-11 13:17:26,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:26,656 INFO L459 AbstractCegarLoop]: Abstraction has 651 states and 727 transitions. [2018-04-11 13:17:26,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 13:17:26,656 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 727 transitions. [2018-04-11 13:17:26,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-11 13:17:26,656 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:26,656 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:26,656 INFO L408 AbstractCegarLoop]: === Iteration 73 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:26,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1518394810, now seen corresponding path program 1 times [2018-04-11 13:17:26,657 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:26,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:27,012 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:27,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 13:17:27,012 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:27,012 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 13:17:27,012 INFO L182 omatonBuilderFactory]: Interpolants [53024#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset)), 53025#(and (not (= |main_#t~malloc3.base| main_~x~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset)), 53026#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.offset 0) (not (= main_~y~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset)), 53027#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 53028#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~first~0.offset 12)))) (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12))) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset)), 53029#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= main_~x~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))), 53030#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0) (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))), 53031#(not (= (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) 0) |main_#t~mem6.base|)), 53032#(not (= (select (select |#memory_$Pointer$.base| main_~first~0.base) 0) main_~first~0.base)), 53033#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset) main_~x~1.base)) (not (= 0 main_~x~1.offset))), 53034#(or (not (= 0 main_~x~1.offset)) (not (= |main_#t~mem7.base| main_~x~1.base))), 53035#(or (not (= main_~y~1.base main_~x~1.base)) (not (= 0 main_~x~1.offset))), 53036#(not (= 0 main_~x~1.offset)), 53016#true, 53017#false, 53018#(= 0 |main_#t~malloc1.offset|), 53019#(= main_~x~0.offset 0), 53020#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 53021#(and (= main_~last~0.base main_~first~0.base) (= 1 (select |#valid| main_~last~0.base)) (= main_~last~0.offset main_~first~0.offset)), 53022#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset main_~first~0.offset)), 53023#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset))] [2018-04-11 13:17:27,012 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:27,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 13:17:27,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 13:17:27,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-04-11 13:17:27,012 INFO L87 Difference]: Start difference. First operand 651 states and 727 transitions. Second operand 21 states. [2018-04-11 13:17:27,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:27,697 INFO L93 Difference]: Finished difference Result 730 states and 814 transitions. [2018-04-11 13:17:27,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 13:17:27,697 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 85 [2018-04-11 13:17:27,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:27,698 INFO L225 Difference]: With dead ends: 730 [2018-04-11 13:17:27,698 INFO L226 Difference]: Without dead ends: 729 [2018-04-11 13:17:27,699 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=294, Invalid=1428, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 13:17:27,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-04-11 13:17:27,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 651. [2018-04-11 13:17:27,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-04-11 13:17:27,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 725 transitions. [2018-04-11 13:17:27,702 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 725 transitions. Word has length 85 [2018-04-11 13:17:27,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:27,703 INFO L459 AbstractCegarLoop]: Abstraction has 651 states and 725 transitions. [2018-04-11 13:17:27,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 13:17:27,703 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 725 transitions. [2018-04-11 13:17:27,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-04-11 13:17:27,703 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:27,703 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:27,703 INFO L408 AbstractCegarLoop]: === Iteration 74 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:27,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1282077127, now seen corresponding path program 2 times [2018-04-11 13:17:27,704 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:27,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:28,730 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:28,730 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:28,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 13:17:28,730 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:28,730 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 13:17:28,730 INFO L182 omatonBuilderFactory]: Interpolants [54464#false, 54465#(= |#valid| |old(#valid)|), 54466#(and (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0)) (= 0 |main_#t~malloc1.offset|)), 54467#(and (= (store |#valid| main_~x~0.base 0) |old(#valid)|) (= 0 main_~x~0.offset)), 54468#(and (= 1 (select |#valid| main_~x~0.base)) (= (store |#valid| main_~x~0.base 0) |old(#valid)|) (= 0 main_~x~0.offset)), 54469#(and (not (= main_~x~0.base |main_#t~malloc3.base|)) (= (store (store |#valid| main_~x~0.base 0) |main_#t~malloc3.base| 0) |old(#valid)|) (= 0 main_~x~0.offset)), 54470#(and (= |old(#valid)| (store (store |#valid| main_~x~0.base 0) main_~y~0.base 0)) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 54471#(and (= |old(#valid)| (store (store |#valid| main_~x~0.base 0) main_~y~0.base 0)) (= (select |#valid| main_~y~0.base) 1) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 54472#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= (store (store |#valid| main_~x~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) |old(#valid)|) (= 0 main_~x~0.offset)), 54473#(and (or (= (store (store (store |#valid| |main_#t~malloc3.base| 0) main_~x~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) |old(#valid)|) (= main_~x~0.base |main_#t~malloc3.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~malloc3.base|)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 |main_#t~malloc3.offset|) (= 0 main_~x~0.offset)), 54474#(and (= main_~y~0.offset 0) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (= 0 main_~x~0.offset) (or (= (store (store (store |#valid| main_~y~0.base 0) main_~x~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) |old(#valid)|) (= main_~x~0.base main_~y~0.base))), 54475#(and (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (or (= main_~x~0.base main_~y~0.base) (= (store (store (store |#valid| main_~y~0.base 0) main_~x~0.base 0) |main_#t~mem4.base| 0) |old(#valid)|)) (= main_~y~0.offset 0) (not (= main_~x~0.base |main_#t~mem4.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (= 0 main_~x~0.offset)), 54476#(and (or (and (= |old(#valid)| (store (store (store |#valid| main_~y~0.base 0) main_~x~0.base 0) (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~y~0.base))) (= main_~x~0.base main_~y~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= main_~y~0.offset 0) (= 0 main_~x~0.offset)), 54477#(and (or (and (= |old(#valid)| (store (store (store |#valid| main_~y~0.base 0) main_~x~0.base 0) (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~y~0.base))) (= main_~x~0.base main_~y~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= main_~y~0.offset 0) (not (= main_~y~0.base |main_#t~mem5.base|)) (= 0 main_~x~0.offset)), 54478#(and (or (= main_~x~0.base main_~y~0.base) (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= main_~y~0.offset 0) (= |old(#valid)| (store (store (store |#valid| main_~y~0.base 0) main_~x~0.base 0) (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~y~0.base)))) (= 0 main_~x~0.offset)), 54479#(and (or (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) main_~x~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) 0) |old(#valid)|) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 main_~x~0.offset)), 54480#(and (or (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (and (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset) 0) main_~first~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0) 0) |old(#valid)|) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))))) (= 0 main_~first~0.offset)), 54481#(and (or (and (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0))) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset) 0) main_~x~1.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0) 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0) (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)))) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))) (= main_~x~1.offset 0)), 54482#(and (or (= main_~x~1.base |main_#t~mem7.base|) (and (= (store (store (store |#valid| |main_#t~mem7.base| 0) main_~x~1.base 0) (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0) 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0) |main_#t~mem7.base|)) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0))))) (= main_~x~1.offset 0)), 54483#(and (or (not (= 0 main_~y~1.offset)) (and (= |old(#valid)| (store (store (store |#valid| main_~y~1.base 0) main_~x~1.base 0) (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset) 0)) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset) main_~y~1.base))) (= main_~y~1.base main_~x~1.base)) (= main_~x~1.offset 0)), 54484#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset) main_~z~0.base)) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (= (store (store (store |#valid| main_~z~0.base 0) main_~x~1.base 0) (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset) 0) |old(#valid)|) (not (= main_~z~0.base main_~x~1.base))) (not (= 0 main_~z~0.offset))), 54485#(or (not (= 0 main_~z~0.offset)) (and (not (= |main_#t~mem8.base| main_~z~0.base)) (not (= main_~x~1.base |main_#t~mem8.base|)) (= |old(#valid)| (store (store (store |#valid| main_~z~0.base 0) main_~x~1.base 0) |main_#t~mem8.base| 0)) (not (= main_~z~0.base main_~x~1.base)))), 54486#(or (not (= 0 main_~z~0.offset)) (and (= (store (store (store |#valid| main_~z~0.base 0) main_~x~1.base 0) main_~y~1.base 0) |old(#valid)|) (not (= main_~x~1.base main_~y~1.base)) (not (= main_~y~1.base main_~z~0.base)) (not (= main_~z~0.base main_~x~1.base)))), 54487#(and (= (store (store (store |#valid| main_~z~0.base 0) main_~x~1.base 0) main_~y~1.base 0) |old(#valid)|) (not (= main_~x~1.base main_~y~1.base)) (not (= main_~y~1.base main_~z~0.base)) (not (= main_~z~0.base main_~x~1.base))), 54488#(and (= |old(#valid)| (store (store |#valid| main_~x~1.base 0) main_~y~1.base 0)) (not (= main_~x~1.base main_~y~1.base))), 54489#(and (= |old(#valid)| (store (store |#valid| main_~x~1.base 0) main_~z~0.base 0)) (not (= main_~z~0.base main_~x~1.base))), 54490#(= |old(#valid)| (store |#valid| main_~x~1.base 0)), 54463#true] [2018-04-11 13:17:28,731 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:28,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 13:17:28,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 13:17:28,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2018-04-11 13:17:28,731 INFO L87 Difference]: Start difference. First operand 651 states and 725 transitions. Second operand 28 states. [2018-04-11 13:17:30,004 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 81 DAG size of output 81 [2018-04-11 13:17:30,842 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 66 DAG size of output 65 [2018-04-11 13:17:30,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:30,948 INFO L93 Difference]: Finished difference Result 662 states and 735 transitions. [2018-04-11 13:17:30,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-11 13:17:30,948 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 86 [2018-04-11 13:17:30,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:30,949 INFO L225 Difference]: With dead ends: 662 [2018-04-11 13:17:30,949 INFO L226 Difference]: Without dead ends: 633 [2018-04-11 13:17:30,949 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=272, Invalid=3034, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 13:17:30,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2018-04-11 13:17:30,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 631. [2018-04-11 13:17:30,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2018-04-11 13:17:30,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 704 transitions. [2018-04-11 13:17:30,952 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 704 transitions. Word has length 86 [2018-04-11 13:17:30,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:30,952 INFO L459 AbstractCegarLoop]: Abstraction has 631 states and 704 transitions. [2018-04-11 13:17:30,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 13:17:30,952 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 704 transitions. [2018-04-11 13:17:30,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-04-11 13:17:30,953 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:30,953 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:30,953 INFO L408 AbstractCegarLoop]: === Iteration 75 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:30,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1920897016, now seen corresponding path program 1 times [2018-04-11 13:17:30,954 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:30,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:31,174 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-11 13:17:31,174 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:31,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 13:17:31,175 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:31,175 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 13:17:31,175 INFO L182 omatonBuilderFactory]: Interpolants [55844#true, 55845#false, 55846#(= 0 |main_#t~malloc1.offset|), 55847#(= 0 main_~x~0.offset), 55848#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 55849#(and (not (= main_~x~0.base |main_#t~malloc3.base|)) (= 0 main_~x~0.offset)), 55850#(and (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 55851#(and (not (= main_~x~0.base main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 55852#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 55853#(and (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0)), 55854#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= main_~last~0.offset 0)), 55855#(and (not (= main_~x~0.base main_~last~0.base)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= main_~last~0.offset 0)), 55856#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base main_~first~0.base) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= main_~last~0.offset 0)), 55857#(not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 55858#(and (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset))) (= main_~x~1.base main_~first~0.base)), 55859#(not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))), 55860#(not (= main_~x~1.base |main_#t~mem7.base|)), 55861#(not (= main_~x~1.base main_~y~1.base))] [2018-04-11 13:17:31,175 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-11 13:17:31,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 13:17:31,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 13:17:31,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:17:31,175 INFO L87 Difference]: Start difference. First operand 631 states and 704 transitions. Second operand 18 states. [2018-04-11 13:17:31,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:31,840 INFO L93 Difference]: Finished difference Result 790 states and 889 transitions. [2018-04-11 13:17:31,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 13:17:31,840 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 86 [2018-04-11 13:17:31,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:31,842 INFO L225 Difference]: With dead ends: 790 [2018-04-11 13:17:31,842 INFO L226 Difference]: Without dead ends: 790 [2018-04-11 13:17:31,842 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=365, Invalid=1441, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 13:17:31,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-04-11 13:17:31,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 631. [2018-04-11 13:17:31,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2018-04-11 13:17:31,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 702 transitions. [2018-04-11 13:17:31,848 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 702 transitions. Word has length 86 [2018-04-11 13:17:31,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:31,848 INFO L459 AbstractCegarLoop]: Abstraction has 631 states and 702 transitions. [2018-04-11 13:17:31,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 13:17:31,848 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 702 transitions. [2018-04-11 13:17:31,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-11 13:17:31,849 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:31,849 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:31,849 INFO L408 AbstractCegarLoop]: === Iteration 76 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:31,849 INFO L82 PathProgramCache]: Analyzing trace with hash -619117513, now seen corresponding path program 2 times [2018-04-11 13:17:31,849 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:31,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:32,379 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:32,380 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:32,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 13:17:32,380 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:32,380 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 13:17:32,380 INFO L182 omatonBuilderFactory]: Interpolants [57344#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 57345#(and (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset)) (= (select |#valid| main_~last~0.base) 1)), 57346#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset))), 57347#(and (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset))), 57348#(and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset))), 57349#(and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset)) (= 12 (select |#length| |main_#t~malloc3.base|))), 57350#(or (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)) (and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset)) (not (= main_~y~0.base main_~last~0.base)))), 57351#(or (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)) (and (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (not (= main_~last~0.base |main_#t~mem4.base|)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset)) (not (= main_~y~0.base main_~last~0.base)))), 57352#(or (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)) (and (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (not (= main_~y~0.base main_~last~0.base)))), 57353#(or (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)) (and (not (= |main_#t~mem5.base| main_~last~0.base)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset)) (not (= main_~y~0.base main_~last~0.base)))), 57354#(or (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)) (and (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset)) (not (= main_~y~0.base main_~last~0.base)))), 57355#(or (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)) (and (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset)))), 57356#(or (and (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset))) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))), 57357#(or (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset))), 57358#(or (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~x~1.offset)) (= main_~x~1.base main_~first~0.base))), 57359#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset)), 57360#(= 0 |main_#t~mem7.offset|), 57361#(= 0 main_~y~1.offset), 57362#(= main_~z~0.offset 0), 57337#true, 57338#false, 57339#(= 0 |main_#t~malloc1.offset|), 57340#(= 0 main_~x~0.offset), 57341#(and (= 0 |main_#t~malloc3.offset|) (= 0 main_~x~0.offset)), 57342#(and (= 0 main_~y~0.offset) (= 0 main_~x~0.offset)), 57343#(and (= 0 main_~y~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset))] [2018-04-11 13:17:32,380 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:32,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 13:17:32,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 13:17:32,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2018-04-11 13:17:32,381 INFO L87 Difference]: Start difference. First operand 631 states and 702 transitions. Second operand 26 states. [2018-04-11 13:17:34,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:34,031 INFO L93 Difference]: Finished difference Result 856 states and 966 transitions. [2018-04-11 13:17:34,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-11 13:17:34,031 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 87 [2018-04-11 13:17:34,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:34,033 INFO L225 Difference]: With dead ends: 856 [2018-04-11 13:17:34,033 INFO L226 Difference]: Without dead ends: 856 [2018-04-11 13:17:34,033 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=886, Invalid=3806, Unknown=0, NotChecked=0, Total=4692 [2018-04-11 13:17:34,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-04-11 13:17:34,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 633. [2018-04-11 13:17:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2018-04-11 13:17:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 704 transitions. [2018-04-11 13:17:34,038 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 704 transitions. Word has length 87 [2018-04-11 13:17:34,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:34,038 INFO L459 AbstractCegarLoop]: Abstraction has 633 states and 704 transitions. [2018-04-11 13:17:34,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 13:17:34,038 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 704 transitions. [2018-04-11 13:17:34,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-11 13:17:34,038 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:34,038 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:34,038 INFO L408 AbstractCegarLoop]: === Iteration 77 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:34,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1734830843, now seen corresponding path program 1 times [2018-04-11 13:17:34,039 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:34,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:34,825 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:34,825 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:34,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-11 13:17:34,825 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:34,826 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 13:17:34,826 INFO L182 omatonBuilderFactory]: Interpolants [58944#true, 58945#false, 58946#(= 0 |main_#t~malloc1.offset|), 58947#(= main_~x~0.offset 0), 58948#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 58949#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 58950#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset main_~first~0.offset)), 58951#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 58952#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 58953#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 |main_#t~malloc3.offset|) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 12 (select |#length| |main_#t~malloc3.base|)) (= 0 main_~x~0.offset)), 58954#(and (not (= main_~x~0.base main_~last~0.base)) (or (and (or (and (= main_~y~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~y~0.base main_~last~0.base))) (= main_~x~0.base main_~y~0.base)) (= main_~last~0.offset main_~first~0.offset)) (and (= 12 (select |#length| main_~first~0.base)) (= main_~last~0.offset 0))) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 main_~x~0.offset)), 58955#(and (or (= main_~x~0.base main_~y~0.base) (= 12 (select |#length| main_~first~0.base)) (and (= main_~y~0.offset 0) (= |main_#t~mem4.base| main_~x~0.base) (not (= main_~y~0.base main_~last~0.base)))) (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 58956#(and (not (= main_~x~0.base main_~last~0.base)) (or (= main_~x~0.base main_~y~0.base) (= 12 (select |#length| main_~first~0.base)) (and (= main_~y~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (not (= main_~y~0.base main_~last~0.base)))) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 58957#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (or (= main_~x~0.base main_~y~0.base) (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~y~0.base |main_#t~mem5.base|)) (= main_~y~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~x~0.base) (not (= main_~y~0.base main_~last~0.base)))) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 58958#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) main_~x~0.base))) (= 0 main_~x~0.offset)), 58959#(and (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12))) (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12))) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~first~0.offset 12)))), 58960#(and (= main_~first~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= main_~x~0.offset 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 58961#(and (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0)) 0) (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 58962#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) 0)) 0) |main_#t~mem6.base|) (= 0 |main_#t~mem6.offset|)), 58963#(and (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) 0)) 0)) (= 0 main_~first~0.offset)), 58964#(and (or (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) (= main_~x~1.base main_~first~0.base))) (= main_~x~1.offset 0)), 58965#(and (= main_~x~1.offset 0) (or (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)))))), 58966#(and (= main_~x~1.offset 0) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0))) (= main_~x~1.base (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0))) (= main_~x~1.base |main_#t~mem7.base|))), 58967#(and (or (not (= 0 main_~y~1.offset)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (= main_~y~1.base main_~x~1.base)) (= main_~x~1.offset 0)), 58968#(or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= main_~z~0.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))) (not (= 0 main_~z~0.offset))), 58969#(or (not (= 0 main_~z~0.offset)) (and (= 1 (select |#valid| |main_#t~mem8.base|)) (not (= main_~z~0.base |main_#t~mem8.base|)))), 58970#(or (not (= 0 main_~z~0.offset)) (and (= 1 (select |#valid| main_~y~1.base)) (not (= main_~z~0.base main_~y~1.base)))), 58971#(and (= 1 (select |#valid| main_~y~1.base)) (not (= main_~z~0.base main_~y~1.base))), 58972#(= 1 (select |#valid| main_~y~1.base))] [2018-04-11 13:17:34,826 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:34,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 13:17:34,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 13:17:34,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2018-04-11 13:17:34,826 INFO L87 Difference]: Start difference. First operand 633 states and 704 transitions. Second operand 29 states. [2018-04-11 13:17:36,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:36,356 INFO L93 Difference]: Finished difference Result 755 states and 845 transitions. [2018-04-11 13:17:36,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-11 13:17:36,356 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 87 [2018-04-11 13:17:36,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:36,357 INFO L225 Difference]: With dead ends: 755 [2018-04-11 13:17:36,357 INFO L226 Difference]: Without dead ends: 755 [2018-04-11 13:17:36,358 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=585, Invalid=4245, Unknown=0, NotChecked=0, Total=4830 [2018-04-11 13:17:36,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-04-11 13:17:36,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 686. [2018-04-11 13:17:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-04-11 13:17:36,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 766 transitions. [2018-04-11 13:17:36,361 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 766 transitions. Word has length 87 [2018-04-11 13:17:36,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:36,361 INFO L459 AbstractCegarLoop]: Abstraction has 686 states and 766 transitions. [2018-04-11 13:17:36,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 13:17:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 766 transitions. [2018-04-11 13:17:36,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-11 13:17:36,362 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:36,362 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:36,362 INFO L408 AbstractCegarLoop]: === Iteration 78 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:36,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1734830842, now seen corresponding path program 1 times [2018-04-11 13:17:36,362 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:36,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:37,241 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 19 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:37,241 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:37,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-11 13:17:37,241 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:37,241 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 13:17:37,242 INFO L182 omatonBuilderFactory]: Interpolants [60499#true, 60500#false, 60501#(= 0 |main_#t~malloc1.offset|), 60502#(= main_~x~0.offset 0), 60503#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 60504#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 60505#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset main_~first~0.offset)), 60506#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset)), 60507#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.offset 0) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset)), 60508#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= (select |#valid| main_~x~0.base) 1)), 60509#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (not (= main_~x~0.base main_~last~0.base)) (not (= main_~x~0.base |main_#t~malloc3.base|)) (= 0 main_~first~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 |main_#t~malloc3.offset|) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 12 (select |#length| |main_#t~malloc3.base|))), 60510#(and (or (and (= main_~first~0.base main_~last~0.base) (= 12 (select |#length| main_~first~0.base)) (= main_~last~0.offset 0)) (and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= main_~y~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (not (= main_~y~0.base main_~last~0.base)))) (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 60511#(and (not (= |main_#t~mem4.base| main_~y~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (or (= 12 (select |#length| main_~first~0.base)) (and (= |main_#t~mem4.offset| 0) (= main_~x~0.base |main_#t~mem4.base|) (= main_~y~0.offset 0) (not (= main_~y~0.base main_~last~0.base)))) (= main_~last~0.base main_~first~0.base) (not (= main_~x~0.base main_~y~0.base)) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 60512#(and (not (= main_~x~0.base main_~last~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~y~0.base)) (= 0 main_~first~0.offset) (or (= 12 (select |#length| main_~first~0.base)) (and (= main_~y~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset) 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (not (= main_~y~0.base main_~last~0.base)))) (= main_~last~0.base main_~first~0.base) (not (= main_~x~0.base main_~y~0.base)) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 60513#(and (not (= main_~y~0.base |main_#t~mem5.base|)) (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (or (= 12 (select |#length| main_~first~0.base)) (and (= main_~y~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset) 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (not (= main_~y~0.base main_~last~0.base)))) (= main_~last~0.base main_~first~0.base) (not (= main_~x~0.base main_~y~0.base)) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 60514#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (or (= 12 (select |#length| main_~first~0.base)) (and (= main_~y~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset) 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (not (= main_~y~0.base main_~last~0.base)))) (= main_~last~0.base main_~first~0.base) (not (= main_~x~0.base main_~y~0.base)) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 60515#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (or (and (= main_~first~0.base main_~last~0.base) (= 12 (select |#length| main_~first~0.base)) (= main_~last~0.offset 0)) (and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset))) (= 0 main_~x~0.offset)), 60516#(and (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (not (= main_~x~0.base main_~last~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12))) (= main_~x~0.offset 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~first~0.offset 12)))), 60517#(and (= main_~first~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (= main_~x~0.offset 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 60518#(and (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0)) 0) 0) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 60519#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) 0)) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) 0)) 0) 0) (= 0 |main_#t~mem6.offset|)), 60520#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) 0)) 0) 0) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) 0)) 0)) (= 0 main_~first~0.offset)), 60521#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0) 0) (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) (= main_~x~1.offset 0)), 60522#(and (= (select (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) 0) 0) (= main_~x~1.base (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0)) (= main_~x~1.offset 0)), 60523#(and (= main_~x~1.offset 0) (or (not (= 0 main_~y~1.offset)) (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) (= (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset) 0)))), 60524#(or (and (= main_~x~1.offset main_~z~0.offset) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) (= (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset) 0)) (not (= 0 main_~z~0.offset))), 60525#(or (and (= main_~x~1.offset main_~z~0.offset) (= main_~x~1.base |main_#t~mem8.base|) (= |main_#t~mem8.offset| 0)) (not (= 0 main_~z~0.offset))), 60526#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset main_~z~0.offset) (= main_~y~1.base main_~x~1.base) (= main_~y~1.offset 0))), 60527#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base))] [2018-04-11 13:17:37,242 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 19 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:37,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 13:17:37,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 13:17:37,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2018-04-11 13:17:37,242 INFO L87 Difference]: Start difference. First operand 686 states and 766 transitions. Second operand 29 states. [2018-04-11 13:17:39,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:39,193 INFO L93 Difference]: Finished difference Result 761 states and 849 transitions. [2018-04-11 13:17:39,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-11 13:17:39,193 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 87 [2018-04-11 13:17:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:39,194 INFO L225 Difference]: With dead ends: 761 [2018-04-11 13:17:39,194 INFO L226 Difference]: Without dead ends: 761 [2018-04-11 13:17:39,195 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1293 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=658, Invalid=4598, Unknown=0, NotChecked=0, Total=5256 [2018-04-11 13:17:39,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2018-04-11 13:17:39,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 685. [2018-04-11 13:17:39,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2018-04-11 13:17:39,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 763 transitions. [2018-04-11 13:17:39,198 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 763 transitions. Word has length 87 [2018-04-11 13:17:39,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:39,198 INFO L459 AbstractCegarLoop]: Abstraction has 685 states and 763 transitions. [2018-04-11 13:17:39,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 13:17:39,198 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 763 transitions. [2018-04-11 13:17:39,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-11 13:17:39,198 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:39,198 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:39,198 INFO L408 AbstractCegarLoop]: === Iteration 79 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:39,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1674027875, now seen corresponding path program 5 times [2018-04-11 13:17:39,199 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:39,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:39,485 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 14 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:39,485 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:39,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 13:17:39,485 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:39,485 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 13:17:39,485 INFO L182 omatonBuilderFactory]: Interpolants [62080#(and (or (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)))) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~last~0.base main_~first~0.base))), 62081#(and (not (= main_~x~0.base main_~first~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)))), 62082#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 62083#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset))) (= main_~x~1.base main_~first~0.base)), 62084#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))), 62085#(= 1 (select |#valid| |main_#t~mem7.base|)), 62086#(= 1 (select |#valid| main_~y~1.base)), 62065#true, 62066#false, 62067#(= 0 |main_#t~malloc1.offset|), 62068#(= 0 main_~x~0.offset), 62069#(and (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 62070#(and (= (select |#valid| main_~y~0.base) 1) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 62071#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 62072#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 62073#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= |main_#t~malloc1.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base |main_#t~malloc1.base|)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base)), 62074#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base)), 62075#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 62076#(and (not (= main_~first~0.base main_~x~0.base)) (= (select |#valid| main_~first~0.base) 1) (or (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))))), 62077#(and (or (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)))) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base))), 62078#(and (or (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= |main_#t~malloc1.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)))) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base))), 62079#(and (not (= main_~x~0.base main_~first~0.base)) (or (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)))) (not (= main_~last~0.base main_~first~0.base)))] [2018-04-11 13:17:39,486 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 14 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:39,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 13:17:39,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 13:17:39,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:17:39,486 INFO L87 Difference]: Start difference. First operand 685 states and 763 transitions. Second operand 22 states. [2018-04-11 13:17:40,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:40,254 INFO L93 Difference]: Finished difference Result 777 states and 873 transitions. [2018-04-11 13:17:40,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 13:17:40,254 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 88 [2018-04-11 13:17:40,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:40,255 INFO L225 Difference]: With dead ends: 777 [2018-04-11 13:17:40,255 INFO L226 Difference]: Without dead ends: 777 [2018-04-11 13:17:40,256 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=294, Invalid=1428, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 13:17:40,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2018-04-11 13:17:40,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 716. [2018-04-11 13:17:40,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2018-04-11 13:17:40,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 800 transitions. [2018-04-11 13:17:40,259 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 800 transitions. Word has length 88 [2018-04-11 13:17:40,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:40,259 INFO L459 AbstractCegarLoop]: Abstraction has 716 states and 800 transitions. [2018-04-11 13:17:40,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 13:17:40,259 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 800 transitions. [2018-04-11 13:17:40,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-11 13:17:40,260 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:40,260 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:40,260 INFO L408 AbstractCegarLoop]: === Iteration 80 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:40,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1674027874, now seen corresponding path program 4 times [2018-04-11 13:17:40,260 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:40,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:40,678 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 14 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:40,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:40,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 13:17:40,678 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:40,678 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 13:17:40,678 INFO L182 omatonBuilderFactory]: Interpolants [63623#true, 63624#false, 63625#(= 0 |main_#t~malloc1.offset|), 63626#(= 0 main_~x~0.offset), 63627#(and (= 0 |main_#t~malloc3.offset|) (= 12 (select |#length| |main_#t~malloc3.base|)) (= 0 main_~x~0.offset)), 63628#(and (= 12 (select |#length| main_~y~0.base)) (= 0 main_~y~0.offset) (= 0 main_~x~0.offset)), 63629#(and (= 12 (select |#length| main_~y~0.base)) (= 0 main_~y~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 63630#(and (= (select |#valid| main_~y~0.base) 1) (= (select |#length| main_~y~0.base) 12) (= 0 main_~y~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 63631#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 63632#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 1) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset)) (= (select |#valid| main_~last~0.base) 1)), 63633#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset))), 63634#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset))), 63635#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset)) (= (select |#valid| main_~last~0.base) 1)), 63636#(and (not (= main_~first~0.base main_~x~0.base)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (= (select |#valid| main_~first~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset))), 63637#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset))), 63638#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset))), 63639#(and (not (= main_~x~0.base main_~first~0.base)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset))), 63640#(and (not (= main_~x~0.base main_~first~0.base)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset))), 63641#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset))), 63642#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~x~1.offset)) (= main_~x~1.base main_~first~0.base) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)))), 63643#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset))), 63644#(and (<= 12 (select |#length| |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 63645#(and (= main_~y~1.offset 0) (<= 12 (select |#length| main_~y~1.base)))] [2018-04-11 13:17:40,678 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 14 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:40,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 13:17:40,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 13:17:40,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:17:40,679 INFO L87 Difference]: Start difference. First operand 716 states and 800 transitions. Second operand 23 states. [2018-04-11 13:17:41,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:41,956 INFO L93 Difference]: Finished difference Result 845 states and 943 transitions. [2018-04-11 13:17:41,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 13:17:41,956 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 88 [2018-04-11 13:17:41,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:41,957 INFO L225 Difference]: With dead ends: 845 [2018-04-11 13:17:41,957 INFO L226 Difference]: Without dead ends: 845 [2018-04-11 13:17:41,957 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=404, Invalid=2146, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 13:17:41,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-04-11 13:17:41,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 716. [2018-04-11 13:17:41,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2018-04-11 13:17:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 798 transitions. [2018-04-11 13:17:41,960 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 798 transitions. Word has length 88 [2018-04-11 13:17:41,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:41,961 INFO L459 AbstractCegarLoop]: Abstraction has 716 states and 798 transitions. [2018-04-11 13:17:41,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 13:17:41,961 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 798 transitions. [2018-04-11 13:17:41,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-11 13:17:41,961 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:41,961 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:41,961 INFO L408 AbstractCegarLoop]: === Iteration 81 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:41,961 INFO L82 PathProgramCache]: Analyzing trace with hash 2054817306, now seen corresponding path program 1 times [2018-04-11 13:17:41,962 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:41,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:42,017 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-04-11 13:17:42,017 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:17:42,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 13:17:42,017 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:42,017 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 13:17:42,017 INFO L182 omatonBuilderFactory]: Interpolants [65267#true, 65268#false, 65269#(or (not (= 0 main_~x~1.offset)) (= main_~x~1.base main_~first~0.base)), 65270#(or (not (= 0 main_~x~1.offset)) (= 1 (select |#valid| main_~x~1.base))), 65271#(or (not (= main_~x~1.offset main_~z~0.offset)) (not (= 0 main_~x~1.offset)) (and (not (= main_~z~0.base main_~x~1.base)) (= 1 (select |#valid| main_~x~1.base)))), 65272#(or (not (= 0 main_~x~1.offset)) (and (not (= main_~z~0.base main_~x~1.base)) (= 1 (select |#valid| main_~x~1.base)))), 65273#(= 1 (select |#valid| main_~x~1.base))] [2018-04-11 13:17:42,017 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-04-11 13:17:42,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 13:17:42,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 13:17:42,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:17:42,018 INFO L87 Difference]: Start difference. First operand 716 states and 798 transitions. Second operand 7 states. [2018-04-11 13:17:42,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:42,123 INFO L93 Difference]: Finished difference Result 773 states and 873 transitions. [2018-04-11 13:17:42,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:17:42,123 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2018-04-11 13:17:42,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:42,124 INFO L225 Difference]: With dead ends: 773 [2018-04-11 13:17:42,124 INFO L226 Difference]: Without dead ends: 773 [2018-04-11 13:17:42,124 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-04-11 13:17:42,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2018-04-11 13:17:42,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 691. [2018-04-11 13:17:42,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2018-04-11 13:17:42,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 766 transitions. [2018-04-11 13:17:42,128 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 766 transitions. Word has length 88 [2018-04-11 13:17:42,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:42,128 INFO L459 AbstractCegarLoop]: Abstraction has 691 states and 766 transitions. [2018-04-11 13:17:42,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 13:17:42,128 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 766 transitions. [2018-04-11 13:17:42,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-11 13:17:42,128 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:42,129 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:42,129 INFO L408 AbstractCegarLoop]: === Iteration 82 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:42,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1862209693, now seen corresponding path program 6 times [2018-04-11 13:17:42,129 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:42,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:42,650 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 11 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:42,650 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:42,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 13:17:42,651 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:42,651 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 13:17:42,651 INFO L182 omatonBuilderFactory]: Interpolants [66753#(= 0 |main_#t~malloc1.offset|), 66752#false, 66755#(and (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 66754#(= 0 main_~x~0.offset), 66757#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0)), 66756#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 66759#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0)), 66758#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0)), 66761#(and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (or (= 12 (select |#length| main_~last~0.base)) (not (= main_~last~0.base |main_#t~malloc3.base|))) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0)), 66760#(and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0)), 66763#(and (or (= 12 (select |#length| main_~last~0.base)) (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base |main_#t~mem4.base|)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (not (= main_~y~0.base main_~last~0.base)))) (= main_~last~0.offset 0)), 66762#(and (= main_~last~0.offset 0) (or (and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (not (= main_~y~0.base main_~last~0.base))) (= 12 (select |#length| main_~last~0.base)))), 66765#(and (or (= 12 (select |#length| main_~last~0.base)) (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= |main_#t~mem5.base| main_~last~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (not (= main_~y~0.base main_~last~0.base)))) (= main_~last~0.offset 0)), 66764#(and (= main_~last~0.offset 0) (or (= 12 (select |#length| main_~last~0.base)) (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (not (= main_~y~0.base main_~last~0.base))))), 66767#(and (or (= 12 (select |#length| main_~last~0.base)) (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base))) (= main_~last~0.offset 0)), 66766#(and (or (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (not (= main_~y~0.base main_~last~0.base))) (= 12 (select |#length| main_~last~0.base))) (= main_~last~0.offset 0)), 66769#(and (not (= main_~first~0.base main_~x~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= (select |#valid| main_~first~0.base) 1)), 66768#(and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0)), 66771#(and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base))), 66770#(and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base))), 66773#(and (not (= main_~x~0.base main_~first~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 66772#(and (not (= main_~x~0.base main_~first~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~first~0.base))), 66775#(and (= main_~x~1.base main_~first~0.base) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset))), 66774#(= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)), 66777#(= 1 (select |#valid| |main_#t~mem7.base|)), 66776#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))), 66778#(= 1 (select |#valid| main_~y~1.base)), 66751#true] [2018-04-11 13:17:42,651 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 11 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:42,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 13:17:42,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 13:17:42,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2018-04-11 13:17:42,651 INFO L87 Difference]: Start difference. First operand 691 states and 766 transitions. Second operand 28 states. [2018-04-11 13:17:43,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:43,996 INFO L93 Difference]: Finished difference Result 857 states and 956 transitions. [2018-04-11 13:17:43,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 13:17:43,996 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 88 [2018-04-11 13:17:43,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:43,997 INFO L225 Difference]: With dead ends: 857 [2018-04-11 13:17:43,997 INFO L226 Difference]: Without dead ends: 857 [2018-04-11 13:17:43,997 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=530, Invalid=2892, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 13:17:43,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2018-04-11 13:17:44,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 747. [2018-04-11 13:17:44,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2018-04-11 13:17:44,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 830 transitions. [2018-04-11 13:17:44,002 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 830 transitions. Word has length 88 [2018-04-11 13:17:44,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:44,002 INFO L459 AbstractCegarLoop]: Abstraction has 747 states and 830 transitions. [2018-04-11 13:17:44,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 13:17:44,002 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 830 transitions. [2018-04-11 13:17:44,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-11 13:17:44,003 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:44,003 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:44,003 INFO L408 AbstractCegarLoop]: === Iteration 83 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:44,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1862209694, now seen corresponding path program 5 times [2018-04-11 13:17:44,003 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:44,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 11 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:44,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:44,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-11 13:17:44,665 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:44,665 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 13:17:44,665 INFO L182 omatonBuilderFactory]: Interpolants [68451#false, 68450#true, 68453#(= 0 main_~x~0.offset), 68452#(= 0 |main_#t~malloc1.offset|), 68455#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 68454#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 68457#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~last~0.offset 0)), 68456#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0)), 68459#(and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~last~0.offset 0)), 68458#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~last~0.offset 0)), 68461#(and (or (= 12 (select |#length| main_~last~0.base)) (and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~y~0.base main_~last~0.base)))) (= main_~last~0.offset 0)), 68460#(and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~last~0.offset 0) (= 12 (select |#length| |main_#t~malloc3.base|))), 68463#(and (or (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (not (= main_~y~0.base main_~last~0.base))) (= 12 (select |#length| main_~last~0.base))) (= main_~last~0.offset 0)), 68462#(and (or (= 12 (select |#length| main_~last~0.base)) (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base |main_#t~mem4.base|)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~y~0.base main_~last~0.base)))) (= main_~last~0.offset 0)), 68465#(and (= main_~last~0.offset 0) (or (= 12 (select |#length| main_~last~0.base)) (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~y~0.base main_~last~0.base))))), 68464#(and (= main_~last~0.offset 0) (or (= 12 (select |#length| main_~last~0.base)) (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= |main_#t~mem5.base| main_~last~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~y~0.base main_~last~0.base))))), 68467#(and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0)), 68466#(and (= main_~last~0.offset 0) (or (= 12 (select |#length| main_~last~0.base)) (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset)))), 68469#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base))), 68468#(and (not (= main_~first~0.base main_~x~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= (select |#valid| main_~first~0.base) 1)), 68471#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~x~0.base main_~first~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~first~0.base))), 68470#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base))), 68473#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 68472#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~x~0.base main_~first~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 68475#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset))), 68474#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~x~1.offset)) (= main_~x~1.base main_~first~0.base)), 68477#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base)), 68476#(and (= main_~x~1.offset |main_#t~mem7.offset|) (= main_~x~1.base |main_#t~mem7.base|))] [2018-04-11 13:17:44,666 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 11 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:44,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 13:17:44,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 13:17:44,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2018-04-11 13:17:44,666 INFO L87 Difference]: Start difference. First operand 747 states and 830 transitions. Second operand 28 states. [2018-04-11 13:17:46,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:46,113 INFO L93 Difference]: Finished difference Result 851 states and 946 transitions. [2018-04-11 13:17:46,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 13:17:46,113 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 88 [2018-04-11 13:17:46,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:46,114 INFO L225 Difference]: With dead ends: 851 [2018-04-11 13:17:46,114 INFO L226 Difference]: Without dead ends: 851 [2018-04-11 13:17:46,114 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=541, Invalid=2999, Unknown=0, NotChecked=0, Total=3540 [2018-04-11 13:17:46,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-04-11 13:17:46,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 718. [2018-04-11 13:17:46,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2018-04-11 13:17:46,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 795 transitions. [2018-04-11 13:17:46,118 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 795 transitions. Word has length 88 [2018-04-11 13:17:46,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:46,118 INFO L459 AbstractCegarLoop]: Abstraction has 718 states and 795 transitions. [2018-04-11 13:17:46,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 13:17:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 795 transitions. [2018-04-11 13:17:46,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-11 13:17:46,119 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:46,119 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:46,119 INFO L408 AbstractCegarLoop]: === Iteration 84 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:46,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1346229267, now seen corresponding path program 7 times [2018-04-11 13:17:46,119 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:46,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:46,614 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 11 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:46,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:46,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 13:17:46,615 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:46,615 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 13:17:46,615 INFO L182 omatonBuilderFactory]: Interpolants [70117#false, 70116#true, 70119#(= 0 main_~x~0.offset), 70118#(= 0 |main_#t~malloc1.offset|), 70121#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 70120#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 70123#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base)), 70122#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 70125#(and (= main_~first~0.offset 0) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 70124#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base)), 70127#(and (= main_~first~0.offset 0) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base))), 70126#(and (not (= main_~first~0.base main_~x~0.base)) (= main_~first~0.offset 0) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= (select |#valid| main_~first~0.base) 1)), 70129#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~first~0.base))), 70128#(and (= main_~first~0.offset 0) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base))), 70131#(and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (or (not (= main_~first~0.base |main_#t~malloc3.base|)) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))) (not (= main_~last~0.base main_~first~0.base))), 70130#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~first~0.base))), 70133#(or (and (not (= main_~x~0.base main_~first~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~first~0.base |main_#t~mem4.base|)) (not (= main_~last~0.base main_~first~0.base)) (not (= main_~y~0.base main_~first~0.base))) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))), 70132#(or (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base))) (and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~first~0.base)) (not (= main_~y~0.base main_~first~0.base)))), 70135#(or (and (not (= main_~x~0.base main_~first~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= |main_#t~mem5.base| main_~first~0.base)) (not (= main_~last~0.base main_~first~0.base)) (not (= main_~y~0.base main_~first~0.base))) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))), 70134#(or (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base))) (and (not (= main_~x~0.base main_~first~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~first~0.base)) (not (= main_~y~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))))), 70137#(or (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base))) (and (not (= main_~x~0.base main_~first~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~first~0.base)))), 70136#(or (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base))) (and (not (= main_~x~0.base main_~first~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~first~0.base)) (not (= main_~y~0.base main_~first~0.base)))), 70139#(or (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))), 70138#(or (and (not (= main_~x~0.base main_~first~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))), 70141#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))), 70140#(or (and (= main_~first~0.offset 0) (= main_~x~1.base main_~first~0.base) (= 12 (select |#length| main_~x~1.base))) (and (= main_~x~1.base main_~first~0.base) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)))), 70143#(= 1 (select |#valid| main_~y~1.base)), 70142#(= 1 (select |#valid| |main_#t~mem7.base|))] [2018-04-11 13:17:46,615 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 11 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:46,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 13:17:46,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 13:17:46,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2018-04-11 13:17:46,616 INFO L87 Difference]: Start difference. First operand 718 states and 795 transitions. Second operand 28 states. [2018-04-11 13:17:48,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:48,042 INFO L93 Difference]: Finished difference Result 881 states and 979 transitions. [2018-04-11 13:17:48,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 13:17:48,042 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 88 [2018-04-11 13:17:48,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:48,043 INFO L225 Difference]: With dead ends: 881 [2018-04-11 13:17:48,043 INFO L226 Difference]: Without dead ends: 881 [2018-04-11 13:17:48,044 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=519, Invalid=2787, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 13:17:48,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2018-04-11 13:17:48,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 769. [2018-04-11 13:17:48,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-04-11 13:17:48,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 852 transitions. [2018-04-11 13:17:48,051 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 852 transitions. Word has length 88 [2018-04-11 13:17:48,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:48,051 INFO L459 AbstractCegarLoop]: Abstraction has 769 states and 852 transitions. [2018-04-11 13:17:48,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 13:17:48,052 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 852 transitions. [2018-04-11 13:17:48,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-11 13:17:48,052 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:48,053 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:48,053 INFO L408 AbstractCegarLoop]: === Iteration 85 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:48,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1346229268, now seen corresponding path program 6 times [2018-04-11 13:17:48,053 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:48,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:48,653 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 11 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:48,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:48,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-11 13:17:48,653 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:48,654 INFO L182 omatonBuilderFactory]: Interpolants [71873#(and (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~first~0.base))), 71872#(and (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~x~0.base main_~first~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~first~0.base))), 71875#(or (and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~first~0.base)) (not (= main_~y~0.base main_~first~0.base))) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))), 71874#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (or (not (= main_~first~0.base |main_#t~malloc3.base|)) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))) (not (= main_~last~0.base main_~first~0.base))), 71877#(or (and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~x~0.base main_~first~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~first~0.base)) (not (= main_~y~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)))) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))), 71876#(or (and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~x~0.base main_~first~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~first~0.base |main_#t~mem4.base|)) (not (= main_~last~0.base main_~first~0.base)) (not (= main_~y~0.base main_~first~0.base))) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))), 71879#(or (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base))) (and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~x~0.base main_~first~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~first~0.base)) (not (= main_~y~0.base main_~first~0.base)))), 71878#(or (and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~x~0.base main_~first~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= |main_#t~mem5.base| main_~first~0.base)) (not (= main_~last~0.base main_~first~0.base)) (not (= main_~y~0.base main_~first~0.base))) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))), 71881#(or (and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~x~0.base main_~first~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))), 71880#(or (and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~x~0.base main_~first~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~first~0.base))) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))), 71883#(or (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~x~1.offset)) (= main_~x~1.base main_~first~0.base)) (and (= main_~first~0.offset 0) (= main_~x~1.base main_~first~0.base) (= 12 (select |#length| main_~x~1.base)))), 71882#(or (and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))), 71885#(and (= main_~x~1.offset |main_#t~mem7.offset|) (= main_~x~1.base |main_#t~mem7.base|)), 71884#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset))), 71886#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base)), 71859#true, 71861#(= 0 |main_#t~malloc1.offset|), 71860#false, 71863#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 71862#(= 0 main_~x~0.offset), 71865#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= (select |#valid| main_~last~0.base) 1)), 71864#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 71867#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset)), 71866#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset)), 71869#(and (not (= main_~first~0.base main_~x~0.base)) (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= (select |#valid| main_~first~0.base) 1)), 71868#(and (= main_~first~0.offset 0) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= (select |#valid| main_~last~0.base) 1)), 71871#(and (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base))), 71870#(and (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base)))] [2018-04-11 13:17:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 11 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:48,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 13:17:48,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 13:17:48,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2018-04-11 13:17:48,654 INFO L87 Difference]: Start difference. First operand 769 states and 852 transitions. Second operand 28 states. [2018-04-11 13:17:50,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:50,090 INFO L93 Difference]: Finished difference Result 881 states and 978 transitions. [2018-04-11 13:17:50,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 13:17:50,090 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 88 [2018-04-11 13:17:50,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:50,091 INFO L225 Difference]: With dead ends: 881 [2018-04-11 13:17:50,091 INFO L226 Difference]: Without dead ends: 881 [2018-04-11 13:17:50,091 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=529, Invalid=2893, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 13:17:50,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2018-04-11 13:17:50,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 760. [2018-04-11 13:17:50,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2018-04-11 13:17:50,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 841 transitions. [2018-04-11 13:17:50,095 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 841 transitions. Word has length 88 [2018-04-11 13:17:50,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:50,095 INFO L459 AbstractCegarLoop]: Abstraction has 760 states and 841 transitions. [2018-04-11 13:17:50,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 13:17:50,095 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 841 transitions. [2018-04-11 13:17:50,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-11 13:17:50,096 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:50,096 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:50,096 INFO L408 AbstractCegarLoop]: === Iteration 86 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:50,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1101680414, now seen corresponding path program 4 times [2018-04-11 13:17:50,097 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:50,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:50,585 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 23 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:50,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:50,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 13:17:50,586 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:50,586 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 13:17:50,586 INFO L182 omatonBuilderFactory]: Interpolants [73601#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.offset main_~last~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|)), 73600#(and (= main_~first~0.offset main_~last~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 73603#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~first~0.offset main_~last~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 main_~x~0.offset)), 73602#(and (= main_~first~0.offset main_~last~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 main_~x~0.offset)), 73605#(and (not (= main_~first~0.base main_~x~0.base)) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) main_~x~0.base) (= 1 (select |#valid| main_~first~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 1) (= 0 main_~x~0.offset)), 73604#(and (= (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12)) main_~x~0.base) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 1 (select |#valid| main_~last~0.base)) (= main_~last~0.offset main_~first~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 73607#(and (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) |main_#t~malloc1.base|)) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base)) (= main_~last~0.offset 0) (= 1 (select |#valid| |main_#t~malloc1.base|))), 73606#(and (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~last~0.base main_~first~0.base)) (= main_~last~0.offset 0) (= 1 (select |#valid| main_~first~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 1)), 73609#(and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12)))) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12)))) (= main_~last~0.offset 0)), 73608#(and (not (= main_~first~0.base main_~x~0.base)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~last~0.base main_~first~0.base)) (= main_~last~0.offset 0)), 73611#(and (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12)))) (not (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12))))), 73610#(and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12)))) (not (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12))))), 73613#(or (and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))) (<= 1 main_~first~0.offset) (<= (+ main_~first~0.offset 1) 0)), 73612#(and (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) (+ 0 12)))) (not (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) (+ 0 12)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) (+ 0 12))))), 73615#(or (and (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))) (and (or (<= 1 main_~first~0.offset) (<= (+ main_~first~0.offset 1) 0)) (not (= 0 main_~x~1.offset)))), 73614#(or (<= 1 main_~first~0.offset) (and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))) (<= (+ main_~first~0.offset 1) 0)), 73617#(or (and (not (= main_~x~1.base main_~first~0.base)) (= 1 (select |#valid| main_~first~0.base))) (not (= 0 main_~x~1.offset))), 73616#(or (and (= 1 (select |#valid| |main_#t~mem6.base|)) (not (= main_~x~1.base |main_#t~mem6.base|))) (not (= 0 main_~x~1.offset))), 73619#(= 1 (select |#valid| main_~first~0.base)), 73618#(and (not (= main_~x~1.base main_~first~0.base)) (= 1 (select |#valid| main_~first~0.base))), 73595#true, 73597#(= 0 |main_#t~malloc1.offset|), 73596#false, 73599#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 73598#(= main_~x~0.offset 0)] [2018-04-11 13:17:50,586 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 23 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:50,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 13:17:50,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 13:17:50,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-04-11 13:17:50,587 INFO L87 Difference]: Start difference. First operand 760 states and 841 transitions. Second operand 25 states. [2018-04-11 13:17:51,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:51,912 INFO L93 Difference]: Finished difference Result 884 states and 973 transitions. [2018-04-11 13:17:51,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 13:17:51,912 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 88 [2018-04-11 13:17:51,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:51,913 INFO L225 Difference]: With dead ends: 884 [2018-04-11 13:17:51,913 INFO L226 Difference]: Without dead ends: 884 [2018-04-11 13:17:51,913 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=444, Invalid=2418, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 13:17:51,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2018-04-11 13:17:51,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 787. [2018-04-11 13:17:51,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2018-04-11 13:17:51,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 872 transitions. [2018-04-11 13:17:51,919 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 872 transitions. Word has length 88 [2018-04-11 13:17:51,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:51,919 INFO L459 AbstractCegarLoop]: Abstraction has 787 states and 872 transitions. [2018-04-11 13:17:51,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 13:17:51,919 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 872 transitions. [2018-04-11 13:17:51,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-11 13:17:51,920 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:51,920 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:51,920 INFO L408 AbstractCegarLoop]: === Iteration 87 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:51,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1101680413, now seen corresponding path program 3 times [2018-04-11 13:17:51,920 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:51,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:52,464 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 26 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:52,464 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:52,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 13:17:52,464 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:52,464 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 13:17:52,464 INFO L182 omatonBuilderFactory]: Interpolants [75361#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~first~0.offset main_~last~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 main_~x~0.offset)), 75360#(and (= main_~first~0.offset main_~last~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 main_~x~0.offset)), 75363#(and (not (= main_~first~0.base main_~x~0.base)) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) main_~x~0.base) (= (select |#valid| main_~first~0.base) 1) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 75362#(and (= (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12)) main_~x~0.base) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 75365#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= 20 (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base)) (= main_~last~0.offset 0)), 75364#(and (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base)) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0)), 75367#(and (not (= main_~x~0.base main_~first~0.base)) (= 20 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ 0 12)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) (+ 0 12))) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))), 75366#(and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~last~0.base main_~first~0.base)) (= main_~last~0.offset 0) (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 75369#(and (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) (+ 0 12)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem6.base|) (+ 0 12)))), 75368#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12))) (= 20 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12))))), 75371#(or (and (= 20 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))) (and (or (<= 1 main_~first~0.offset) (<= (+ main_~first~0.offset 1) 0)) (not (= 0 main_~x~1.offset)))), 75370#(or (<= 1 main_~first~0.offset) (and (= 20 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))) (<= (+ main_~first~0.offset 1) 0)), 75373#(or (and (= 20 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)) (not (= 0 main_~x~1.offset))), 75372#(or (not (= 0 main_~x~1.offset)) (and (= 0 |main_#t~mem6.offset|) (= 20 (select |#length| |main_#t~mem6.base|)))), 75374#(and (= 20 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)), 75353#true, 75355#(= 0 |main_#t~malloc1.offset|), 75354#false, 75357#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 75356#(= main_~x~0.offset 0), 75359#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.offset main_~last~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|)), 75358#(and (= main_~first~0.offset main_~last~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1))] [2018-04-11 13:17:52,464 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 26 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:52,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 13:17:52,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 13:17:52,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:17:52,465 INFO L87 Difference]: Start difference. First operand 787 states and 872 transitions. Second operand 22 states. [2018-04-11 13:17:53,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:53,427 INFO L93 Difference]: Finished difference Result 893 states and 983 transitions. [2018-04-11 13:17:53,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 13:17:53,427 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 88 [2018-04-11 13:17:53,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:53,428 INFO L225 Difference]: With dead ends: 893 [2018-04-11 13:17:53,428 INFO L226 Difference]: Without dead ends: 893 [2018-04-11 13:17:53,428 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=274, Invalid=1706, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 13:17:53,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-04-11 13:17:53,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 808. [2018-04-11 13:17:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-04-11 13:17:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 898 transitions. [2018-04-11 13:17:53,433 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 898 transitions. Word has length 88 [2018-04-11 13:17:53,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:53,433 INFO L459 AbstractCegarLoop]: Abstraction has 808 states and 898 transitions. [2018-04-11 13:17:53,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 13:17:53,433 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 898 transitions. [2018-04-11 13:17:53,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-11 13:17:53,433 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:53,433 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:53,433 INFO L408 AbstractCegarLoop]: === Iteration 88 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:53,434 INFO L82 PathProgramCache]: Analyzing trace with hash 207644908, now seen corresponding path program 4 times [2018-04-11 13:17:53,434 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:53,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:53,814 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 23 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:53,814 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:53,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 13:17:53,814 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:53,815 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 13:17:53,815 INFO L182 omatonBuilderFactory]: Interpolants [77127#false, 77126#true, 77129#(= main_~x~0.offset 0), 77128#(= 0 |main_#t~malloc1.offset|), 77131#(and (= main_~first~0.offset main_~last~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 77130#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 77133#(and (= main_~first~0.offset main_~last~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 main_~x~0.offset)), 77132#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.offset main_~last~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|)), 77135#(and (= (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12)) main_~x~0.base) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 77134#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~first~0.offset main_~last~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 main_~x~0.offset)), 77137#(and (= 0 main_~last~0.offset) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base)) (= (select |#valid| main_~last~0.base) 1)), 77136#(and (not (= main_~first~0.base main_~x~0.base)) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) main_~x~0.base) (= (select |#valid| main_~first~0.base) 1) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 77139#(and (not (= main_~x~0.base main_~first~0.base)) (= 0 main_~last~0.offset) (not (= main_~x~0.base main_~last~0.base)) (not (= 0 main_~x~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~last~0.base main_~first~0.base))), 77138#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= 0 main_~last~0.offset) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base)) (not (= 0 |main_#t~malloc1.base|))), 77141#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12)))), 77140#(and (not (= main_~x~0.base main_~first~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ 0 12)))) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))), 77143#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (<= 1 main_~first~0.offset) (<= (+ main_~first~0.offset 1) 0)), 77142#(not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) (+ 0 12)))), 77145#(or (not (= 0 |main_#t~mem6.base|)) (not (= 0 main_~x~1.offset))), 77144#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (and (or (<= 1 main_~first~0.offset) (<= (+ main_~first~0.offset 1) 0)) (not (= 0 main_~x~1.offset)))), 77147#(not (= 0 main_~first~0.base)), 77146#(or (not (= 0 main_~first~0.base)) (not (= 0 main_~x~1.offset)))] [2018-04-11 13:17:53,815 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 23 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:53,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 13:17:53,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 13:17:53,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:17:53,815 INFO L87 Difference]: Start difference. First operand 808 states and 898 transitions. Second operand 22 states. [2018-04-11 13:17:54,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:54,614 INFO L93 Difference]: Finished difference Result 890 states and 979 transitions. [2018-04-11 13:17:54,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 13:17:54,615 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 89 [2018-04-11 13:17:54,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:54,616 INFO L225 Difference]: With dead ends: 890 [2018-04-11 13:17:54,616 INFO L226 Difference]: Without dead ends: 890 [2018-04-11 13:17:54,616 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=317, Invalid=1939, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 13:17:54,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2018-04-11 13:17:54,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 808. [2018-04-11 13:17:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-04-11 13:17:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 896 transitions. [2018-04-11 13:17:54,620 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 896 transitions. Word has length 89 [2018-04-11 13:17:54,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:54,620 INFO L459 AbstractCegarLoop]: Abstraction has 808 states and 896 transitions. [2018-04-11 13:17:54,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 13:17:54,620 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 896 transitions. [2018-04-11 13:17:54,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-04-11 13:17:54,621 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:54,621 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:54,621 INFO L408 AbstractCegarLoop]: === Iteration 89 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:54,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1871951325, now seen corresponding path program 3 times [2018-04-11 13:17:54,621 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:54,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:54,919 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 14 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:54,919 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:54,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 13:17:54,919 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:54,920 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 13:17:54,920 INFO L182 omatonBuilderFactory]: Interpolants [78913#(and (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset)) (= (select |#valid| main_~last~0.base) 1)), 78912#(and (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset))), 78915#(and (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset))), 78914#(and (not (= main_~first~0.base main_~x~0.base)) (= (select |#valid| main_~first~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset))), 78917#(and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset))), 78916#(and (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset))), 78919#(= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset)), 78918#(and (not (= main_~x~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset))), 78921#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset)), 78920#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~x~1.offset)) (= main_~x~1.base main_~first~0.base)), 78923#(= 0 main_~y~1.offset), 78922#(= 0 |main_#t~mem7.offset|), 78924#(= main_~z~0.offset 0), 78903#false, 78902#true, 78905#(= 0 main_~x~0.offset), 78904#(= 0 |main_#t~malloc1.offset|), 78907#(and (= 0 main_~y~0.offset) (= 0 main_~x~0.offset)), 78906#(and (= 0 |main_#t~malloc3.offset|) (= 0 main_~x~0.offset)), 78909#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 78908#(and (= 0 main_~y~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 78911#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset))), 78910#(and (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset)) (= (select |#valid| main_~last~0.base) 1))] [2018-04-11 13:17:54,920 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 14 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:54,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 13:17:54,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 13:17:54,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:17:54,920 INFO L87 Difference]: Start difference. First operand 808 states and 896 transitions. Second operand 23 states. [2018-04-11 13:17:56,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:56,126 INFO L93 Difference]: Finished difference Result 1025 states and 1140 transitions. [2018-04-11 13:17:56,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-11 13:17:56,127 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 90 [2018-04-11 13:17:56,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:56,128 INFO L225 Difference]: With dead ends: 1025 [2018-04-11 13:17:56,128 INFO L226 Difference]: Without dead ends: 1025 [2018-04-11 13:17:56,128 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=765, Invalid=3525, Unknown=0, NotChecked=0, Total=4290 [2018-04-11 13:17:56,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2018-04-11 13:17:56,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 812. [2018-04-11 13:17:56,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2018-04-11 13:17:56,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 900 transitions. [2018-04-11 13:17:56,132 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 900 transitions. Word has length 90 [2018-04-11 13:17:56,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:56,133 INFO L459 AbstractCegarLoop]: Abstraction has 812 states and 900 transitions. [2018-04-11 13:17:56,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 13:17:56,133 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 900 transitions. [2018-04-11 13:17:56,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-04-11 13:17:56,133 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:56,133 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:56,133 INFO L408 AbstractCegarLoop]: === Iteration 90 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:56,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2142046884, now seen corresponding path program 2 times [2018-04-11 13:17:56,134 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:56,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:56,623 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 26 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:56,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:56,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 13:17:56,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:56,624 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 13:17:56,624 INFO L182 omatonBuilderFactory]: Interpolants [80865#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 |main_#t~malloc1.offset|) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base)) (= main_~last~0.offset 0)), 80864#(and (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base)) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0)), 80867#(and (not (= main_~x~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) (+ 0 12))) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))), 80866#(and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~last~0.base main_~first~0.base)) (= main_~last~0.offset 0) (= 0 main_~x~0.offset)), 80869#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem6.base|) (+ 0 12))), 80868#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12))), 80871#(or (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (and (or (<= 1 main_~first~0.offset) (<= (+ main_~first~0.offset 1) 0)) (not (= 0 main_~x~1.offset)))), 80870#(or (<= 1 main_~first~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (<= (+ main_~first~0.offset 1) 0)), 80873#(or (= 0 main_~first~0.offset) (not (= 0 main_~x~1.offset))), 80872#(or (not (= 0 main_~x~1.offset)) (= 0 |main_#t~mem6.offset|)), 80875#(and (= main_~first~0.offset 0) (= main_~first~0.offset main_~x~1.offset) (= main_~x~1.base main_~first~0.base)), 80874#(= 0 main_~first~0.offset), 80876#(and (<= 0 main_~x~1.offset) (<= (+ main_~x~1.offset 16) (select |#length| main_~x~1.base))), 80853#true, 80855#(= 0 |main_#t~malloc1.offset|), 80854#false, 80857#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 80856#(= main_~x~0.offset 0), 80859#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.offset main_~last~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|)), 80858#(and (= main_~first~0.offset main_~last~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 80861#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~first~0.offset main_~last~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 main_~x~0.offset)), 80860#(and (= main_~first~0.offset main_~last~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 main_~x~0.offset)), 80863#(and (not (= main_~first~0.base main_~x~0.base)) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) main_~x~0.base) (= (select |#valid| main_~first~0.base) 1) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 80862#(and (= (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12)) main_~x~0.base) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset))] [2018-04-11 13:17:56,624 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 26 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:56,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 13:17:56,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 13:17:56,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:17:56,625 INFO L87 Difference]: Start difference. First operand 812 states and 900 transitions. Second operand 24 states. [2018-04-11 13:17:57,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:17:57,936 INFO L93 Difference]: Finished difference Result 922 states and 1007 transitions. [2018-04-11 13:17:57,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-11 13:17:57,969 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2018-04-11 13:17:57,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:17:57,970 INFO L225 Difference]: With dead ends: 922 [2018-04-11 13:17:57,970 INFO L226 Difference]: Without dead ends: 922 [2018-04-11 13:17:57,971 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=767, Invalid=3393, Unknown=0, NotChecked=0, Total=4160 [2018-04-11 13:17:57,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2018-04-11 13:17:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 814. [2018-04-11 13:17:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2018-04-11 13:17:57,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 902 transitions. [2018-04-11 13:17:57,977 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 902 transitions. Word has length 90 [2018-04-11 13:17:57,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:17:57,977 INFO L459 AbstractCegarLoop]: Abstraction has 814 states and 902 transitions. [2018-04-11 13:17:57,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 13:17:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 902 transitions. [2018-04-11 13:17:57,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-04-11 13:17:57,978 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:17:57,979 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:17:57,979 INFO L408 AbstractCegarLoop]: === Iteration 91 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:17:57,979 INFO L82 PathProgramCache]: Analyzing trace with hash 115583137, now seen corresponding path program 2 times [2018-04-11 13:17:57,979 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:17:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:17:57,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:17:58,456 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 29 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:58,456 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:17:58,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 13:17:58,456 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:17:58,457 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 13:17:58,457 INFO L182 omatonBuilderFactory]: Interpolants [82701#false, 82700#true, 82703#(= main_~x~0.offset 0), 82702#(= 0 |main_#t~malloc1.offset|), 82705#(and (= (select |#valid| main_~y~0.base) 1) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 82704#(and (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 82707#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~malloc3.base|)) (not (= main_~x~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~x~0.offset)), 82706#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 82709#(and (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (not (= main_~x~0.base main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 82708#(and (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 82711#(and (not (= main_~y~0.base |main_#t~mem5.base|)) (= main_~y~0.offset 0) (= (select |#valid| main_~y~0.base) 1) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (not (= main_~x~0.base main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 82710#(and (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~y~0.base)) (= (select |#valid| main_~y~0.base) 1) (not (= main_~x~0.base main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 82713#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 82712#(and (= main_~y~0.offset 0) (= (select |#valid| main_~y~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 1) (not (= main_~x~0.base main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (not (= main_~y~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= 0 main_~x~0.offset)), 82715#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base |main_#t~malloc1.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0))) (= main_~last~0.base main_~first~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0))) (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) |main_#t~malloc1.base|))), 82714#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 1) (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0))) (= main_~last~0.base main_~first~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0))) (= (select |#valid| main_~last~0.base) 1)), 82717#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0))) (= main_~last~0.base main_~first~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)))), 82716#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0))) (= main_~last~0.base main_~first~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)))), 82719#(and (not (= (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)) 0))) (= main_~x~1.base main_~first~0.base)), 82718#(and (not (= (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)))), 82721#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0))) (not (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0)))), 82720#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0))) (not (= (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)))), 82723#(or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= main_~z~0.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))) (not (= 0 main_~z~0.offset))), 82722#(or (not (= 0 main_~y~1.offset)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= main_~y~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))))), 82725#(or (not (= 0 main_~z~0.offset)) (and (= 1 (select |#valid| main_~y~1.base)) (not (= main_~z~0.base main_~y~1.base)))), 82724#(or (not (= 0 main_~z~0.offset)) (and (= 1 (select |#valid| |main_#t~mem8.base|)) (not (= main_~z~0.base |main_#t~mem8.base|)))), 82727#(= 1 (select |#valid| main_~y~1.base)), 82726#(and (= 1 (select |#valid| main_~y~1.base)) (not (= main_~z~0.base main_~y~1.base)))] [2018-04-11 13:17:58,457 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 29 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:17:58,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 13:17:58,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 13:17:58,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2018-04-11 13:17:58,457 INFO L87 Difference]: Start difference. First operand 814 states and 902 transitions. Second operand 28 states. [2018-04-11 13:18:00,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:18:00,183 INFO L93 Difference]: Finished difference Result 878 states and 978 transitions. [2018-04-11 13:18:00,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-11 13:18:00,183 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 92 [2018-04-11 13:18:00,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:18:00,184 INFO L225 Difference]: With dead ends: 878 [2018-04-11 13:18:00,184 INFO L226 Difference]: Without dead ends: 878 [2018-04-11 13:18:00,184 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1434 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=864, Invalid=5298, Unknown=0, NotChecked=0, Total=6162 [2018-04-11 13:18:00,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-04-11 13:18:00,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 815. [2018-04-11 13:18:00,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2018-04-11 13:18:00,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 904 transitions. [2018-04-11 13:18:00,188 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 904 transitions. Word has length 92 [2018-04-11 13:18:00,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:18:00,188 INFO L459 AbstractCegarLoop]: Abstraction has 815 states and 904 transitions. [2018-04-11 13:18:00,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 13:18:00,188 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 904 transitions. [2018-04-11 13:18:00,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-04-11 13:18:00,189 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:18:00,189 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:18:00,189 INFO L408 AbstractCegarLoop]: === Iteration 92 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:18:00,189 INFO L82 PathProgramCache]: Analyzing trace with hash 115583138, now seen corresponding path program 1 times [2018-04-11 13:18:00,189 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:18:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:18:00,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:18:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 25 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:00,758 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:18:00,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-11 13:18:00,759 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:18:00,759 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 13:18:00,759 INFO L182 omatonBuilderFactory]: Interpolants [84545#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (= main_~last~0.base main_~first~0.base)), 84544#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (= main_~last~0.base main_~first~0.base)), 84547#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)) 0)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)) 0))) (= main_~x~1.base main_~first~0.base)), 84546#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)))), 84549#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) 0))), 84548#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)))), 84551#(and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (not (= 0 main_~z~0.offset))) (or (not (= 0 main_~z~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))))), 84550#(and (or (not (= 0 main_~y~1.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))) (or (not (= 0 main_~y~1.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)))), 84553#(and (or (<= 8 (select |#length| main_~y~1.base)) (not (= 0 main_~z~0.offset))) (or (not (= 0 main_~z~0.offset)) (= main_~y~1.offset 0))), 84552#(and (or (not (= 0 main_~z~0.offset)) (= 0 |main_#t~mem8.offset|)) (or (not (= 0 main_~z~0.offset)) (<= 8 (select |#length| |main_#t~mem8.base|)))), 84554#(and (<= 8 (select |#length| main_~y~1.base)) (= main_~y~1.offset 0)), 84527#false, 84526#true, 84529#(= main_~x~0.offset 0), 84528#(= 0 |main_#t~malloc1.offset|), 84531#(and (= 0 main_~y~0.offset) (= 0 main_~x~0.offset)), 84530#(and (= 0 |main_#t~malloc3.offset|) (= 0 main_~x~0.offset)), 84533#(and (= (select |#valid| main_~y~0.base) 1) (= 0 main_~y~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 84532#(and (= 0 main_~y~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 84535#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~malloc3.base|)) (not (= main_~x~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 84534#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 84537#(and (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 |main_#t~mem4.offset|) (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (not (= main_~x~0.base main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 84536#(and (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (not (= main_~x~0.base main_~y~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 84539#(and (not (= main_~y~0.base |main_#t~mem5.base|)) (= main_~y~0.offset 0) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (= (select |#valid| main_~y~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset)) (= |main_#t~mem5.offset| 0) (not (= main_~x~0.base main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 84538#(and (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~y~0.base)) (= (select |#valid| main_~y~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset)) (not (= main_~x~0.base main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 84541#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) 1) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 84540#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= main_~y~0.offset 0) (= (select |#valid| main_~y~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 1) (not (= main_~x~0.base main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 84543#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base |main_#t~malloc1.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (= main_~last~0.base main_~first~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) |main_#t~malloc1.base|))), 84542#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) 1) (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 1) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1))] [2018-04-11 13:18:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 25 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:00,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 13:18:00,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 13:18:00,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2018-04-11 13:18:00,759 INFO L87 Difference]: Start difference. First operand 815 states and 904 transitions. Second operand 29 states. [2018-04-11 13:18:01,757 WARN L148 SmtUtils]: Spent 103ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-11 13:18:03,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:18:03,299 INFO L93 Difference]: Finished difference Result 971 states and 1079 transitions. [2018-04-11 13:18:03,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-11 13:18:03,300 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 92 [2018-04-11 13:18:03,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:18:03,300 INFO L225 Difference]: With dead ends: 971 [2018-04-11 13:18:03,300 INFO L226 Difference]: Without dead ends: 971 [2018-04-11 13:18:03,301 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1920 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1302, Invalid=6354, Unknown=0, NotChecked=0, Total=7656 [2018-04-11 13:18:03,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-04-11 13:18:03,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 815. [2018-04-11 13:18:03,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2018-04-11 13:18:03,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 903 transitions. [2018-04-11 13:18:03,307 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 903 transitions. Word has length 92 [2018-04-11 13:18:03,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:18:03,307 INFO L459 AbstractCegarLoop]: Abstraction has 815 states and 903 transitions. [2018-04-11 13:18:03,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 13:18:03,308 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 903 transitions. [2018-04-11 13:18:03,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-04-11 13:18:03,308 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:18:03,309 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:18:03,309 INFO L408 AbstractCegarLoop]: === Iteration 93 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:18:03,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1729649825, now seen corresponding path program 3 times [2018-04-11 13:18:03,309 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:18:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:18:03,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:18:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:04,390 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:18:04,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-11 13:18:04,391 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:18:04,391 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 13:18:04,391 INFO L182 omatonBuilderFactory]: Interpolants [86465#(= 0 |main_#t~malloc1.offset|), 86464#false, 86467#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 86466#(= 0 main_~x~0.offset), 86469#(and (not (= |main_#t~malloc3.base| main_~x~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~x~0.offset)), 86468#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 86471#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~y~0.offset 0) (= |main_#t~mem4.base| main_~x~0.base) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 86470#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~y~0.offset 0) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 86473#(and (= 1 (select |#valid| main_~y~0.base)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~y~0.base |main_#t~mem5.base|)) (= main_~y~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~x~0.base) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 86472#(and (= main_~y~0.offset 0) (= 1 (select |#valid| main_~x~0.base)) (= (select |#valid| main_~y~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~x~0.base) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 86475#(and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 1 (select |#valid| main_~last~0.base))), 86474#(and (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) main_~x~0.base) (= 0 main_~x~0.offset)), 86477#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= main_~first~0.base main_~last~0.base) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (not (= main_~last~0.base main_~x~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0))), 86476#(and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= |main_#t~malloc1.base| main_~last~0.base)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= 0 main_~first~0.offset) (not (= |main_#t~malloc1.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= main_~last~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (= main_~last~0.base main_~first~0.base)), 86479#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) |main_#t~malloc3.base|)) (or (= 12 (select |#length| main_~first~0.base)) (not (= main_~last~0.base |main_#t~malloc3.base|))) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= 0 main_~first~0.offset) (= main_~last~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base)), 86478#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~first~0.base main_~last~0.base) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (= 0 main_~first~0.offset)), 86481#(and (not (= main_~last~0.base main_~x~0.base)) (or (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)) (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (not (= main_~last~0.base |main_#t~mem4.base|)) (= 0 main_~first~0.offset) (= main_~last~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (= main_~last~0.base main_~first~0.base) (not (= main_~y~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~y~0.base main_~last~0.base))))), 86480#(and (or (and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= 0 main_~first~0.offset) (= main_~last~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (= main_~last~0.base main_~first~0.base) (not (= main_~y~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~y~0.base main_~last~0.base))) (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset))) (not (= main_~last~0.base main_~x~0.base))), 86483#(and (or (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= |main_#t~mem5.base| main_~last~0.base)) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= 0 main_~first~0.offset) (= main_~last~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (= main_~last~0.base main_~first~0.base) (not (= main_~y~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~y~0.base main_~last~0.base))) (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset))) (not (= main_~last~0.base main_~x~0.base))), 86482#(and (or (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)) (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= 0 main_~first~0.offset) (= main_~last~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (= main_~last~0.base main_~first~0.base) (not (= main_~y~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (not (= main_~y~0.base main_~last~0.base)))) (not (= main_~last~0.base main_~x~0.base))), 86485#(and (or (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)) (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= 0 main_~first~0.offset) (= main_~last~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (= main_~last~0.base main_~first~0.base))) (not (= main_~last~0.base main_~x~0.base))), 86484#(and (or (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= 0 main_~first~0.offset) (= main_~last~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (= main_~last~0.base main_~first~0.base) (not (= main_~y~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~y~0.base main_~last~0.base))) (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset))) (not (= main_~last~0.base main_~x~0.base))), 86487#(or (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base))) (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) (= 0 main_~first~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0))))), 86486#(and (or (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= 0 main_~first~0.offset) (= main_~last~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (= main_~last~0.base main_~first~0.base) (= 1 (select |#valid| main_~last~0.base))) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))) (not (= main_~last~0.base main_~x~0.base))), 86489#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0))) (= main_~x~1.offset 0)), 86488#(or (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base))) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)) 0))) (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)) 0)) (= main_~x~1.base main_~first~0.base) (= main_~x~1.offset 0))), 86491#(or (not (= 0 main_~y~1.offset)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) (= main_~x~1.offset 0))), 86490#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0))) (= main_~x~1.base (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0)) (= main_~x~1.offset 0)), 86493#(or (not (= 0 main_~z~0.offset)) (and (= 1 (select |#valid| |main_#t~mem8.base|)) (not (= main_~z~0.base |main_#t~mem8.base|)))), 86492#(or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= main_~z~0.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))) (not (= 0 main_~z~0.offset))), 86495#(and (= 1 (select |#valid| main_~y~1.base)) (not (= main_~z~0.base main_~y~1.base))), 86494#(or (not (= 0 main_~z~0.offset)) (and (= 1 (select |#valid| main_~y~1.base)) (not (= main_~z~0.base main_~y~1.base)))), 86496#(= 1 (select |#valid| main_~y~1.base)), 86463#true] [2018-04-11 13:18:04,391 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:04,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-11 13:18:04,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-11 13:18:04,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 13:18:04,391 INFO L87 Difference]: Start difference. First operand 815 states and 903 transitions. Second operand 34 states. [2018-04-11 13:18:07,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:18:07,841 INFO L93 Difference]: Finished difference Result 973 states and 1080 transitions. [2018-04-11 13:18:07,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-11 13:18:07,842 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 92 [2018-04-11 13:18:07,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:18:07,842 INFO L225 Difference]: With dead ends: 973 [2018-04-11 13:18:07,842 INFO L226 Difference]: Without dead ends: 973 [2018-04-11 13:18:07,843 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=898, Invalid=7112, Unknown=0, NotChecked=0, Total=8010 [2018-04-11 13:18:07,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2018-04-11 13:18:07,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 854. [2018-04-11 13:18:07,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2018-04-11 13:18:07,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 947 transitions. [2018-04-11 13:18:07,848 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 947 transitions. Word has length 92 [2018-04-11 13:18:07,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:18:07,848 INFO L459 AbstractCegarLoop]: Abstraction has 854 states and 947 transitions. [2018-04-11 13:18:07,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-11 13:18:07,848 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 947 transitions. [2018-04-11 13:18:07,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-04-11 13:18:07,848 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:18:07,849 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:18:07,849 INFO L408 AbstractCegarLoop]: === Iteration 94 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:18:07,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1729649826, now seen corresponding path program 2 times [2018-04-11 13:18:07,849 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:18:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:18:07,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:18:09,036 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:09,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:18:09,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-11 13:18:09,036 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:18:09,037 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 13:18:09,037 INFO L182 omatonBuilderFactory]: Interpolants [88449#(and (= (select |#valid| main_~y~0.base) 1) (or (= main_~x~0.base main_~y~0.base) (and (= main_~y~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 88448#(and (or (and (= main_~y~0.offset 0) (= |main_#t~mem4.offset| main_~x~0.offset)) (= main_~x~0.base main_~y~0.base)) (= main_~x~0.base |main_#t~mem4.base|) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 88451#(and (= (select |#valid| main_~y~0.base) 1) (or (and (= main_~y~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= main_~x~0.base main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 88450#(and (or (not (= main_~y~0.base |main_#t~mem5.base|)) (= main_~x~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~y~0.base) 1) (or (and (= main_~y~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= main_~x~0.base main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 88453#(and (or (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 1) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 88452#(and (or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) main_~x~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 88455#(and (or (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) main_~x~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 1) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (not (= main_~last~0.base main_~x~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base)), 88454#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 1) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) |main_#t~malloc1.base|))) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)))), 88457#(and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (= 12 (select |#length| main_~first~0.base)) (not (= main_~last~0.base |main_#t~malloc3.base|))) (or (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) |main_#t~malloc3.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0))) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (not (= main_~last~0.base main_~x~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base)), 88456#(and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= 0 main_~first~0.offset) (or (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 1) (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)))) (= main_~last~0.base main_~first~0.base)), 88459#(and (or (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)) (and (or (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (not (= main_~y~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) |main_#t~mem4.base|)))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (not (= main_~last~0.base |main_#t~mem4.base|)) (= 0 main_~first~0.offset) (not (= main_~y~0.base main_~last~0.base)))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base)), 88458#(and (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (or (and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (or (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (not (= main_~y~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))))) (= 0 main_~first~0.offset) (not (= main_~y~0.base main_~last~0.base))) (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)))), 88461#(and (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (or (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)) (and (not (= |main_#t~mem5.base| main_~last~0.base)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= 0 main_~first~0.offset) (or (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (not (= main_~y~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))))) (not (= main_~y~0.base main_~last~0.base))))), 88460#(and (or (and (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= 0 main_~first~0.offset) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (or (and (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (not (= main_~y~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)))) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~y~0.base main_~last~0.base))) (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base)), 88463#(and (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (or (and (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= 0 main_~first~0.offset) (or (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0))))) (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)))), 88462#(and (or (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)) (and (or (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (not (= main_~y~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)))) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= 0 main_~first~0.offset) (not (= main_~y~0.base main_~last~0.base)))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base)), 88465#(or (and (= 0 main_~first~0.offset) (or (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)))) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))), 88464#(and (or (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base))) (and (= 0 main_~first~0.offset) (or (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)))))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base)), 88467#(and (= main_~x~1.offset 0) (or (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0))))), 88466#(or (and (= main_~x~1.base main_~first~0.base) (= main_~x~1.offset 0) (or (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)) 0)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)) 0))) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)))) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))), 88469#(and (= main_~x~1.offset 0) (or (not (= 0 main_~y~1.offset)) (= main_~y~1.base main_~x~1.base) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))))), 88468#(and (= main_~x~1.offset 0) (or (= main_~x~1.base |main_#t~mem7.base|) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) 0)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0))))), 88471#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset |main_#t~mem8.offset|) (= main_~x~1.base |main_#t~mem8.base|))), 88470#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))), 88473#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base)), 88472#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base))), 88441#true, 88443#(= 0 |main_#t~malloc1.offset|), 88442#false, 88445#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 88444#(= 0 main_~x~0.offset), 88447#(and (or (= main_~x~0.base main_~y~0.base) (and (= main_~y~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 88446#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~x~0.offset))] [2018-04-11 13:18:09,037 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:09,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 13:18:09,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 13:18:09,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 13:18:09,037 INFO L87 Difference]: Start difference. First operand 854 states and 947 transitions. Second operand 33 states. [2018-04-11 13:18:10,332 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 101 DAG size of output 74 [2018-04-11 13:18:10,536 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 115 DAG size of output 79 [2018-04-11 13:18:13,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:18:13,169 INFO L93 Difference]: Finished difference Result 1020 states and 1129 transitions. [2018-04-11 13:18:13,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-11 13:18:13,169 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 92 [2018-04-11 13:18:13,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:18:13,170 INFO L225 Difference]: With dead ends: 1020 [2018-04-11 13:18:13,170 INFO L226 Difference]: Without dead ends: 1020 [2018-04-11 13:18:13,170 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2178 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1068, Invalid=7862, Unknown=0, NotChecked=0, Total=8930 [2018-04-11 13:18:13,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2018-04-11 13:18:13,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 853. [2018-04-11 13:18:13,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2018-04-11 13:18:13,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 944 transitions. [2018-04-11 13:18:13,174 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 944 transitions. Word has length 92 [2018-04-11 13:18:13,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:18:13,174 INFO L459 AbstractCegarLoop]: Abstraction has 853 states and 944 transitions. [2018-04-11 13:18:13,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 13:18:13,174 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 944 transitions. [2018-04-11 13:18:13,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-04-11 13:18:13,175 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:18:13,175 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:18:13,175 INFO L408 AbstractCegarLoop]: === Iteration 95 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:18:13,175 INFO L82 PathProgramCache]: Analyzing trace with hash 63311380, now seen corresponding path program 2 times [2018-04-11 13:18:13,175 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:18:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:18:13,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:18:14,302 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 14 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:14,302 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:18:14,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-11 13:18:14,302 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:18:14,302 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 13:18:14,302 INFO L182 omatonBuilderFactory]: Interpolants [90497#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12)))) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0)), 90496#(and (not (= main_~x~0.base main_~last~0.base)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= main_~last~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16)))) (= (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12))) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset)), 90499#(or (and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) (+ 0 12))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem6.base|) (+ 0 12)))) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) 0))), 90498#(or (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12)))) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0))), 90501#(or (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= 0 main_~x~1.offset))), 90500#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (<= 1 main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) 0)) (<= (+ main_~first~0.offset 1) 0)), 90503#(or (and (= main_~first~0.base 0) (= 0 main_~first~0.offset)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (not (= 0 main_~x~1.offset))), 90502#(or (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (not (= 0 main_~x~1.offset)) (and (= 0 |main_#t~mem6.base|) (= 0 |main_#t~mem6.offset|))), 90505#(or (and (= main_~first~0.base 0) (= 0 main_~first~0.offset)) (not (= 0 main_~x~1.offset)) (= main_~y~1.base main_~x~1.base)), 90504#(or (and (= main_~first~0.base 0) (= 0 main_~first~0.offset)) (= main_~x~1.base |main_#t~mem7.base|) (not (= 0 main_~x~1.offset))), 90507#(or (and (= main_~first~0.base 0) (= 0 main_~first~0.offset)) (not (= 0 main_~x~1.offset))), 90506#(or (and (= main_~first~0.base 0) (= 0 main_~first~0.offset)) (not (= main_~x~1.offset main_~z~0.offset)) (not (= 0 main_~x~1.offset))), 90508#(and (= main_~first~0.base 0) (= 0 main_~first~0.offset)), 90479#false, 90478#true, 90481#(= main_~x~0.offset 0), 90480#(= 0 |main_#t~malloc1.offset|), 90483#(and (= main_~last~0.base main_~first~0.base) (= 1 (select |#valid| main_~last~0.base)) (= main_~last~0.offset 0) (= main_~last~0.offset main_~first~0.offset)), 90482#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 90485#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0) (= main_~last~0.offset main_~first~0.offset)), 90484#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset 0) (= main_~last~0.offset main_~first~0.offset)), 90487#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (not (= main_~x~0.base main_~last~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16)) main_~last~0.offset)), 90486#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (not (= main_~x~0.base main_~last~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0) (= main_~last~0.offset main_~first~0.offset)), 90489#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (not (= main_~x~0.base main_~last~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~malloc3.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~last~0.offset main_~first~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16)) main_~last~0.offset)), 90488#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (not (= main_~x~0.base main_~last~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= main_~x~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~last~0.offset main_~first~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16)) main_~last~0.offset)), 90491#(and (or (= main_~x~0.base main_~y~0.base) (and (= main_~x~0.base |main_#t~mem4.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16)) main_~last~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~y~0.offset))) (= 0 |main_#t~mem4.offset|) (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset)), 90490#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (or (= main_~x~0.base main_~y~0.base) (and (= main_~y~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16)) main_~last~0.offset))) (= main_~last~0.offset main_~first~0.offset)), 90493#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= |main_#t~mem5.offset| 0) (= main_~last~0.offset main_~first~0.offset) (or (= main_~x~0.base main_~y~0.base) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= main_~x~0.base |main_#t~mem5.base|) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16)) main_~last~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~y~0.offset)))), 90492#(and (or (= main_~x~0.base main_~y~0.base) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16)) main_~last~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~y~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset)), 90495#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= main_~last~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16)))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset)), 90494#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (or (= main_~x~0.base main_~y~0.base) (and (= main_~y~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16)) main_~last~0.offset))))] [2018-04-11 13:18:14,302 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 14 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:14,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 13:18:14,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 13:18:14,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=832, Unknown=0, NotChecked=0, Total=930 [2018-04-11 13:18:14,303 INFO L87 Difference]: Start difference. First operand 853 states and 944 transitions. Second operand 31 states. [2018-04-11 13:18:16,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:18:16,445 INFO L93 Difference]: Finished difference Result 914 states and 1011 transitions. [2018-04-11 13:18:16,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-11 13:18:16,445 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 92 [2018-04-11 13:18:16,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:18:16,446 INFO L225 Difference]: With dead ends: 914 [2018-04-11 13:18:16,446 INFO L226 Difference]: Without dead ends: 914 [2018-04-11 13:18:16,446 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=764, Invalid=5088, Unknown=0, NotChecked=0, Total=5852 [2018-04-11 13:18:16,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2018-04-11 13:18:16,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 853. [2018-04-11 13:18:16,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2018-04-11 13:18:16,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 944 transitions. [2018-04-11 13:18:16,451 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 944 transitions. Word has length 92 [2018-04-11 13:18:16,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:18:16,451 INFO L459 AbstractCegarLoop]: Abstraction has 853 states and 944 transitions. [2018-04-11 13:18:16,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 13:18:16,451 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 944 transitions. [2018-04-11 13:18:16,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-11 13:18:16,451 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:18:16,451 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:18:16,451 INFO L408 AbstractCegarLoop]: === Iteration 96 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:18:16,452 INFO L82 PathProgramCache]: Analyzing trace with hash -614055192, now seen corresponding path program 1 times [2018-04-11 13:18:16,452 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:18:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:18:16,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:18:17,643 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:17,643 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:18:17,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 13:18:17,644 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:18:17,644 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 13:18:17,644 INFO L182 omatonBuilderFactory]: Interpolants [92371#true, 92373#(= |#valid| |old(#valid)|), 92372#false, 92375#(and (= main_~x~0.offset 0) (= (store |#valid| main_~x~0.base 0) |old(#valid)|)), 92374#(and (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0)) (= 0 |main_#t~malloc1.offset|)), 92377#(and (= 12 (select |#length| main_~y~0.base)) (or (and (= main_~x~0.base main_~y~0.base) (= 0 main_~x~0.offset)) (and (= |old(#valid)| (store (store |#valid| main_~x~0.base 0) main_~y~0.base 0)) (= 0 main_~x~0.offset)))), 92376#(and (= main_~x~0.offset 0) (or (= main_~x~0.base |main_#t~malloc3.base|) (= (store (store |#valid| main_~x~0.base 0) |main_#t~malloc3.base| 0) |old(#valid)|)) (= 12 (select |#length| |main_#t~malloc3.base|))), 92379#(and (= (+ main_~x~0.offset 12) (select |#length| main_~y~0.base)) (or (= main_~x~0.base main_~y~0.base) (and (= |old(#valid)| (store (store |#valid| main_~x~0.base 0) main_~y~0.base 0)) (= (select |#valid| main_~y~0.base) 1))) (= main_~x~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 92378#(and (= 12 (select |#length| main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (or (and (= main_~x~0.base main_~y~0.base) (= 0 main_~x~0.offset)) (and (= |old(#valid)| (store (store |#valid| main_~x~0.base 0) main_~y~0.base 0)) (= 0 main_~x~0.offset)))), 92381#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (or (and (= (store (store |#valid| main_~first~0.base 0) (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) 0) |old(#valid)|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= main_~last~0.offset main_~first~0.offset)) (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset))) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 92380#(and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (store (store |#valid| main_~x~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) |old(#valid)|)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 92383#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (or (and (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) main_~x~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (store (store (store |#valid| main_~first~0.base 0) main_~x~0.base 0) (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) 0) |old(#valid)|) (= main_~last~0.offset main_~first~0.offset)) (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base main_~first~0.base)), 92382#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base |main_#t~malloc1.base|)) (or (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset)) (and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (store (store (store |#valid| main_~first~0.base 0) |main_#t~malloc1.base| 0) (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) 0) |old(#valid)|) (= main_~last~0.offset main_~first~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) |main_#t~malloc1.base|)))) (= main_~last~0.base main_~first~0.base)), 92385#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset) (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= (store (store (store |#valid| main_~first~0.base 0) (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) 0) (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset) 0) |old(#valid)|)) (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset))), 92384#(and (not (= main_~x~0.base main_~last~0.base)) (or (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~first~0.offset 12)) main_~first~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~first~0.offset 12)))) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= main_~last~0.offset main_~first~0.offset) (= |old(#valid)| (store (store (store |#valid| main_~first~0.base 0) (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12)) 0) (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) 0)))) (= main_~last~0.base main_~first~0.base)), 92387#(or (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset 0)) (and (not (= (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset) |main_#t~mem6.base|)) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))) (= |old(#valid)| (store (store (store |#valid| main_~x~1.base 0) |main_#t~mem6.base| 0) (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset) 0)) (not (= |main_#t~mem6.base| main_~x~1.base)))), 92386#(and (or (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)) (= main_~x~1.offset 0)) (and (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset) (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) main_~x~1.base)) (= (store (store (store |#valid| main_~x~1.base 0) (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) 0) (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset) 0) |old(#valid)|))) (= main_~x~1.base main_~first~0.base)), 92389#(or (and (= (store (store (store |#valid| main_~x~1.base 0) main_~first~0.base 0) |main_#t~mem7.base| 0) |old(#valid)|) (not (= |main_#t~mem7.base| main_~first~0.base)) (not (= main_~first~0.base main_~x~1.base)) (not (= main_~x~1.base |main_#t~mem7.base|))) (and (= main_~x~1.base |main_#t~mem7.base|) (= main_~x~1.offset 0))), 92388#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset) main_~first~0.base)) (= (store (store (store |#valid| main_~x~1.base 0) main_~first~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset) 0) |old(#valid)|) (not (= main_~first~0.base main_~x~1.base)) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)))) (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset 0))), 92391#(or (not (= 0 main_~z~0.offset)) (and (not (= main_~first~0.base main_~x~1.base)) (= (store (store (store |#valid| main_~x~1.base 0) main_~first~0.base 0) main_~z~0.base 0) |old(#valid)|) (not (= main_~z~0.base main_~x~1.base)) (not (= main_~z~0.base main_~first~0.base)))), 92390#(or (and (not (= main_~y~1.base main_~first~0.base)) (= (store (store (store |#valid| main_~x~1.base 0) main_~first~0.base 0) main_~y~1.base 0) |old(#valid)|) (not (= main_~first~0.base main_~x~1.base)) (not (= main_~x~1.base main_~y~1.base))) (and (= main_~y~1.base main_~x~1.base) (= main_~x~1.offset 0))), 92393#(and (not (= main_~first~0.base main_~x~1.base)) (= (store (store |#valid| main_~first~0.base 0) main_~x~1.base 0) |old(#valid)|)), 92392#(and (not (= main_~first~0.base main_~x~1.base)) (= (store (store (store |#valid| main_~x~1.base 0) main_~first~0.base 0) main_~z~0.base 0) |old(#valid)|) (not (= main_~z~0.base main_~x~1.base)) (not (= main_~z~0.base main_~first~0.base))), 92395#(= |old(#valid)| (store |#valid| main_~x~1.base 0)), 92394#(= (store |#valid| main_~first~0.base 0) |old(#valid)|)] [2018-04-11 13:18:17,644 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:17,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 13:18:17,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 13:18:17,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=548, Unknown=0, NotChecked=0, Total=600 [2018-04-11 13:18:17,644 INFO L87 Difference]: Start difference. First operand 853 states and 944 transitions. Second operand 25 states. [2018-04-11 13:18:19,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:18:19,217 INFO L93 Difference]: Finished difference Result 872 states and 962 transitions. [2018-04-11 13:18:19,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 13:18:19,218 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 93 [2018-04-11 13:18:19,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:18:19,218 INFO L225 Difference]: With dead ends: 872 [2018-04-11 13:18:19,218 INFO L226 Difference]: Without dead ends: 839 [2018-04-11 13:18:19,218 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 15 SyntacticMatches, 17 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=192, Invalid=2064, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 13:18:19,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-04-11 13:18:19,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 838. [2018-04-11 13:18:19,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-04-11 13:18:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 928 transitions. [2018-04-11 13:18:19,222 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 928 transitions. Word has length 93 [2018-04-11 13:18:19,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:18:19,222 INFO L459 AbstractCegarLoop]: Abstraction has 838 states and 928 transitions. [2018-04-11 13:18:19,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 13:18:19,222 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 928 transitions. [2018-04-11 13:18:19,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-11 13:18:19,222 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:18:19,223 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:18:19,223 INFO L408 AbstractCegarLoop]: === Iteration 97 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:18:19,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1962652154, now seen corresponding path program 2 times [2018-04-11 13:18:19,223 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:18:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:18:19,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:18:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:20,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:18:20,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-11 13:18:20,683 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:18:20,683 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 13:18:20,683 INFO L182 omatonBuilderFactory]: Interpolants [94153#false, 94152#true, 94155#(and (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0)) (= 0 |main_#t~malloc1.offset|)), 94154#(= |#valid| |old(#valid)|), 94157#(and (= 1 (select |#valid| main_~x~0.base)) (= (store |#valid| main_~x~0.base 0) |old(#valid)|) (= 0 main_~x~0.offset)), 94156#(and (= (store |#valid| main_~x~0.base 0) |old(#valid)|) (= 0 main_~x~0.offset)), 94159#(and (= (store (store |#valid| |main_#t~malloc1.base| 0) main_~first~0.base 0) |old(#valid)|) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (not (= main_~first~0.base |main_#t~malloc1.base|)) (= main_~last~0.offset main_~first~0.offset) (= main_~last~0.offset 0)), 94158#(and (= (store |#valid| main_~first~0.base 0) |old(#valid)|) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset) (= main_~last~0.offset 0)), 94161#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.offset 0) (= (store (store |#valid| main_~x~0.base 0) main_~first~0.base 0) |old(#valid)|) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= main_~last~0.offset 0)), 94160#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.offset 0) (= (store (store |#valid| main_~x~0.base 0) main_~first~0.base 0) |old(#valid)|) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= main_~last~0.offset 0)), 94163#(and (or (and (= main_~first~0.base main_~last~0.base) (= 12 (select |#length| main_~first~0.base))) (and (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (or (= main_~x~0.base main_~y~0.base) (and (not (= main_~first~0.base main_~y~0.base)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= (store (store (store |#valid| main_~x~0.base 0) main_~y~0.base 0) main_~first~0.base 0) |old(#valid)|))) (= main_~last~0.offset main_~first~0.offset))) (= main_~last~0.offset 0)), 94162#(and (or (and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= |old(#valid)| (store (store (store |#valid| main_~x~0.base 0) |main_#t~malloc3.base| 0) main_~first~0.base 0)) (= 12 (select |#length| |main_#t~malloc3.base|))) (= main_~x~0.base |main_#t~malloc3.base|) (and (= main_~first~0.base |main_#t~malloc3.base|) (= 12 (select |#length| |main_#t~malloc3.base|)))) (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= main_~last~0.offset 0)), 94165#(and (or (and (= main_~first~0.base main_~last~0.base) (= 12 (select |#length| main_~first~0.base))) (and (or (= main_~x~0.base main_~y~0.base) (and (not (= main_~first~0.base main_~y~0.base)) (= (store (store (store |#valid| main_~x~0.base 0) main_~y~0.base 0) main_~first~0.base 0) |old(#valid)|) (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~x~0.base))) (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset))) (= main_~last~0.offset 0)), 94164#(and (or (and (= main_~first~0.base main_~last~0.base) (= 12 (select |#length| main_~first~0.base))) (and (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (or (= main_~x~0.base main_~y~0.base) (and (not (= main_~first~0.base main_~y~0.base)) (= |main_#t~mem4.base| main_~x~0.base) (= (store (store (store |#valid| main_~x~0.base 0) main_~y~0.base 0) main_~first~0.base 0) |old(#valid)|))) (= main_~last~0.offset main_~first~0.offset))) (= main_~last~0.offset 0)), 94167#(and (or (and (= main_~first~0.base main_~last~0.base) (= 12 (select |#length| main_~first~0.base))) (and (not (= main_~x~0.base main_~last~0.base)) (or (and (= (store (store (store |#valid| main_~x~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) main_~first~0.base 0) |old(#valid)|) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset))) (= main_~last~0.offset 0)), 94166#(and (or (and (= main_~first~0.base main_~last~0.base) (= 12 (select |#length| main_~first~0.base))) (and (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.offset 0) (or (= main_~x~0.base main_~y~0.base) (and (not (= main_~first~0.base main_~y~0.base)) (= (store (store (store |#valid| main_~x~0.base 0) main_~y~0.base 0) main_~first~0.base 0) |old(#valid)|))) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset))) (= main_~last~0.offset 0)), 94169#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= main_~x~0.offset 0) (or (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) main_~first~0.base 0) |old(#valid)|)))), 94168#(and (or (= (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12)) 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) main_~first~0.base 0) |old(#valid)|))) (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12))) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= main_~last~0.offset 0)), 94171#(or (and (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= |old(#valid)| (store (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0) 0) main_~x~1.base 0)) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0)))) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0))), 94170#(or (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0)) (and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0))) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0) 0) main_~first~0.base 0) |old(#valid)|))), 94173#(or (and (= |old(#valid)| (store (store (store |#valid| main_~first~0.base 0) (select (select |#memory_$Pointer$.base| main_~first~0.base) 0) 0) main_~x~1.base 0)) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) 0))) (not (= main_~x~1.base main_~first~0.base))) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) 0))), 94172#(or (and (= (store (store (store |#valid| |main_#t~mem6.base| 0) (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) 0) 0) main_~x~1.base 0) |old(#valid)|) (not (= main_~x~1.base |main_#t~mem6.base|)) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) 0)))) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) 0))), 94175#(or (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset) 0) main_~x~1.base 0) |old(#valid)|) (not (= 0 main_~x~1.offset))), 94174#(or (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) 0) 0) main_~first~0.base 0)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) 0))), 94177#(or (= |old(#valid)| (store (store |#valid| main_~y~1.base 0) main_~x~1.base 0)) (not (= 0 main_~x~1.offset)) (= main_~y~1.base main_~x~1.base)), 94176#(or (= main_~x~1.base |main_#t~mem7.base|) (= (store (store |#valid| |main_#t~mem7.base| 0) main_~x~1.base 0) |old(#valid)|) (not (= 0 main_~x~1.offset))), 94179#(or (and (not (= main_~z~0.base main_~x~1.base)) (= (store (store |#valid| main_~z~0.base 0) main_~x~1.base 0) |old(#valid)|)) (not (= 0 main_~x~1.offset))), 94178#(or (not (= main_~x~1.offset main_~z~0.offset)) (and (not (= main_~z~0.base main_~x~1.base)) (= (store (store |#valid| main_~z~0.base 0) main_~x~1.base 0) |old(#valid)|)) (not (= 0 main_~x~1.offset))), 94181#(= |old(#valid)| (store |#valid| main_~x~1.base 0)), 94180#(or (= |old(#valid)| (store |#valid| main_~x~1.base 0)) (not (= 0 main_~x~1.offset)))] [2018-04-11 13:18:20,683 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:20,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 13:18:20,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 13:18:20,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=801, Unknown=0, NotChecked=0, Total=870 [2018-04-11 13:18:20,684 INFO L87 Difference]: Start difference. First operand 838 states and 928 transitions. Second operand 30 states. [2018-04-11 13:18:22,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:18:22,632 INFO L93 Difference]: Finished difference Result 863 states and 952 transitions. [2018-04-11 13:18:22,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-11 13:18:22,632 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 93 [2018-04-11 13:18:22,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:18:22,633 INFO L225 Difference]: With dead ends: 863 [2018-04-11 13:18:22,633 INFO L226 Difference]: Without dead ends: 830 [2018-04-11 13:18:22,633 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=265, Invalid=2927, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 13:18:22,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2018-04-11 13:18:22,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2018-04-11 13:18:22,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-04-11 13:18:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 919 transitions. [2018-04-11 13:18:22,636 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 919 transitions. Word has length 93 [2018-04-11 13:18:22,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:18:22,636 INFO L459 AbstractCegarLoop]: Abstraction has 830 states and 919 transitions. [2018-04-11 13:18:22,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 13:18:22,636 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 919 transitions. [2018-04-11 13:18:22,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-11 13:18:22,637 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:18:22,637 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-11 13:18:22,637 INFO L408 AbstractCegarLoop]: === Iteration 98 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:18:22,637 INFO L82 PathProgramCache]: Analyzing trace with hash -462157882, now seen corresponding path program 2 times [2018-04-11 13:18:22,638 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:18:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:18:22,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:18:23,131 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 11 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:23,132 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:18:23,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 13:18:23,132 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:18:23,132 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 13:18:23,132 INFO L182 omatonBuilderFactory]: Interpolants [95937#(and (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12)) main_~x~0.base) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 95936#(and (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset)), 95939#(and (= main_~first~0.offset 0) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~first~0.base) 1) (not (= main_~first~0.base main_~last~0.base))), 95938#(and (not (= main_~first~0.base main_~x~0.base)) (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) main_~x~0.base) (= (select |#valid| main_~first~0.base) 1)), 95941#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~first~0.base main_~last~0.base))), 95940#(and (= main_~first~0.offset 0) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~first~0.base main_~last~0.base))), 95943#(and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (or (not (= main_~first~0.base |main_#t~malloc3.base|)) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))) (not (= main_~first~0.base main_~last~0.base))), 95942#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~first~0.base main_~last~0.base))), 95945#(or (and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base |main_#t~mem4.base|)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~y~0.base main_~first~0.base)) (not (= main_~first~0.base main_~last~0.base))) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))), 95944#(or (and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~y~0.base main_~first~0.base)) (not (= main_~first~0.base main_~last~0.base))) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))), 95947#(or (and (not (= main_~x~0.base main_~first~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= |main_#t~mem5.base| main_~first~0.base)) (not (= main_~y~0.base main_~first~0.base)) (not (= main_~first~0.base main_~last~0.base))) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))), 95946#(or (and (not (= main_~x~0.base main_~first~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~y~0.base main_~first~0.base)) (not (= main_~first~0.base main_~last~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)))) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))), 95949#(or (and (not (= main_~x~0.base main_~first~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~first~0.base main_~last~0.base))) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))), 95948#(or (and (not (= main_~x~0.base main_~first~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~y~0.base main_~first~0.base)) (not (= main_~first~0.base main_~last~0.base))) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))), 95951#(or (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base))) (and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))))), 95950#(or (and (not (= main_~x~0.base main_~first~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= 1 (select |#valid| main_~last~0.base)) (not (= main_~first~0.base main_~last~0.base))) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))), 95953#(and (= 1 (select |#valid| |main_#t~mem6.base|)) (not (= main_~x~1.base |main_#t~mem6.base|))), 95952#(or (and (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))) (and (= main_~first~0.offset 0) (= main_~x~1.base main_~first~0.base) (= 12 (select |#length| main_~x~1.base)))), 95955#(= 1 (select |#valid| main_~first~0.base)), 95954#(and (not (= main_~x~1.base main_~first~0.base)) (= 1 (select |#valid| main_~first~0.base))), 95929#true, 95931#(= 0 |main_#t~malloc1.offset|), 95930#false, 95933#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 95932#(= 0 main_~x~0.offset), 95935#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (not (= main_~first~0.base |main_#t~malloc1.base|)) (= main_~last~0.offset main_~first~0.offset)), 95934#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset))] [2018-04-11 13:18:23,132 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 11 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:23,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 13:18:23,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 13:18:23,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-04-11 13:18:23,133 INFO L87 Difference]: Start difference. First operand 830 states and 919 transitions. Second operand 27 states. [2018-04-11 13:18:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:18:24,561 INFO L93 Difference]: Finished difference Result 975 states and 1080 transitions. [2018-04-11 13:18:24,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 13:18:24,561 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2018-04-11 13:18:24,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:18:24,562 INFO L225 Difference]: With dead ends: 975 [2018-04-11 13:18:24,562 INFO L226 Difference]: Without dead ends: 975 [2018-04-11 13:18:24,562 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=518, Invalid=2344, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 13:18:24,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-04-11 13:18:24,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 898. [2018-04-11 13:18:24,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 898 states. [2018-04-11 13:18:24,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 994 transitions. [2018-04-11 13:18:24,566 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 994 transitions. Word has length 93 [2018-04-11 13:18:24,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:18:24,566 INFO L459 AbstractCegarLoop]: Abstraction has 898 states and 994 transitions. [2018-04-11 13:18:24,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 13:18:24,566 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 994 transitions. [2018-04-11 13:18:24,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-11 13:18:24,567 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:18:24,567 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-11 13:18:24,567 INFO L408 AbstractCegarLoop]: === Iteration 99 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:18:24,567 INFO L82 PathProgramCache]: Analyzing trace with hash -462157881, now seen corresponding path program 1 times [2018-04-11 13:18:24,567 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:18:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:18:24,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:18:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 14 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:25,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:18:25,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 13:18:25,540 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:18:25,540 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 13:18:25,540 INFO L182 omatonBuilderFactory]: Interpolants [97887#true, 97889#(= 0 |main_#t~malloc1.offset|), 97888#false, 97891#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 97890#(= 0 main_~x~0.offset), 97893#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= 0 main_~first~0.offset) (= 20 (select |#length| |main_#t~malloc1.base|)) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset main_~first~0.offset)), 97892#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 97895#(and (= main_~first~0.offset 0) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~first~0.offset 12))) (= 20 (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~first~0.offset 12))) (= 0 main_~x~0.offset)), 97894#(and (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 97897#(and (= main_~first~0.offset 0) (= 20 (select |#length| main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base)) (= main_~last~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 97896#(and (not (= main_~first~0.base main_~x~0.base)) (= main_~first~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~first~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 97899#(and (= main_~first~0.offset 0) (or (and (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= main_~last~0.base main_~x~0.base) (= 20 (select |#length| main_~x~0.base))) (and (= 20 (select |#length| main_~last~0.base)) (not (= main_~x~0.base main_~first~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= main_~last~0.offset 0))) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 97898#(and (= main_~first~0.offset 0) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (or (and (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= 20 (select |#length| |main_#t~malloc1.base|)) (= main_~last~0.base |main_#t~malloc1.base|)) (and (= 20 (select |#length| main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= main_~last~0.offset 0)))), 97901#(and (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (or (and (= 20 (select |#length| main_~last~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= main_~last~0.offset 0)) (and (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= main_~last~0.base main_~x~0.base) (= 20 (select |#length| main_~x~0.base)))) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 97900#(and (= main_~first~0.offset 0) (= 1 (select |#valid| main_~x~0.base)) (or (and (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= main_~last~0.base main_~x~0.base) (= 20 (select |#length| main_~x~0.base))) (and (= 20 (select |#length| main_~last~0.base)) (not (= main_~x~0.base main_~first~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= main_~last~0.offset 0))) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 97903#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~last~0.base main_~first~0.base)) (or (and (= 20 (select |#length| main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (and (= 12 (select |#length| main_~last~0.base)) (= main_~last~0.offset 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~y~0.base main_~first~0.base))))), 97902#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~last~0.base main_~first~0.base)) (or (and (= 20 (select |#length| main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (and (= 12 (select |#length| main_~last~0.base)) (= main_~last~0.offset 0))) (or (= 12 (select |#length| main_~first~0.base)) (not (= main_~first~0.base |main_#t~malloc3.base|))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 97905#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~last~0.base main_~first~0.base)) (or (and (= 20 (select |#length| main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (and (= 12 (select |#length| main_~last~0.base)) (= main_~last~0.offset 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~y~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)))))), 97904#(and (= main_~first~0.offset 0) (or (and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base |main_#t~mem4.base|)) (not (= main_~last~0.base main_~first~0.base)) (or (and (= 20 (select |#length| main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (and (= 12 (select |#length| main_~last~0.base)) (= main_~last~0.offset 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~y~0.base main_~first~0.base))) (= 12 (select |#length| main_~first~0.base)))), 97907#(and (= main_~first~0.offset 0) (or (and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~last~0.base main_~first~0.base)) (or (and (= 20 (select |#length| main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (and (= 12 (select |#length| main_~last~0.base)) (= main_~last~0.offset 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~y~0.base main_~first~0.base))) (= 12 (select |#length| main_~first~0.base)))), 97906#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~x~0.base main_~first~0.base)) (not (= |main_#t~mem5.base| main_~first~0.base)) (or (and (= 20 (select |#length| main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~last~0.base main_~first~0.base))) (and (= 12 (select |#length| main_~last~0.base)) (= main_~last~0.offset 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~y~0.base main_~first~0.base))))), 97909#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (= 20 (select |#length| main_~last~0.base)) (not (= main_~x~0.base main_~first~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))))), 97908#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~last~0.base main_~first~0.base)) (or (and (= 20 (select |#length| main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (and (= 12 (select |#length| main_~last~0.base)) (= main_~last~0.offset 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))))), 97911#(and (= main_~first~0.offset 0) (or (and (= main_~x~1.base main_~first~0.base) (= 12 (select |#length| main_~x~1.base))) (and (= 20 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))))), 97910#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (= 20 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))))), 97913#(and (= 20 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)), 97912#(and (= 0 |main_#t~mem6.offset|) (= 20 (select |#length| |main_#t~mem6.base|)))] [2018-04-11 13:18:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 14 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:25,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 13:18:25,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 13:18:25,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2018-04-11 13:18:25,541 INFO L87 Difference]: Start difference. First operand 898 states and 994 transitions. Second operand 27 states. [2018-04-11 13:18:27,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:18:27,300 INFO L93 Difference]: Finished difference Result 973 states and 1080 transitions. [2018-04-11 13:18:27,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 13:18:27,300 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2018-04-11 13:18:27,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:18:27,301 INFO L225 Difference]: With dead ends: 973 [2018-04-11 13:18:27,301 INFO L226 Difference]: Without dead ends: 973 [2018-04-11 13:18:27,301 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=479, Invalid=2601, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 13:18:27,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2018-04-11 13:18:27,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 911. [2018-04-11 13:18:27,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 911 states. [2018-04-11 13:18:27,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1012 transitions. [2018-04-11 13:18:27,305 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1012 transitions. Word has length 93 [2018-04-11 13:18:27,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:18:27,305 INFO L459 AbstractCegarLoop]: Abstraction has 911 states and 1012 transitions. [2018-04-11 13:18:27,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 13:18:27,305 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1012 transitions. [2018-04-11 13:18:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-11 13:18:27,306 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:18:27,306 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:18:27,306 INFO L408 AbstractCegarLoop]: === Iteration 100 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:18:27,306 INFO L82 PathProgramCache]: Analyzing trace with hash -593751839, now seen corresponding path program 1 times [2018-04-11 13:18:27,306 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:18:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:18:27,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:18:27,780 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:27,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:18:27,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-11 13:18:27,781 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:18:27,781 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 13:18:27,781 INFO L182 omatonBuilderFactory]: Interpolants [99863#false, 99862#true, 99865#(= main_~x~0.offset 0), 99864#(= 0 |main_#t~malloc1.offset|), 99867#(and (= 0 main_~y~0.offset) (= 0 main_~x~0.offset)), 99866#(and (= 0 |main_#t~malloc3.offset|) (= 0 main_~x~0.offset)), 99869#(and (= (select |#valid| main_~y~0.base) 1) (= 0 main_~y~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 99868#(and (= 0 main_~y~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 99871#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~malloc3.base|)) (not (= main_~x~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 99870#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 99873#(and (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 |main_#t~mem4.offset|) (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (not (= main_~x~0.base main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 99872#(and (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (not (= main_~x~0.base main_~y~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 99875#(and (not (= main_~y~0.base |main_#t~mem5.base|)) (= main_~y~0.offset 0) (= (select |#valid| main_~y~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset)) (not (= main_~x~0.base main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 99874#(and (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~y~0.base)) (= (select |#valid| main_~y~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset)) (not (= main_~x~0.base main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 99877#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 99876#(and (= main_~y~0.offset 0) (= (select |#valid| main_~y~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset)) (not (= main_~x~0.base main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 99879#(and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base |main_#t~malloc1.base|)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (= main_~last~0.base main_~first~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) |main_#t~malloc1.base|))), 99878#(and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 1) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 99881#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (= main_~last~0.base main_~first~0.base)), 99880#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (= main_~last~0.base main_~first~0.base)), 99883#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)) 0)) (= main_~x~1.base main_~first~0.base)), 99882#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)), 99885#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) 0)), 99884#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)), 99887#(or (= 0 (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (not (= 0 main_~z~0.offset))), 99886#(or (not (= 0 main_~y~1.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset))), 99889#(or (not (= 0 main_~z~0.offset)) (= 0 main_~y~1.offset)), 99888#(or (not (= 0 main_~z~0.offset)) (= 0 |main_#t~mem8.offset|)), 99891#(= main_~z~0.offset 0), 99890#(= 0 main_~y~1.offset)] [2018-04-11 13:18:27,781 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:27,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 13:18:27,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 13:18:27,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=776, Unknown=0, NotChecked=0, Total=870 [2018-04-11 13:18:27,781 INFO L87 Difference]: Start difference. First operand 911 states and 1012 transitions. Second operand 30 states. [2018-04-11 13:18:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:18:29,970 INFO L93 Difference]: Finished difference Result 1121 states and 1251 transitions. [2018-04-11 13:18:30,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-11 13:18:30,001 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 94 [2018-04-11 13:18:30,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:18:30,002 INFO L225 Difference]: With dead ends: 1121 [2018-04-11 13:18:30,002 INFO L226 Difference]: Without dead ends: 1121 [2018-04-11 13:18:30,002 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2440 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1456, Invalid=7664, Unknown=0, NotChecked=0, Total=9120 [2018-04-11 13:18:30,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2018-04-11 13:18:30,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 913. [2018-04-11 13:18:30,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2018-04-11 13:18:30,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1014 transitions. [2018-04-11 13:18:30,006 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1014 transitions. Word has length 94 [2018-04-11 13:18:30,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:18:30,006 INFO L459 AbstractCegarLoop]: Abstraction has 913 states and 1014 transitions. [2018-04-11 13:18:30,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 13:18:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1014 transitions. [2018-04-11 13:18:30,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-11 13:18:30,007 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:18:30,007 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:18:30,008 INFO L408 AbstractCegarLoop]: === Iteration 101 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:18:30,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1441993080, now seen corresponding path program 2 times [2018-04-11 13:18:30,008 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:18:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:18:30,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:18:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 11 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:30,528 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:18:30,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 13:18:30,528 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:18:30,528 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 13:18:30,528 INFO L182 omatonBuilderFactory]: Interpolants [102081#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~x~0.base main_~first~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~last~0.base main_~first~0.base)) (not (= main_~y~0.base main_~first~0.base))))), 102080#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~x~0.base main_~first~0.base)) (not (= |main_#t~mem5.base| main_~first~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~last~0.base main_~first~0.base)) (not (= main_~y~0.base main_~first~0.base))))), 102083#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~x~0.base main_~first~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))))), 102082#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~x~0.base main_~first~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~last~0.base main_~first~0.base))))), 102085#(and (= main_~first~0.offset 0) (or (and (= main_~x~1.base main_~first~0.base) (= 12 (select |#length| main_~x~1.base))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))))), 102084#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))))), 102087#(not (= 0 main_~first~0.base)), 102086#(not (= 0 |main_#t~mem6.base|)), 102063#false, 102062#true, 102065#(= 0 main_~x~0.offset), 102064#(= 0 |main_#t~malloc1.offset|), 102067#(and (= main_~first~0.offset main_~last~0.offset) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 102066#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 102069#(and (= main_~first~0.offset main_~last~0.offset) (not (= 0 main_~x~0.base)) (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base)), 102068#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.offset main_~last~0.offset) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (not (= 0 |main_#t~malloc1.base|))), 102071#(and (not (= main_~first~0.base main_~x~0.base)) (= main_~first~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= (select |#valid| main_~first~0.base) 1)), 102070#(and (= main_~first~0.offset 0) (not (= main_~last~0.base main_~x~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~first~0.offset 12)))) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 102073#(and (= main_~first~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base))), 102072#(and (= main_~first~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base))), 102075#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~last~0.base main_~first~0.base))), 102074#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~last~0.base main_~first~0.base))), 102077#(and (= main_~first~0.offset 0) (or (and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~last~0.base main_~first~0.base)) (not (= main_~y~0.base main_~first~0.base))) (= 12 (select |#length| main_~first~0.base)))), 102076#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~last~0.base main_~first~0.base)) (or (= 12 (select |#length| main_~first~0.base)) (not (= main_~first~0.base |main_#t~malloc3.base|)))), 102079#(and (= main_~first~0.offset 0) (or (and (not (= main_~x~0.base main_~first~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~last~0.base main_~first~0.base)) (not (= main_~y~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)))) (= 12 (select |#length| main_~first~0.base)))), 102078#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base |main_#t~mem4.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~last~0.base main_~first~0.base)) (not (= main_~y~0.base main_~first~0.base)))))] [2018-04-11 13:18:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 11 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:30,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 13:18:30,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 13:18:30,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2018-04-11 13:18:30,529 INFO L87 Difference]: Start difference. First operand 913 states and 1014 transitions. Second operand 26 states. [2018-04-11 13:18:31,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:18:31,603 INFO L93 Difference]: Finished difference Result 1048 states and 1167 transitions. [2018-04-11 13:18:31,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 13:18:31,603 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 94 [2018-04-11 13:18:31,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:18:31,604 INFO L225 Difference]: With dead ends: 1048 [2018-04-11 13:18:31,604 INFO L226 Difference]: Without dead ends: 1048 [2018-04-11 13:18:31,604 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=555, Invalid=1995, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 13:18:31,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2018-04-11 13:18:31,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 966. [2018-04-11 13:18:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-04-11 13:18:31,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1072 transitions. [2018-04-11 13:18:31,609 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1072 transitions. Word has length 94 [2018-04-11 13:18:31,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:18:31,610 INFO L459 AbstractCegarLoop]: Abstraction has 966 states and 1072 transitions. [2018-04-11 13:18:31,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 13:18:31,610 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1072 transitions. [2018-04-11 13:18:31,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-11 13:18:31,610 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:18:31,610 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:18:31,610 INFO L408 AbstractCegarLoop]: === Iteration 102 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:18:31,610 INFO L82 PathProgramCache]: Analyzing trace with hash 2000254645, now seen corresponding path program 2 times [2018-04-11 13:18:31,611 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:18:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:18:31,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:18:32,108 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 26 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:32,108 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:18:32,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 13:18:32,108 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:18:32,109 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 13:18:32,109 INFO L182 omatonBuilderFactory]: Interpolants [104157#true, 104159#(= 0 |main_#t~malloc1.offset|), 104158#false, 104161#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 104160#(= main_~x~0.offset 0), 104163#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.offset main_~last~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|)), 104162#(and (= main_~first~0.offset main_~last~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 104165#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~first~0.offset main_~last~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 main_~x~0.offset)), 104164#(and (= main_~first~0.offset main_~last~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 main_~x~0.offset)), 104167#(and (not (= main_~first~0.base main_~x~0.base)) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) main_~x~0.base) (= (select |#valid| main_~first~0.base) 1) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 104166#(and (= (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12)) main_~x~0.base) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 104169#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 |main_#t~malloc1.offset|) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base)) (= main_~last~0.offset 0)), 104168#(and (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base)) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0)), 104171#(and (not (= main_~x~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) (+ 0 12))) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))), 104170#(and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~last~0.base main_~first~0.base)) (= main_~last~0.offset 0) (= 0 main_~x~0.offset)), 104173#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem6.base|) (+ 0 12))), 104172#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12))), 104175#(or (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (and (or (<= 1 main_~first~0.offset) (<= (+ main_~first~0.offset 1) 0)) (not (= 0 main_~x~1.offset)))), 104174#(or (<= 1 main_~first~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (<= (+ main_~first~0.offset 1) 0)), 104177#(or (= 0 main_~first~0.offset) (not (= 0 main_~x~1.offset))), 104176#(or (not (= 0 main_~x~1.offset)) (= 0 |main_#t~mem6.offset|)), 104179#(and (= main_~first~0.offset 0) (= main_~first~0.offset main_~x~1.offset)), 104178#(= 0 main_~first~0.offset), 104181#(and (<= 0 main_~x~1.offset) (<= main_~x~1.offset 0)), 104180#(<= main_~x~1.offset 0)] [2018-04-11 13:18:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 26 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:32,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 13:18:32,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 13:18:32,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2018-04-11 13:18:32,109 INFO L87 Difference]: Start difference. First operand 966 states and 1072 transitions. Second operand 25 states. [2018-04-11 13:18:33,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:18:33,218 INFO L93 Difference]: Finished difference Result 1069 states and 1179 transitions. [2018-04-11 13:18:33,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 13:18:33,218 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2018-04-11 13:18:33,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:18:33,218 INFO L225 Difference]: With dead ends: 1069 [2018-04-11 13:18:33,219 INFO L226 Difference]: Without dead ends: 1069 [2018-04-11 13:18:33,219 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=641, Invalid=2665, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 13:18:33,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2018-04-11 13:18:33,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 961. [2018-04-11 13:18:33,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2018-04-11 13:18:33,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1067 transitions. [2018-04-11 13:18:33,223 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1067 transitions. Word has length 94 [2018-04-11 13:18:33,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:18:33,224 INFO L459 AbstractCegarLoop]: Abstraction has 961 states and 1067 transitions. [2018-04-11 13:18:33,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 13:18:33,224 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1067 transitions. [2018-04-11 13:18:33,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-11 13:18:33,224 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:18:33,224 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:18:33,224 INFO L408 AbstractCegarLoop]: === Iteration 103 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:18:33,224 INFO L82 PathProgramCache]: Analyzing trace with hash 2000254696, now seen corresponding path program 3 times [2018-04-11 13:18:33,225 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:18:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:18:33,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:18:33,837 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 23 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:33,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:18:33,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-11 13:18:33,837 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:18:33,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 13:18:33,838 INFO L182 omatonBuilderFactory]: Interpolants [106305#(or (and (= (select (select |#memory_$Pointer$.offset| |main_#t~mem6.base|) |main_#t~mem6.offset|) |main_#t~mem6.offset|) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) |main_#t~mem6.offset|))) (not (= 0 main_~x~1.offset))), 106304#(or (and (or (<= 1 main_~first~0.offset) (<= (+ main_~first~0.offset 1) 0)) (not (= 0 main_~x~1.offset))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))))), 106307#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 106306#(or (and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (not (= 0 main_~x~1.offset))), 106309#(and (= main_~x~1.offset |main_#t~mem7.offset|) (= main_~x~1.base |main_#t~mem7.base|)), 106308#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset))), 106310#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base)), 106283#true, 106285#(= 0 |main_#t~malloc1.offset|), 106284#false, 106287#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 106286#(= main_~x~0.offset 0), 106289#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.offset main_~last~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|)), 106288#(and (= main_~first~0.offset main_~last~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 106291#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~first~0.offset main_~last~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 main_~x~0.offset)), 106290#(and (= main_~first~0.offset main_~last~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 main_~x~0.offset)), 106293#(and (not (= main_~first~0.base main_~x~0.base)) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) main_~x~0.base) (= (select |#valid| main_~first~0.base) 1) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 106292#(and (= (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12)) main_~x~0.base) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 106295#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base)) (= main_~last~0.offset 0)), 106294#(and (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base)) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0)), 106297#(and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= main_~last~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16))) (not (= main_~last~0.base main_~first~0.base)) (= main_~last~0.offset 0)), 106296#(and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~last~0.base main_~first~0.base)) (= main_~last~0.offset 0)), 106299#(and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ 0 12)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12))) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.offset| main_~last~0.base) (+ 0 12))) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= main_~last~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~last~0.offset 12))) (= main_~last~0.offset 0)), 106298#(and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~last~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16))) (not (= main_~last~0.base main_~first~0.base)) (= main_~last~0.offset 0)), 106301#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12))))), 106300#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12)))), 106303#(or (<= 1 main_~first~0.offset) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))))) (<= (+ main_~first~0.offset 1) 0)), 106302#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) (+ 0 12))) (select (select |#memory_$Pointer$.offset| |main_#t~mem6.base|) (+ 0 12))) (select (select |#memory_$Pointer$.offset| |main_#t~mem6.base|) (+ 0 12))) (= (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) (+ 0 12)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) (+ 0 12))) (select (select |#memory_$Pointer$.offset| |main_#t~mem6.base|) (+ 0 12)))))] [2018-04-11 13:18:33,838 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 23 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:33,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 13:18:33,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 13:18:33,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2018-04-11 13:18:33,838 INFO L87 Difference]: Start difference. First operand 961 states and 1067 transitions. Second operand 28 states. [2018-04-11 13:18:35,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:18:35,127 INFO L93 Difference]: Finished difference Result 1059 states and 1172 transitions. [2018-04-11 13:18:35,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 13:18:35,128 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 94 [2018-04-11 13:18:35,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:18:35,128 INFO L225 Difference]: With dead ends: 1059 [2018-04-11 13:18:35,128 INFO L226 Difference]: Without dead ends: 1059 [2018-04-11 13:18:35,128 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=399, Invalid=3261, Unknown=0, NotChecked=0, Total=3660 [2018-04-11 13:18:35,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2018-04-11 13:18:35,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 969. [2018-04-11 13:18:35,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2018-04-11 13:18:35,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1075 transitions. [2018-04-11 13:18:35,132 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1075 transitions. Word has length 94 [2018-04-11 13:18:35,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:18:35,133 INFO L459 AbstractCegarLoop]: Abstraction has 969 states and 1075 transitions. [2018-04-11 13:18:35,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 13:18:35,133 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1075 transitions. [2018-04-11 13:18:35,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-04-11 13:18:35,133 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:18:35,133 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-11 13:18:35,133 INFO L408 AbstractCegarLoop]: === Iteration 104 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:18:35,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1276591429, now seen corresponding path program 4 times [2018-04-11 13:18:35,134 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:18:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:18:35,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:18:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:35,829 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:18:35,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-11 13:18:35,829 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:18:35,829 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 13:18:35,829 INFO L182 omatonBuilderFactory]: Interpolants [108417#(and (= main_~x~0.base |main_#t~mem4.base|) (= main_~y~0.offset 0) (= 1 (select |#valid| main_~x~0.base)) (= |main_#t~mem4.offset| main_~x~0.offset) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 108416#(and (= main_~y~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 108419#(and (= 1 (select |#valid| main_~y~0.base)) (not (= main_~y~0.base |main_#t~mem5.base|)) (= main_~y~0.offset 0) (= 1 (select |#valid| main_~x~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 108418#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~y~0.offset 0) (= (select |#valid| main_~y~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 108421#(and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (= main_~last~0.base main_~first~0.base) (= 1 (select |#valid| main_~last~0.base))), 108420#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) main_~x~0.offset) (= 0 main_~x~0.offset)), 108423#(and (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) main_~x~0.base)) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base)), 108422#(and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (not (= main_~first~0.offset (+ main_~last~0.offset 12))) (not (= |main_#t~malloc1.base| main_~last~0.base)) (= main_~last~0.base main_~first~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) |main_#t~malloc1.base|))), 108425#(and (not (= main_~first~0.base main_~x~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset) main_~x~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (= 1 (select |#valid| main_~first~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)))), 108424#(and (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) main_~x~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 1 (select |#valid| main_~last~0.base))), 108427#(and (not (= |main_#t~malloc1.base| main_~first~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset) |main_#t~malloc1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (not (= main_~last~0.base main_~first~0.base))), 108426#(and (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (not (= main_~last~0.base main_~first~0.base)) (= 1 (select |#valid| main_~first~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)))), 108429#(and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0) main_~first~0.offset)), 108428#(and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (not (= main_~last~0.base main_~first~0.base))), 108431#(and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)) 0)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)) 0)) (= main_~x~1.base main_~first~0.base)), 108430#(and (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0) main_~first~0.offset)), 108433#(and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) 0)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0))), 108432#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0))), 108435#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))), 108434#(or (not (= 0 main_~y~1.offset)) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))), 108437#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base))), 108436#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset |main_#t~mem8.offset|) (= main_~x~1.base |main_#t~mem8.base|))), 108438#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base)), 108409#true, 108411#(= 0 |main_#t~malloc1.offset|), 108410#false, 108413#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 108412#(= 0 main_~x~0.offset), 108415#(and (not (= main_~x~0.base |main_#t~malloc3.base|)) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~x~0.offset)), 108414#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset))] [2018-04-11 13:18:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:35,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 13:18:35,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 13:18:35,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=783, Unknown=0, NotChecked=0, Total=870 [2018-04-11 13:18:35,830 INFO L87 Difference]: Start difference. First operand 969 states and 1075 transitions. Second operand 30 states. [2018-04-11 13:18:38,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:18:38,067 INFO L93 Difference]: Finished difference Result 1206 states and 1345 transitions. [2018-04-11 13:18:38,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-11 13:18:38,067 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 95 [2018-04-11 13:18:38,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:18:38,068 INFO L225 Difference]: With dead ends: 1206 [2018-04-11 13:18:38,068 INFO L226 Difference]: Without dead ends: 1206 [2018-04-11 13:18:38,068 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=779, Invalid=5227, Unknown=0, NotChecked=0, Total=6006 [2018-04-11 13:18:38,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2018-04-11 13:18:38,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1035. [2018-04-11 13:18:38,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2018-04-11 13:18:38,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1147 transitions. [2018-04-11 13:18:38,074 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1147 transitions. Word has length 95 [2018-04-11 13:18:38,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:18:38,074 INFO L459 AbstractCegarLoop]: Abstraction has 1035 states and 1147 transitions. [2018-04-11 13:18:38,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 13:18:38,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1147 transitions. [2018-04-11 13:18:38,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-04-11 13:18:38,074 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:18:38,074 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:18:38,074 INFO L408 AbstractCegarLoop]: === Iteration 105 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:18:38,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1752090488, now seen corresponding path program 1 times [2018-04-11 13:18:38,075 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:18:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:18:38,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:18:38,720 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:38,720 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:18:38,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 13:18:38,720 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:18:38,721 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 13:18:38,721 INFO L182 omatonBuilderFactory]: Interpolants [110785#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 110784#(= 0 main_~x~0.offset), 110787#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset main_~first~0.offset)), 110786#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 110789#(and (= main_~first~0.offset 0) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~first~0.offset 12)))), 110788#(and (not (= main_~last~0.base main_~x~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 110791#(and (= main_~first~0.offset 0) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 110790#(and (not (= main_~first~0.base main_~x~0.base)) (= main_~first~0.offset 0) (= (select |#valid| main_~first~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 110793#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 110792#(and (= main_~first~0.offset 0) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 110795#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~last~0.base main_~first~0.base)) (or (= 12 (select |#length| main_~first~0.base)) (not (= main_~first~0.base |main_#t~malloc3.base|))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 110794#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 110797#(and (= main_~first~0.offset 0) (or (and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base |main_#t~mem4.base|)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~y~0.base main_~first~0.base))) (= 12 (select |#length| main_~first~0.base)))), 110796#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~y~0.base main_~first~0.base))))), 110799#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~x~0.base main_~first~0.base)) (not (= |main_#t~mem5.base| main_~first~0.base)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~y~0.base main_~first~0.base))))), 110798#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~y~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)))))), 110801#(and (= main_~first~0.offset 0) (or (and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 12 (select |#length| main_~first~0.base)))), 110800#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~y~0.base main_~first~0.base))))), 110803#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))))), 110802#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~x~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))))), 110805#(= 0 |main_#t~mem6.offset|), 110804#(and (= main_~first~0.offset 0) (or (and (= main_~x~1.base main_~first~0.base) (= 12 (select |#length| main_~x~1.base))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))))), 110807#(and (= main_~first~0.offset 0) (= main_~first~0.offset main_~x~1.offset) (= main_~x~1.base main_~first~0.base)), 110806#(= 0 main_~first~0.offset), 110808#(and (<= 0 main_~x~1.offset) (<= (+ main_~x~1.offset 16) (select |#length| main_~x~1.base))), 110781#true, 110783#(= 0 |main_#t~malloc1.offset|), 110782#false] [2018-04-11 13:18:38,721 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:38,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 13:18:38,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 13:18:38,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2018-04-11 13:18:38,722 INFO L87 Difference]: Start difference. First operand 1035 states and 1147 transitions. Second operand 28 states. [2018-04-11 13:18:40,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:18:40,088 INFO L93 Difference]: Finished difference Result 1142 states and 1268 transitions. [2018-04-11 13:18:40,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 13:18:40,088 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 95 [2018-04-11 13:18:40,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:18:40,089 INFO L225 Difference]: With dead ends: 1142 [2018-04-11 13:18:40,089 INFO L226 Difference]: Without dead ends: 1142 [2018-04-11 13:18:40,089 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=675, Invalid=2865, Unknown=0, NotChecked=0, Total=3540 [2018-04-11 13:18:40,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2018-04-11 13:18:40,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1038. [2018-04-11 13:18:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1038 states. [2018-04-11 13:18:40,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1152 transitions. [2018-04-11 13:18:40,093 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1152 transitions. Word has length 95 [2018-04-11 13:18:40,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:18:40,093 INFO L459 AbstractCegarLoop]: Abstraction has 1038 states and 1152 transitions. [2018-04-11 13:18:40,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 13:18:40,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1152 transitions. [2018-04-11 13:18:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-04-11 13:18:40,094 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:18:40,094 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:18:40,094 INFO L408 AbstractCegarLoop]: === Iteration 106 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:18:40,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1350217703, now seen corresponding path program 4 times [2018-04-11 13:18:40,095 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:18:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:18:40,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:18:40,959 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 15 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:40,959 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:18:40,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-11 13:18:40,959 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:18:40,959 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 13:18:40,960 INFO L182 omatonBuilderFactory]: Interpolants [113089#(or (not (= 0 main_~z~0.offset)) (and (= 1 (select |#valid| main_~y~1.base)) (not (= main_~z~0.base main_~y~1.base)))), 113088#(or (not (= 0 main_~z~0.offset)) (and (= 1 (select |#valid| |main_#t~mem8.base|)) (not (= main_~z~0.base |main_#t~mem8.base|)))), 113091#(= 1 (select |#valid| main_~y~1.base)), 113090#(and (= 1 (select |#valid| main_~y~1.base)) (not (= main_~z~0.base main_~y~1.base))), 113057#true, 113059#(= 0 |main_#t~malloc1.offset|), 113058#false, 113061#(and (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 113060#(= 0 main_~x~0.offset), 113063#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 113062#(and (= (select |#valid| main_~y~0.base) 1) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 113065#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (= 0 main_~y~0.offset) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 113064#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~malloc3.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~x~0.offset)), 113067#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~y~0.base)) (= (select |#valid| main_~y~0.base) 1) (= 0 main_~y~0.offset) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 113066#(and (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= |main_#t~mem4.base| main_~y~0.base)) (= 0 main_~y~0.offset) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset) (= 1 (select |#valid| |main_#t~mem4.base|))), 113069#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 113068#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (not (= main_~y~0.base |main_#t~mem5.base|)) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (= (select |#valid| main_~y~0.base) 1) (= 0 main_~y~0.offset) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 113071#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (not (= main_~y~0.base main_~x~0.base)) (= 0 main_~x~0.offset)) (= main_~y~0.offset 0) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) main_~y~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 113070#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) |main_#t~malloc3.base|)) (= 0 main_~x~0.offset)), 113073#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0) main_~y~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (or (not (= main_~y~0.base main_~x~0.base)) (= 0 main_~x~0.offset)) (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0)))), 113072#(and (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 |main_#t~mem4.offset|) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem4.base|) 0) |main_#t~mem4.base|)) (or (not (= main_~y~0.base main_~x~0.base)) (= 0 main_~x~0.offset)) (= main_~y~0.offset 0) (not (= main_~x~0.base |main_#t~mem4.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem4.base|) 0))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem4.base|) 0) main_~y~0.base))), 113075#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0) main_~y~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (or (not (= main_~y~0.base main_~x~0.base)) (= 0 main_~x~0.offset)) (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0)))), 113074#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem5.base|) 0) (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (not (= 0 (+ |main_#t~mem5.offset| 4))) (not (= main_~x~0.base |main_#t~mem5.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem5.base|) 0))) (or (not (= main_~y~0.base main_~x~0.base)) (= 0 main_~x~0.offset)) (= main_~y~0.offset 0) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem5.base|) 0) main_~y~0.base))), 113077#(or (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) 0)))) (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset))), 113076#(and (or (= main_~y~0.base main_~x~0.base) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0) main_~y~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0))))) (or (not (= main_~y~0.base main_~x~0.base)) (= 0 main_~x~0.offset))), 113079#(or (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) 0))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) 0) (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)))) (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset 0))), 113078#(or (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) 0))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) 0) (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))))), 113081#(or (not (= 0 main_~y~1.offset)) (and (= main_~y~1.base main_~x~1.base) (= main_~x~1.offset 0)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) 0))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) 0) (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) 0) main_~y~1.base)))), 113080#(or (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0)) 0) |main_#t~mem7.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0)) 0) (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0)) 0)))) (and (= main_~x~1.base |main_#t~mem7.base|) (= main_~x~1.offset 0))), 113083#(or (not (= 0 main_~z~0.offset)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem8.base|) 0))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem8.base|) 0) |main_#t~mem8.base|)) (not (= main_~z~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem8.base|) 0))))), 113082#(or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) 0))) (not (= main_~z~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) 0))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) 0) (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))) (not (= 0 main_~z~0.offset))), 113085#(or (not (= 0 main_~y~1.offset)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= main_~z~0.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset) main_~y~1.base)))), 113084#(or (not (= 0 main_~y~1.offset)) (not (= 0 main_~z~0.offset)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= main_~z~0.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset) main_~y~1.base)))), 113087#(or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= main_~z~0.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))) (not (= 0 main_~z~0.offset))), 113086#(or (not (= 0 main_~y~1.offset)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset) main_~y~1.base))))] [2018-04-11 13:18:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 15 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:40,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 13:18:40,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 13:18:40,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1100, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 13:18:40,960 INFO L87 Difference]: Start difference. First operand 1038 states and 1152 transitions. Second operand 35 states. [2018-04-11 13:18:44,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:18:44,529 INFO L93 Difference]: Finished difference Result 1158 states and 1293 transitions. [2018-04-11 13:18:44,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-11 13:18:44,529 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 96 [2018-04-11 13:18:44,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:18:44,530 INFO L225 Difference]: With dead ends: 1158 [2018-04-11 13:18:44,530 INFO L226 Difference]: Without dead ends: 1158 [2018-04-11 13:18:44,530 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1510 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=923, Invalid=6387, Unknown=0, NotChecked=0, Total=7310 [2018-04-11 13:18:44,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2018-04-11 13:18:44,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1048. [2018-04-11 13:18:44,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2018-04-11 13:18:44,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1164 transitions. [2018-04-11 13:18:44,534 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1164 transitions. Word has length 96 [2018-04-11 13:18:44,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:18:44,534 INFO L459 AbstractCegarLoop]: Abstraction has 1048 states and 1164 transitions. [2018-04-11 13:18:44,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 13:18:44,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1164 transitions. [2018-04-11 13:18:44,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-04-11 13:18:44,535 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:18:44,535 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:18:44,535 INFO L408 AbstractCegarLoop]: === Iteration 107 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:18:44,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1350217704, now seen corresponding path program 3 times [2018-04-11 13:18:44,535 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:18:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:18:44,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:18:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 11 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:45,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:18:45,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-11 13:18:45,414 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:18:45,415 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 13:18:45,415 INFO L182 omatonBuilderFactory]: Interpolants [115405#false, 115404#true, 115407#(= 0 main_~x~0.offset), 115406#(= 0 |main_#t~malloc1.offset|), 115409#(and (= 12 (select |#length| main_~y~0.base)) (= 0 main_~y~0.offset) (= 0 main_~x~0.offset)), 115408#(and (= 0 |main_#t~malloc3.offset|) (= 12 (select |#length| |main_#t~malloc3.base|)) (= 0 main_~x~0.offset)), 115411#(and (= 12 (select |#length| main_~y~0.base)) (= (select |#valid| main_~y~0.base) 1) (= 0 main_~y~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 115410#(and (= 12 (select |#length| main_~y~0.base)) (= 0 main_~y~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 115413#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~malloc3.base|)) (not (= main_~x~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 115412#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 115415#(and (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| |main_#t~mem4.base|)) (= 0 |main_#t~mem4.offset|) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (= 0 main_~y~0.offset) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 115414#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (= 0 main_~y~0.offset) (not (= main_~x~0.base main_~y~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 115417#(and (not (= main_~y~0.base |main_#t~mem5.base|)) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (= (select |#valid| main_~y~0.base) 1) (= 12 (select |#length| |main_#t~mem5.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset)) (= 0 main_~y~0.offset) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 115416#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~y~0.base)) (= (select |#valid| main_~y~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset)) (= 0 main_~y~0.offset) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 115419#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) 1) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 115418#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= (select |#valid| main_~y~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 1) (= 0 main_~y~0.offset) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 115421#(and (or (not (= main_~y~0.base main_~x~0.base)) (= 0 main_~x~0.offset)) (= main_~y~0.offset 0) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 115420#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~malloc3.base|)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (= 0 |main_#t~malloc3.offset|) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 115423#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0)) (or (not (= main_~y~0.base main_~x~0.base)) (= 0 main_~x~0.offset)) (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~y~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset))), 115422#(and (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem4.base|) 0)) (= 0 |main_#t~mem4.offset|) (or (not (= main_~y~0.base main_~x~0.base)) (= 0 main_~x~0.offset)) (= main_~y~0.offset 0) (not (= main_~x~0.base |main_#t~mem4.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem4.base|) 0)))), 115425#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0)) (or (not (= main_~y~0.base main_~x~0.base)) (= 0 main_~x~0.offset)) (= main_~y~0.offset 0) (not (= main_~y~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)))), 115424#(and (not (= 0 (+ |main_#t~mem5.offset| 4))) (not (= main_~x~0.base |main_#t~mem5.base|)) (not (= main_~y~0.base |main_#t~mem5.base|)) (or (not (= main_~y~0.base main_~x~0.base)) (= 0 main_~x~0.offset)) (= main_~y~0.offset 0) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem5.base|) 0))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem5.base|) 0))), 115427#(or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) 0))) (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset))), 115426#(and (or (= main_~y~0.base main_~x~0.base) (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0)) (= main_~y~0.offset 0))) (or (not (= main_~y~0.base main_~x~0.base)) (= 0 main_~x~0.offset))), 115429#(or (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset 0)) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) 0)))), 115428#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) 0)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) 0)))) (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset))), 115431#(or (not (= 0 main_~y~1.offset)) (and (= main_~y~1.base main_~x~1.base) (= main_~x~1.offset 0)) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) 0)))), 115430#(or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0)) 0))) (and (= main_~x~1.base |main_#t~mem7.base|) (= main_~x~1.offset 0))), 115433#(or (not (= 0 main_~z~0.offset)) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem8.base|) 0))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem8.base|) 0)))), 115432#(or (not (= 0 main_~z~0.offset)) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) 0)))), 115435#(and (or (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= 0 main_~y~1.offset))) (or (not (= 0 main_~y~1.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)))), 115434#(or (and (or (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= 0 main_~y~1.offset))) (or (not (= 0 main_~y~1.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)))) (not (= 0 main_~z~0.offset))), 115437#(and (or (not (= 0 main_~z~0.offset)) (= 0 |main_#t~mem8.offset|)) (or (not (= 0 main_~z~0.offset)) (= 12 (select |#length| |main_#t~mem8.base|)))), 115436#(and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (not (= 0 main_~z~0.offset))) (or (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= 0 main_~z~0.offset)))), 115439#(and (= 12 (select |#length| main_~y~1.base)) (= main_~y~1.offset 0)), 115438#(and (or (not (= 0 main_~z~0.offset)) (= 12 (select |#length| main_~y~1.base))) (or (not (= 0 main_~z~0.offset)) (= main_~y~1.offset 0)))] [2018-04-11 13:18:45,415 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 11 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:45,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 13:18:45,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 13:18:45,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1166, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 13:18:45,415 INFO L87 Difference]: Start difference. First operand 1048 states and 1164 transitions. Second operand 36 states. [2018-04-11 13:18:50,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:18:50,227 INFO L93 Difference]: Finished difference Result 1286 states and 1420 transitions. [2018-04-11 13:18:50,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-11 13:18:50,227 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 96 [2018-04-11 13:18:50,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:18:50,228 INFO L225 Difference]: With dead ends: 1286 [2018-04-11 13:18:50,228 INFO L226 Difference]: Without dead ends: 1286 [2018-04-11 13:18:50,229 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2108 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1277, Invalid=8035, Unknown=0, NotChecked=0, Total=9312 [2018-04-11 13:18:50,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2018-04-11 13:18:50,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1048. [2018-04-11 13:18:50,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2018-04-11 13:18:50,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1163 transitions. [2018-04-11 13:18:50,233 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1163 transitions. Word has length 96 [2018-04-11 13:18:50,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:18:50,233 INFO L459 AbstractCegarLoop]: Abstraction has 1048 states and 1163 transitions. [2018-04-11 13:18:50,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 13:18:50,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1163 transitions. [2018-04-11 13:18:50,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-04-11 13:18:50,234 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:18:50,234 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:18:50,234 INFO L408 AbstractCegarLoop]: === Iteration 108 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:18:50,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1454457880, now seen corresponding path program 5 times [2018-04-11 13:18:50,234 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:18:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:18:50,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:18:50,507 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 24 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:50,507 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:18:50,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 13:18:50,508 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:18:50,508 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 13:18:50,508 INFO L182 omatonBuilderFactory]: Interpolants [117921#(and (= 1 (select |#valid| |main_#t~mem6.base|)) (not (= main_~x~1.base |main_#t~mem6.base|))), 117920#(and (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))), 117923#(= 1 (select |#valid| main_~first~0.base)), 117922#(and (not (= main_~x~1.base main_~first~0.base)) (= 1 (select |#valid| main_~first~0.base))), 117903#false, 117902#true, 117905#(and (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 117904#(= 1 (select |#valid| main_~x~0.base)), 117907#(and (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset)), 117906#(and (= main_~last~0.base main_~first~0.base) (not (= main_~first~0.base |main_#t~malloc1.base|)) (= main_~last~0.offset main_~first~0.offset)), 117909#(and (not (= main_~first~0.base main_~x~0.base)) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) main_~x~0.base) (= (select |#valid| main_~first~0.base) 1)), 117908#(and (= (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12)) main_~x~0.base) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 117911#(and (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~first~0.base) 1) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~first~0.base main_~last~0.base))), 117910#(and (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~first~0.base) 1) (not (= main_~first~0.base main_~last~0.base))), 117913#(and (not (= main_~x~0.base main_~first~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~first~0.base) 1) (= (select |#valid| main_~last~0.base) 1) (not (= main_~first~0.base main_~last~0.base))), 117912#(and (not (= main_~x~0.base main_~first~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~first~0.base) 1) (not (= main_~first~0.base main_~last~0.base))), 117915#(and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 1)), 117914#(and (not (= main_~first~0.base main_~x~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= (select |#valid| main_~first~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 1)), 117917#(and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~last~0.base main_~first~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))), 117916#(and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))), 117919#(and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))), 117918#(and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~x~0.base main_~first~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))))] [2018-04-11 13:18:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 24 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:50,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 13:18:50,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 13:18:50,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:18:50,508 INFO L87 Difference]: Start difference. First operand 1048 states and 1163 transitions. Second operand 22 states. [2018-04-11 13:18:51,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:18:51,081 INFO L93 Difference]: Finished difference Result 1117 states and 1247 transitions. [2018-04-11 13:18:51,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 13:18:51,081 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 96 [2018-04-11 13:18:51,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:18:51,081 INFO L225 Difference]: With dead ends: 1117 [2018-04-11 13:18:51,081 INFO L226 Difference]: Without dead ends: 1117 [2018-04-11 13:18:51,082 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=1126, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 13:18:51,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2018-04-11 13:18:51,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1058. [2018-04-11 13:18:51,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1058 states. [2018-04-11 13:18:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1175 transitions. [2018-04-11 13:18:51,086 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1175 transitions. Word has length 96 [2018-04-11 13:18:51,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:18:51,086 INFO L459 AbstractCegarLoop]: Abstraction has 1058 states and 1175 transitions. [2018-04-11 13:18:51,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 13:18:51,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1175 transitions. [2018-04-11 13:18:51,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-04-11 13:18:51,086 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:18:51,087 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:18:51,087 INFO L408 AbstractCegarLoop]: === Iteration 109 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:18:51,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1454457881, now seen corresponding path program 4 times [2018-04-11 13:18:51,087 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:18:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:18:51,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:18:51,701 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 27 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:51,701 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:18:51,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 13:18:51,701 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:18:51,702 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 13:18:51,702 INFO L182 omatonBuilderFactory]: Interpolants [120135#true, 120137#(= 0 |main_#t~malloc1.offset|), 120136#false, 120139#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 120138#(= main_~x~0.offset 0), 120141#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= 0 main_~first~0.offset) (= 20 (select |#length| |main_#t~malloc1.base|)) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset main_~first~0.offset)), 120140#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 120143#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 120142#(and (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 120145#(and (not (= main_~first~0.base main_~x~0.base)) (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) main_~x~0.base) (= (select |#valid| main_~first~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 20 (select |#length| main_~x~0.base)) (= (select |#valid| main_~x~0.base) 1)), 120144#(and (= (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12)) main_~x~0.base) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0) (= main_~last~0.offset main_~first~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~first~0.offset 12))) (= 20 (select |#length| main_~x~0.base)) (= (select |#valid| main_~x~0.base) 1)), 120147#(and (= main_~first~0.offset 0) (= 20 (select |#length| main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~first~0.base) 1) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 120146#(and (= main_~first~0.offset 0) (= 20 (select |#length| main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base)) (= (select |#valid| main_~last~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 120149#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (= (select |#length| main_~last~0.base) 20) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~first~0.base) 1) (= (select |#valid| main_~last~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 120148#(and (= main_~first~0.offset 0) (= 20 (select |#length| main_~last~0.base)) (not (= main_~x~0.base main_~first~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 120151#(and (= main_~first~0.offset 0) (<= 20 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 1)), 120150#(and (not (= main_~first~0.base main_~x~0.base)) (= main_~first~0.offset 0) (<= 20 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= (select |#valid| main_~first~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 1)), 120153#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (<= 20 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 120152#(and (= main_~first~0.offset 0) (<= 20 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 120155#(and (= main_~first~0.offset 0) (<= 20 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 120154#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (<= 20 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 120157#(and (<= 20 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)), 120156#(and (= 0 |main_#t~mem6.offset|) (<= 20 (select |#length| |main_#t~mem6.base|)))] [2018-04-11 13:18:51,702 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 27 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:51,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 13:18:51,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 13:18:51,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:18:51,702 INFO L87 Difference]: Start difference. First operand 1058 states and 1175 transitions. Second operand 23 states. [2018-04-11 13:18:52,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:18:52,650 INFO L93 Difference]: Finished difference Result 1120 states and 1245 transitions. [2018-04-11 13:18:52,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 13:18:52,650 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 96 [2018-04-11 13:18:52,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:18:52,651 INFO L225 Difference]: With dead ends: 1120 [2018-04-11 13:18:52,651 INFO L226 Difference]: Without dead ends: 1120 [2018-04-11 13:18:52,651 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=351, Invalid=1455, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 13:18:52,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2018-04-11 13:18:52,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1055. [2018-04-11 13:18:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1055 states. [2018-04-11 13:18:52,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1170 transitions. [2018-04-11 13:18:52,655 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1170 transitions. Word has length 96 [2018-04-11 13:18:52,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:18:52,655 INFO L459 AbstractCegarLoop]: Abstraction has 1055 states and 1170 transitions. [2018-04-11 13:18:52,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 13:18:52,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1170 transitions. [2018-04-11 13:18:52,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-11 13:18:52,656 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:18:52,656 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:18:52,656 INFO L408 AbstractCegarLoop]: === Iteration 110 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:18:52,656 INFO L82 PathProgramCache]: Analyzing trace with hash 188655608, now seen corresponding path program 3 times [2018-04-11 13:18:52,657 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:18:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:18:52,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:18:53,095 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 22 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:53,095 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:18:53,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 13:18:53,095 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:18:53,095 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 13:18:53,095 INFO L182 omatonBuilderFactory]: Interpolants [122379#false, 122378#true, 122381#(= 0 main_~x~0.offset), 122380#(= 0 |main_#t~malloc1.offset|), 122383#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 1 (select |#valid| main_~last~0.base)) (= main_~last~0.offset main_~first~0.offset)), 122382#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 122385#(and (not (= main_~last~0.base main_~x~0.base)) (= 0 main_~first~0.offset) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset)), 122384#(and (not (= |main_#t~malloc1.base| main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset main_~first~0.offset)), 122387#(and (not (= main_~last~0.base main_~x~0.base)) (or (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)) (and (not (= main_~first~0.base main_~y~0.base)) (= main_~x~0.offset 0))) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset)), 122386#(and (or (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)) (and (not (= main_~first~0.base |main_#t~malloc3.base|)) (= main_~x~0.offset 0))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset)), 122389#(and (or (and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0)) (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset)), 122388#(and (= 1 (select |#valid| main_~x~0.base)) (or (and (= 12 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)) (and (not (= main_~first~0.base main_~y~0.base)) (= main_~x~0.offset 0))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset)), 122391#(and (not (= main_~first~0.base main_~x~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= 1 (select |#valid| main_~x~0.base)) (or (and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0)) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base))))), 122390#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (or (and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0)) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base))))), 122393#(and (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (or (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base))) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))), 122392#(and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (or (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0))) (and (= main_~first~0.offset 0) (= 12 (select |#length| main_~first~0.base)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))), 122395#(and (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) 0))) (not (= main_~x~1.base main_~first~0.base)) (= 1 (select |#valid| main_~first~0.base))), 122394#(and (= 1 (select |#valid| |main_#t~mem6.base|)) (not (= main_~x~1.base |main_#t~mem6.base|)) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) 0)))), 122397#(or (not (= 0 main_~z~0.offset)) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (and (not (= main_~x~1.base main_~first~0.base)) (= 1 (select |#valid| main_~first~0.base)) (not (= main_~z~0.base main_~first~0.base)))), 122396#(and (or (not (= 0 main_~y~1.offset)) (not (= main_~y~1.base main_~first~0.base)) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))) (not (= main_~x~1.base main_~first~0.base)) (= 1 (select |#valid| main_~first~0.base))), 122399#(or (not (= 0 main_~z~0.offset)) (and (not (= main_~x~1.base main_~first~0.base)) (= 1 (select |#valid| main_~first~0.base)) (not (= main_~z~0.base main_~first~0.base))) (not (= main_~x~1.base main_~y~1.base))), 122398#(or (not (= 0 main_~z~0.offset)) (not (= main_~x~1.base |main_#t~mem8.base|)) (and (not (= main_~x~1.base main_~first~0.base)) (= 1 (select |#valid| main_~first~0.base)) (not (= main_~z~0.base main_~first~0.base)))), 122401#(or (and (not (= main_~x~1.base main_~first~0.base)) (= 1 (select |#valid| main_~first~0.base))) (not (= main_~x~1.base main_~y~1.base))), 122400#(or (and (not (= main_~x~1.base main_~first~0.base)) (= 1 (select |#valid| main_~first~0.base)) (not (= main_~z~0.base main_~first~0.base))) (not (= main_~x~1.base main_~y~1.base))), 122403#(= 1 (select |#valid| main_~first~0.base)), 122402#(and (not (= main_~x~1.base main_~first~0.base)) (= 1 (select |#valid| main_~first~0.base)))] [2018-04-11 13:18:53,095 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 22 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:53,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 13:18:53,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 13:18:53,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2018-04-11 13:18:53,096 INFO L87 Difference]: Start difference. First operand 1055 states and 1170 transitions. Second operand 26 states. [2018-04-11 13:18:54,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:18:54,337 INFO L93 Difference]: Finished difference Result 1133 states and 1266 transitions. [2018-04-11 13:18:54,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 13:18:54,337 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 97 [2018-04-11 13:18:54,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:18:54,338 INFO L225 Difference]: With dead ends: 1133 [2018-04-11 13:18:54,338 INFO L226 Difference]: Without dead ends: 1133 [2018-04-11 13:18:54,339 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=508, Invalid=2462, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 13:18:54,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2018-04-11 13:18:54,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1078. [2018-04-11 13:18:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1078 states. [2018-04-11 13:18:54,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1198 transitions. [2018-04-11 13:18:54,343 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1198 transitions. Word has length 97 [2018-04-11 13:18:54,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:18:54,343 INFO L459 AbstractCegarLoop]: Abstraction has 1078 states and 1198 transitions. [2018-04-11 13:18:54,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 13:18:54,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1198 transitions. [2018-04-11 13:18:54,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-04-11 13:18:54,344 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:18:54,344 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-11 13:18:54,344 INFO L408 AbstractCegarLoop]: === Iteration 111 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:18:54,344 INFO L82 PathProgramCache]: Analyzing trace with hash 479092391, now seen corresponding path program 2 times [2018-04-11 13:18:54,344 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:18:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:18:54,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:18:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 15 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:55,042 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:18:55,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-11 13:18:55,043 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:18:55,043 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 13:18:55,043 INFO L182 omatonBuilderFactory]: Interpolants [124677#false, 124676#true, 124679#(= 0 main_~x~0.offset), 124678#(= 0 |main_#t~malloc1.offset|), 124681#(and (= 0 main_~y~0.offset) (= 0 main_~x~0.offset)), 124680#(and (= 0 |main_#t~malloc3.offset|) (= 0 main_~x~0.offset)), 124683#(and (= (select |#valid| main_~y~0.base) 1) (= 0 main_~y~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 124682#(and (= 0 main_~y~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 124685#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~malloc3.base|)) (not (= main_~x~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 124684#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 124687#(and (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 |main_#t~mem4.offset|) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (= 0 main_~y~0.offset) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 124686#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (= 0 main_~y~0.offset) (not (= main_~x~0.base main_~y~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 124689#(and (not (= main_~y~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~y~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset)) (= 0 main_~y~0.offset) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 124688#(and (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~y~0.base)) (= (select |#valid| main_~y~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset)) (= 0 main_~y~0.offset) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 124691#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 124690#(and (= (select |#valid| main_~y~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset)) (= 0 main_~y~0.offset) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 124693#(and (or (not (= main_~y~0.base main_~x~0.base)) (= 0 main_~x~0.offset)) (= main_~y~0.offset 0) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 124692#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~malloc3.base|)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (= 0 |main_#t~malloc3.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 124695#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0)) (or (not (= main_~y~0.base main_~x~0.base)) (= 0 main_~x~0.offset)) (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~y~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset))), 124694#(and (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem4.base|) 0)) (= 0 |main_#t~mem4.offset|) (or (not (= main_~y~0.base main_~x~0.base)) (= 0 main_~x~0.offset)) (= main_~y~0.offset 0) (not (= main_~x~0.base |main_#t~mem4.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base))), 124697#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0)) (or (not (= main_~y~0.base main_~x~0.base)) (= 0 main_~x~0.offset)) (= main_~y~0.offset 0) (not (= main_~y~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)))), 124696#(and (not (= 0 (+ |main_#t~mem5.offset| 4))) (not (= main_~x~0.base |main_#t~mem5.base|)) (not (= main_~y~0.base |main_#t~mem5.base|)) (or (not (= main_~y~0.base main_~x~0.base)) (= 0 main_~x~0.offset)) (= main_~y~0.offset 0) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem5.base|) 0))), 124699#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) 0))), 124698#(and (or (not (= main_~y~0.base main_~x~0.base)) (= 0 main_~x~0.offset)) (or (= main_~y~0.base main_~x~0.base) (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0)) (= main_~y~0.offset 0)))), 124701#(or (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) 0))), 124700#(or (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) 0)) (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset))), 124703#(or (not (= 0 main_~y~1.offset)) (and (= main_~y~1.base main_~x~1.base) (= main_~x~1.offset 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) 0))), 124702#(or (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0)) 0)) (and (= main_~x~1.base |main_#t~mem7.base|) (= main_~x~1.offset 0))), 124705#(or (not (= 0 main_~z~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem8.base|) 0))), 124704#(or (not (= 0 main_~z~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) 0))), 124707#(or (not (= 0 main_~y~1.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset))), 124706#(or (not (= 0 main_~y~1.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (not (= 0 main_~z~0.offset))), 124709#(or (not (= 0 main_~z~0.offset)) (= 0 |main_#t~mem8.offset|)), 124708#(or (= 0 (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (not (= 0 main_~z~0.offset))), 124711#(= 0 main_~y~1.offset), 124710#(or (not (= 0 main_~z~0.offset)) (= 0 main_~y~1.offset)), 124712#(= main_~z~0.offset 0)] [2018-04-11 13:18:55,043 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 15 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:18:55,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 13:18:55,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 13:18:55,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1228, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 13:18:55,044 INFO L87 Difference]: Start difference. First operand 1078 states and 1198 transitions. Second operand 37 states. [2018-04-11 13:18:59,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:18:59,479 INFO L93 Difference]: Finished difference Result 1466 states and 1635 transitions. [2018-04-11 13:18:59,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-04-11 13:18:59,479 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 98 [2018-04-11 13:18:59,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:18:59,480 INFO L225 Difference]: With dead ends: 1466 [2018-04-11 13:18:59,480 INFO L226 Difference]: Without dead ends: 1466 [2018-04-11 13:18:59,481 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3699 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1883, Invalid=12159, Unknown=0, NotChecked=0, Total=14042 [2018-04-11 13:18:59,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2018-04-11 13:18:59,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1077. [2018-04-11 13:18:59,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1077 states. [2018-04-11 13:18:59,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1197 transitions. [2018-04-11 13:18:59,486 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1197 transitions. Word has length 98 [2018-04-11 13:18:59,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:18:59,486 INFO L459 AbstractCegarLoop]: Abstraction has 1077 states and 1197 transitions. [2018-04-11 13:18:59,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 13:18:59,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1197 transitions. [2018-04-11 13:18:59,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-11 13:18:59,487 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:18:59,487 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:18:59,487 INFO L408 AbstractCegarLoop]: === Iteration 112 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:18:59,487 INFO L82 PathProgramCache]: Analyzing trace with hash 2075437623, now seen corresponding path program 5 times [2018-04-11 13:18:59,488 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:18:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:18:59,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:19:00,582 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 9 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:19:00,583 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:19:00,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-11 13:19:00,583 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:19:00,583 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 13:19:00,583 INFO L182 omatonBuilderFactory]: Interpolants [127427#false, 127426#true, 127429#(= main_~x~0.offset 0), 127428#(= 0 |main_#t~malloc1.offset|), 127431#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 127430#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 127433#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~y~0.offset) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 127432#(and (not (= main_~x~0.base |main_#t~malloc3.base|)) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~x~0.offset)), 127435#(and (= (select |#valid| main_~y~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset) main_~x~0.offset) (= 0 main_~y~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (not (= main_~x~0.base main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 127434#(and (= main_~x~0.base |main_#t~mem4.base|) (= |main_#t~mem4.offset| main_~x~0.offset) (= 0 main_~y~0.offset) (not (= main_~x~0.base main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 127437#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 127436#(and (= 1 (select |#valid| main_~y~0.base)) (not (= main_~y~0.base |main_#t~mem5.base|)) (= main_~y~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (not (= main_~x~0.base main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 127439#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (not (= main_~y~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~y~0.offset 0) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) main_~x~0.offset) (not (= main_~x~0.base main_~y~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 127438#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (not (= |main_#t~malloc3.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 127441#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0) main_~x~0.offset) (= main_~y~0.offset 0) (= (select |#valid| main_~y~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset)) (not (= main_~x~0.base main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0))), 127440#(and (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 |main_#t~mem4.offset|) (not (= main_~y~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~y~0.offset 0) (not (= main_~x~0.base |main_#t~mem4.base|)) (= (select (select |#memory_$Pointer$.offset| |main_#t~mem4.base|) 0) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem4.base|) 0)) (not (= main_~x~0.base main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 127443#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= 1 (select |#valid| main_~y~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0) main_~x~0.offset) (= main_~y~0.offset 0) (not (= main_~x~0.base main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0))), 127442#(and (not (= main_~x~0.base |main_#t~mem5.base|)) (= 1 (select |#valid| main_~y~0.base)) (= main_~y~0.offset 0) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (= (select (select |#memory_$Pointer$.offset| |main_#t~mem5.base|) 0) main_~x~0.offset) (not (= (+ |main_#t~mem5.offset| 4) 0)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem5.base|) 0)) (not (= main_~x~0.base main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 127445#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0))) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) 0)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) 0) main_~first~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0))) (= (select |#valid| main_~last~0.base) 1)), 127444#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) 0) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 127447#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0))) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) 0)) (= main_~last~0.base main_~first~0.base) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) 0) main_~first~0.offset)), 127446#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0))) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) 0)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) 0) main_~first~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0) |main_#t~malloc1.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) |main_#t~malloc1.base|))), 127449#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) 0) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) 0))), 127448#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) 0)) (= main_~last~0.base main_~first~0.base) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) 0) main_~first~0.offset)), 127451#(and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) 0)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) 0))), 127450#(and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)) 0)) 0)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)) 0)) 0)) (= main_~x~1.base main_~first~0.base)), 127453#(or (not (= 0 main_~y~1.offset)) (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) 0)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) 0)))), 127452#(and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0)) 0)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) 0)) 0))), 127455#(or (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| |main_#t~mem8.base|) 0)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem8.base|) 0))) (not (= 0 main_~z~0.offset))), 127454#(or (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) 0)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) 0))) (not (= 0 main_~z~0.offset))), 127457#(or (not (= 0 main_~y~1.offset)) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))), 127456#(or (not (= 0 main_~y~1.offset)) (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))), 127459#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset |main_#t~mem8.offset|) (= main_~x~1.base |main_#t~mem8.base|))), 127458#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))), 127461#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base)), 127460#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base)))] [2018-04-11 13:19:00,583 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 9 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:19:00,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 13:19:00,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 13:19:00,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1156, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 13:19:00,584 INFO L87 Difference]: Start difference. First operand 1077 states and 1197 transitions. Second operand 36 states. [2018-04-11 13:19:03,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:19:03,684 INFO L93 Difference]: Finished difference Result 1308 states and 1456 transitions. [2018-04-11 13:19:03,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-11 13:19:03,684 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 99 [2018-04-11 13:19:03,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:19:03,685 INFO L225 Difference]: With dead ends: 1308 [2018-04-11 13:19:03,685 INFO L226 Difference]: Without dead ends: 1308 [2018-04-11 13:19:03,685 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1803 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=781, Invalid=7051, Unknown=0, NotChecked=0, Total=7832 [2018-04-11 13:19:03,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2018-04-11 13:19:03,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1118. [2018-04-11 13:19:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2018-04-11 13:19:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1241 transitions. [2018-04-11 13:19:03,691 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1241 transitions. Word has length 99 [2018-04-11 13:19:03,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:19:03,691 INFO L459 AbstractCegarLoop]: Abstraction has 1118 states and 1241 transitions. [2018-04-11 13:19:03,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 13:19:03,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1241 transitions. [2018-04-11 13:19:03,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-11 13:19:03,691 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:19:03,691 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 13:19:03,691 INFO L408 AbstractCegarLoop]: === Iteration 113 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:19:03,692 INFO L82 PathProgramCache]: Analyzing trace with hash 451968002, now seen corresponding path program 2 times [2018-04-11 13:19:03,692 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:19:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:19:03,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:19:04,411 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 21 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:19:04,411 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:19:04,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 13:19:04,411 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:19:04,412 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 13:19:04,412 INFO L182 omatonBuilderFactory]: Interpolants [129999#true, 130001#(= 0 |main_#t~malloc1.offset|), 130000#false, 130003#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 130002#(= 0 main_~x~0.offset), 130005#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset main_~first~0.offset)), 130004#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 130007#(and (or (= 12 (select |#length| main_~last~0.base)) (not (= main_~first~0.base |main_#t~malloc3.base|))) (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 130006#(and (not (= main_~last~0.base main_~x~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 130009#(and (not (= main_~last~0.base main_~x~0.base)) (= 0 main_~first~0.offset) (or (not (= main_~first~0.base main_~y~0.base)) (= 12 (select |#length| main_~last~0.base))) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 130008#(and (not (= main_~last~0.base main_~x~0.base)) (= 0 main_~first~0.offset) (or (not (= main_~first~0.base main_~y~0.base)) (= 12 (select |#length| main_~last~0.base))) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 130011#(and (or (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| main_~last~0.base))) (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 130010#(and (= (select |#valid| main_~y~0.base) 1) (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (or (not (= main_~first~0.base main_~y~0.base)) (= 12 (select |#length| main_~last~0.base))) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 130013#(and (not (= main_~first~0.base main_~x~0.base)) (= main_~first~0.offset 0) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) main_~x~0.base) (= (select |#valid| main_~first~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 130012#(and (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12)) main_~x~0.base) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 130015#(and (= main_~first~0.offset 0) (not (= main_~last~0.base |main_#t~malloc1.base|)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) 0))) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= (+ main_~last~0.offset 12) 0)) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) 0)))), 130014#(and (= main_~first~0.offset 0) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) 0))) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~first~0.base) 1) (not (= (+ main_~last~0.offset 12) 0)) (not (= main_~last~0.base main_~first~0.base)) (= (select |#valid| main_~last~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) 0)))), 130017#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) 0))) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) 0)))), 130016#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) 0))) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= (+ main_~last~0.offset 12) 0)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) 0)))), 130019#(and (= main_~first~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0))) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 130018#(and (= main_~first~0.offset 0) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 130021#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) 0))) (= 0 main_~first~0.offset) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) 0)))), 130020#(and (= 0 |main_#t~mem6.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) 0))) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) 0)))), 130023#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset))) (= main_~x~1.base main_~first~0.base)), 130022#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) 0))) (= 0 main_~first~0.offset)), 130025#(= 1 (select |#valid| |main_#t~mem7.base|)), 130024#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))), 130026#(= 1 (select |#valid| main_~y~1.base))] [2018-04-11 13:19:04,412 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 21 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:19:04,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 13:19:04,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 13:19:04,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2018-04-11 13:19:04,412 INFO L87 Difference]: Start difference. First operand 1118 states and 1241 transitions. Second operand 28 states. [2018-04-11 13:19:05,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:19:05,719 INFO L93 Difference]: Finished difference Result 1203 states and 1337 transitions. [2018-04-11 13:19:05,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 13:19:05,719 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 99 [2018-04-11 13:19:05,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:19:05,720 INFO L225 Difference]: With dead ends: 1203 [2018-04-11 13:19:05,720 INFO L226 Difference]: Without dead ends: 1203 [2018-04-11 13:19:05,720 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=478, Invalid=3062, Unknown=0, NotChecked=0, Total=3540 [2018-04-11 13:19:05,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2018-04-11 13:19:05,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1119. [2018-04-11 13:19:05,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-04-11 13:19:05,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1243 transitions. [2018-04-11 13:19:05,725 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1243 transitions. Word has length 99 [2018-04-11 13:19:05,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:19:05,725 INFO L459 AbstractCegarLoop]: Abstraction has 1119 states and 1243 transitions. [2018-04-11 13:19:05,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 13:19:05,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1243 transitions. [2018-04-11 13:19:05,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-11 13:19:05,726 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:19:05,726 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 13:19:05,726 INFO L408 AbstractCegarLoop]: === Iteration 114 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:19:05,726 INFO L82 PathProgramCache]: Analyzing trace with hash 451968003, now seen corresponding path program 2 times [2018-04-11 13:19:05,726 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:19:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:19:05,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:19:06,492 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 17 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:19:06,492 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:19:06,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 13:19:06,492 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:19:06,492 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 13:19:06,492 INFO L182 omatonBuilderFactory]: Interpolants [132418#false, 132419#(= 0 |main_#t~malloc1.offset|), 132417#true, 132422#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 132423#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset main_~first~0.offset)), 132420#(= 0 main_~x~0.offset), 132421#(and (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 132426#(and (= 12 (select |#length| main_~y~0.base)) (not (= main_~last~0.base main_~x~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 main_~y~0.offset) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 132427#(and (= 12 (select |#length| main_~y~0.base)) (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 main_~y~0.offset) (= main_~last~0.offset main_~first~0.offset) (not (= (select |#valid| main_~x~0.base) 0)) (= 0 main_~x~0.offset)), 132424#(and (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset)), 132425#(and (not (= main_~last~0.base main_~x~0.base)) (= 0 main_~first~0.offset) (= 0 |main_#t~malloc3.offset|) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset) (= 12 (select |#length| |main_#t~malloc3.base|))), 132430#(and (not (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~last~0.base main_~x~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~last~0.offset main_~first~0.offset) (not (= (select |#valid| main_~x~0.base) 0)) (= 0 main_~x~0.offset)), 132431#(and (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12)) main_~x~0.base) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select |#valid| main_~last~0.base) 0)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~last~0.offset main_~first~0.offset) (not (= (select |#valid| main_~x~0.base) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~first~0.offset 12))) (= 0 main_~x~0.offset)), 132428#(and (= (select |#valid| main_~y~0.base) 1) (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= (select |#length| main_~y~0.base) 12) (= main_~last~0.base main_~first~0.base) (= 0 main_~y~0.offset) (= main_~last~0.offset main_~first~0.offset) (not (= (select |#valid| main_~x~0.base) 0)) (= 0 main_~x~0.offset)), 132429#(and (not (= (select |#valid| main_~y~0.base) 0)) (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= (select |#length| main_~y~0.base) 12) (= main_~last~0.base main_~first~0.base) (= 0 main_~y~0.offset) (= main_~last~0.offset main_~first~0.offset) (not (= (select |#valid| main_~x~0.base) 0)) (= 0 main_~x~0.offset)), 132434#(and (= main_~first~0.offset 0) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) 0)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) 0))) (not (= (+ main_~last~0.offset 12) 0)) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 132435#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) 0)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) 0))) (not (= (+ main_~last~0.offset 12) 0)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 132432#(and (not (= main_~first~0.base main_~x~0.base)) (= main_~first~0.offset 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) main_~x~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= (select |#valid| main_~x~0.base) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 main_~x~0.offset) (not (= (select |#valid| main_~first~0.base) 0))), 132433#(and (= main_~first~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) 0)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= (select |#valid| main_~last~0.base) 0)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) 0))) (not (= (+ main_~last~0.offset 12) 0)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) 0)) 0)) (not (= (select |#valid| main_~first~0.base) 0))), 132438#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem6.base|) 0)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) 0))) (= 0 |main_#t~mem6.offset|)), 132439#(and (= 0 main_~first~0.offset) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) 0))), 132436#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) 0)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 132437#(and (= main_~first~0.offset 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 132442#(and (<= 12 (select |#length| |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 132443#(and (= main_~y~1.offset 0) (<= 12 (select |#length| main_~y~1.base))), 132440#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~x~1.offset)) (= main_~x~1.base main_~first~0.base) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset)))), 132441#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset)))] [2018-04-11 13:19:06,492 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 17 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:19:06,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 13:19:06,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 13:19:06,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2018-04-11 13:19:06,493 INFO L87 Difference]: Start difference. First operand 1119 states and 1243 transitions. Second operand 27 states. [2018-04-11 13:19:07,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:19:07,944 INFO L93 Difference]: Finished difference Result 1239 states and 1371 transitions. [2018-04-11 13:19:07,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 13:19:07,944 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 99 [2018-04-11 13:19:07,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:19:07,945 INFO L225 Difference]: With dead ends: 1239 [2018-04-11 13:19:07,945 INFO L226 Difference]: Without dead ends: 1239 [2018-04-11 13:19:07,945 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=421, Invalid=2549, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 13:19:07,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2018-04-11 13:19:07,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1122. [2018-04-11 13:19:07,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1122 states. [2018-04-11 13:19:07,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1247 transitions. [2018-04-11 13:19:07,950 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1247 transitions. Word has length 99 [2018-04-11 13:19:07,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:19:07,950 INFO L459 AbstractCegarLoop]: Abstraction has 1122 states and 1247 transitions. [2018-04-11 13:19:07,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 13:19:07,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1247 transitions. [2018-04-11 13:19:07,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-11 13:19:07,951 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:19:07,951 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:19:07,951 INFO L408 AbstractCegarLoop]: === Iteration 115 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:19:07,951 INFO L82 PathProgramCache]: Analyzing trace with hash -2083777895, now seen corresponding path program 1 times [2018-04-11 13:19:07,951 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:19:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:19:07,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:19:08,570 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 14 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:19:08,570 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:19:08,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-11 13:19:08,570 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:19:08,570 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 13:19:08,570 INFO L182 omatonBuilderFactory]: Interpolants [134866#false, 134867#(= 0 |main_#t~malloc1.offset|), 134865#true, 134870#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 134871#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset main_~first~0.offset)), 134868#(= main_~x~0.offset 0), 134869#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 134874#(and (not (= main_~first~0.base main_~x~0.base)) (= main_~first~0.offset 0) (= (select |#valid| main_~first~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 134875#(and (= main_~first~0.offset 0) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 134872#(and (not (= main_~last~0.base main_~x~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 134873#(and (= main_~first~0.offset 0) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~first~0.offset 12)))), 134878#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 134879#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 12 (select |#length| |main_#t~malloc3.base|))), 134876#(and (= main_~first~0.offset 0) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 134877#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 134882#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~y~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)))))), 134883#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~x~0.base main_~first~0.base)) (not (= |main_#t~mem5.base| main_~first~0.base)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~y~0.base main_~first~0.base))))), 134880#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~y~0.base main_~first~0.base))))), 134881#(and (= main_~first~0.offset 0) (or (and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base |main_#t~mem4.base|)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~y~0.base main_~first~0.base))) (= 12 (select |#length| main_~first~0.base)))), 134886#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~x~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))))), 134887#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))))), 134884#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~y~0.base main_~first~0.base))))), 134885#(and (= main_~first~0.offset 0) (or (and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 12 (select |#length| main_~first~0.base)))), 134890#(and (<= 16 (select |#length| main_~x~1.base)) (= 0 main_~first~0.offset)), 134891#(and (= 0 main_~first~0.offset) (not (= (select |#length| main_~x~1.base) 12))), 134888#(and (= main_~first~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 12 (select |#length| main_~x~1.base))) (= main_~x~1.base main_~first~0.base)), 134889#(and (<= 16 (select |#length| main_~x~1.base)) (= 0 |main_#t~mem6.offset|)), 134894#(<= main_~x~1.offset 0), 134895#(and (<= 0 main_~x~1.offset) (<= main_~x~1.offset 0)), 134892#(= 0 main_~first~0.offset), 134893#(and (= main_~first~0.offset 0) (= main_~first~0.offset main_~x~1.offset))] [2018-04-11 13:19:08,571 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 14 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:19:08,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 13:19:08,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 13:19:08,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=800, Unknown=0, NotChecked=0, Total=930 [2018-04-11 13:19:08,571 INFO L87 Difference]: Start difference. First operand 1122 states and 1247 transitions. Second operand 31 states. [2018-04-11 13:19:09,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:19:09,892 INFO L93 Difference]: Finished difference Result 1207 states and 1340 transitions. [2018-04-11 13:19:09,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 13:19:09,892 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 99 [2018-04-11 13:19:09,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:19:09,893 INFO L225 Difference]: With dead ends: 1207 [2018-04-11 13:19:09,893 INFO L226 Difference]: Without dead ends: 1207 [2018-04-11 13:19:09,893 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=649, Invalid=2891, Unknown=0, NotChecked=0, Total=3540 [2018-04-11 13:19:09,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-04-11 13:19:09,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1085. [2018-04-11 13:19:09,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1085 states. [2018-04-11 13:19:09,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1204 transitions. [2018-04-11 13:19:09,897 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1204 transitions. Word has length 99 [2018-04-11 13:19:09,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:19:09,898 INFO L459 AbstractCegarLoop]: Abstraction has 1085 states and 1204 transitions. [2018-04-11 13:19:09,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 13:19:09,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1204 transitions. [2018-04-11 13:19:09,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-11 13:19:09,898 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:19:09,898 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 13:19:09,898 INFO L408 AbstractCegarLoop]: === Iteration 116 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 13:19:09,898 INFO L82 PathProgramCache]: Analyzing trace with hash -2083777844, now seen corresponding path program 3 times [2018-04-11 13:19:09,899 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:19:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:19:09,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:19:10,980 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 23 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:19:10,980 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:19:10,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-11 13:19:10,980 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:19:10,981 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 13:19:10,981 INFO L182 omatonBuilderFactory]: Interpolants [137280#(= 1 (select |#valid| |main_#t~mem7.base|)), 137281#(= 1 (select |#valid| main_~y~1.base)), 137250#true, 137251#false, 137254#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 137255#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 137252#(= 0 |main_#t~malloc1.offset|), 137253#(= 0 main_~x~0.offset), 137258#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 137259#(and (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 137256#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset main_~first~0.offset)), 137257#(and (not (= main_~last~0.base main_~x~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 0 main_~x~0.offset)), 137262#(and (= main_~first~0.offset 0) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base)) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~last~0.base) 0)) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 137263#(and (= main_~first~0.offset 0) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base)) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~last~0.base) 0)) (= main_~last~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 137260#(and (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12)) main_~x~0.base) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 137261#(and (not (= main_~first~0.base main_~x~0.base)) (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) main_~x~0.base) (= (select |#valid| main_~first~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 137266#(and (= main_~first~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~last~0.base)) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (= 12 (select |#length| main_~last~0.base)) (not (= main_~last~0.base |main_#t~malloc3.base|))) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~last~0.base main_~first~0.base)) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~last~0.base) 0)) (or (= 12 (select |#length| main_~first~0.base)) (not (= main_~first~0.base |main_#t~malloc3.base|))) (= main_~last~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 137267#(and (= main_~first~0.offset 0) (or (and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (or (= 12 (select |#length| main_~last~0.base)) (and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~last~0.base) 0)) (not (= main_~y~0.base main_~last~0.base)))) (not (= main_~last~0.base main_~first~0.base)) (= main_~last~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~y~0.base main_~first~0.base))) (= 12 (select |#length| main_~first~0.base)))), 137264#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~last~0.base main_~first~0.base)) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~last~0.base) 0)) (= main_~last~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 137265#(and (= main_~first~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~last~0.base)) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~last~0.base main_~first~0.base)) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~last~0.base) 0)) (= main_~last~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 137270#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~x~0.base main_~last~0.base)) (or (and (not (= |main_#t~mem5.base| main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~last~0.base) 0)) (not (= main_~y~0.base main_~last~0.base))) (= 12 (select |#length| main_~last~0.base))) (not (= |main_#t~mem5.base| main_~first~0.base)) (not (= main_~last~0.base main_~first~0.base)) (= main_~last~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~y~0.base main_~first~0.base))))), 137271#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~x~0.base main_~last~0.base)) (or (and (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~last~0.base) 0)) (not (= main_~y~0.base main_~last~0.base))) (= 12 (select |#length| main_~last~0.base))) (not (= main_~last~0.base main_~first~0.base)) (= main_~last~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~y~0.base main_~first~0.base))))), 137268#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~x~0.base main_~last~0.base)) (not (= main_~first~0.base |main_#t~mem4.base|)) (or (= 12 (select |#length| main_~last~0.base)) (and (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~last~0.base) 0)) (not (= |main_#t~mem4.base| main_~last~0.base)) (not (= main_~y~0.base main_~last~0.base)))) (not (= main_~last~0.base main_~first~0.base)) (= main_~last~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~y~0.base main_~first~0.base))))), 137269#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (or (= 12 (select |#length| main_~last~0.base)) (and (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~last~0.base) 0)) (not (= main_~y~0.base main_~last~0.base)))) (not (= main_~x~0.base main_~first~0.base)) (not (= main_~x~0.base main_~last~0.base)) (not (= main_~last~0.base main_~first~0.base)) (= main_~last~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~y~0.base main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)))))), 137274#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))))), 137275#(and (= main_~first~0.offset 0) (or (and (= main_~x~1.base main_~first~0.base) (= 12 (select |#length| main_~x~1.base))) (and (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))))), 137272#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~x~0.base main_~first~0.base)) (or (and (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~last~0.base) 0))) (= 12 (select |#length| main_~last~0.base))) (not (= main_~x~0.base main_~last~0.base)) (not (= main_~last~0.base main_~first~0.base)) (= main_~last~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))))), 137273#(and (= main_~first~0.offset 0) (or (= 12 (select |#length| main_~first~0.base)) (and (not (= main_~x~0.base main_~first~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~last~0.base) 0)) (= main_~last~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))))), 137278#(and (= main_~x~1.base main_~first~0.base) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~x~1.offset))), 137279#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))), 137276#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) 0)) (= 0 |main_#t~mem6.offset|)), 137277#(and (= 0 main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) 0)))] [2018-04-11 13:19:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 23 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:19:10,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 13:19:10,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 13:19:10,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2018-04-11 13:19:10,981 INFO L87 Difference]: Start difference. First operand 1085 states and 1204 transitions. Second operand 32 states. Received shutdown request... [2018-04-11 13:19:11,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 13:19:11,385 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 13:19:11,389 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 13:19:11,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 01:19:11 BoogieIcfgContainer [2018-04-11 13:19:11,389 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 13:19:11,390 INFO L168 Benchmark]: Toolchain (without parser) took 171948.10 ms. Allocated memory was 404.2 MB in the beginning and 1.0 GB in the end (delta: 602.4 MB). Free memory was 335.7 MB in the beginning and 531.8 MB in the end (delta: -196.1 MB). Peak memory consumption was 406.3 MB. Max. memory is 5.3 GB. [2018-04-11 13:19:11,391 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 404.2 MB. Free memory is still 364.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 13:19:11,391 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.89 ms. Allocated memory is still 404.2 MB. Free memory was 335.7 MB in the beginning and 310.3 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. [2018-04-11 13:19:11,391 INFO L168 Benchmark]: Boogie Preprocessor took 40.50 ms. Allocated memory is still 404.2 MB. Free memory was 310.3 MB in the beginning and 307.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 13:19:11,391 INFO L168 Benchmark]: RCFGBuilder took 447.93 ms. Allocated memory was 404.2 MB in the beginning and 593.0 MB in the end (delta: 188.7 MB). Free memory was 307.7 MB in the beginning and 520.4 MB in the end (delta: -212.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 5.3 GB. [2018-04-11 13:19:11,392 INFO L168 Benchmark]: TraceAbstraction took 171215.69 ms. Allocated memory was 593.0 MB in the beginning and 1.0 GB in the end (delta: 413.7 MB). Free memory was 520.4 MB in the beginning and 531.8 MB in the end (delta: -11.3 MB). Peak memory consumption was 402.3 MB. Max. memory is 5.3 GB. [2018-04-11 13:19:11,392 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.13 ms. Allocated memory is still 404.2 MB. Free memory is still 364.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 240.89 ms. Allocated memory is still 404.2 MB. Free memory was 335.7 MB in the beginning and 310.3 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.50 ms. Allocated memory is still 404.2 MB. Free memory was 310.3 MB in the beginning and 307.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 447.93 ms. Allocated memory was 404.2 MB in the beginning and 593.0 MB in the end (delta: 188.7 MB). Free memory was 307.7 MB in the beginning and 520.4 MB in the end (delta: -212.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 171215.69 ms. Allocated memory was 593.0 MB in the beginning and 1.0 GB in the end (delta: 413.7 MB). Free memory was 520.4 MB in the beginning and 531.8 MB in the end (delta: -11.3 MB). Peak memory consumption was 402.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 649]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 649]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1085states) and interpolant automaton (currently 11 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 98 locations, 39 error locations. TIMEOUT Result, 171.1s OverallTime, 116 OverallIterations, 5 TraceHistogramMax, 122.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8149 SDtfs, 45525 SDslu, 80686 SDs, 0 SdLazy, 112212 SolverSat, 9527 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 43.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5919 GetRequests, 866 SyntacticMatches, 275 SemanticMatches, 4777 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60835 ImplicationChecksByTransitivity, 106.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1122occurred in iteration=114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 1251/4526 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 115 MinimizatonAttempts, 10808 StatesRemovedByMinimization, 111 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 45.1s InterpolantComputationTime, 8042 NumberOfCodeBlocks, 8042 NumberOfCodeBlocksAsserted, 116 NumberOfCheckSat, 7926 ConstructedInterpolants, 0 QuantifiedInterpolants, 12385172 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 116 InterpolantComputations, 23 PerfectInterpolantSequences, 1251/4526 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_13-19-11-398.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_13-19-11-398.csv Completed graceful shutdown