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/list-ext-properties/test-0504_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 13:50:35,570 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 13:50:35,571 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 13:50:35,585 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 13:50:35,585 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 13:50:35,586 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 13:50:35,587 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 13:50:35,588 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 13:50:35,590 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 13:50:35,591 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 13:50:35,591 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 13:50:35,592 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 13:50:35,592 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 13:50:35,593 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 13:50:35,594 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 13:50:35,595 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 13:50:35,597 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 13:50:35,598 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 13:50:35,599 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 13:50:35,600 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 13:50:35,602 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 13:50:35,602 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 13:50:35,602 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 13:50:35,603 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 13:50:35,604 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 13:50:35,605 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 13:50:35,605 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 13:50:35,605 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 13:50:35,606 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 13:50:35,606 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 13:50:35,607 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 13:50:35,607 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:50:35,628 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 13:50:35,629 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 13:50:35,630 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 13:50:35,630 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 13:50:35,630 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 13:50:35,630 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 13:50:35,631 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 13:50:35,631 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 13:50:35,631 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 13:50:35,631 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 13:50:35,631 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 13:50:35,632 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 13:50:35,632 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 13:50:35,632 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 13:50:35,632 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 13:50:35,632 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 13:50:35,632 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 13:50:35,633 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 13:50:35,633 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 13:50:35,633 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 13:50:35,633 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 13:50:35,633 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:50:35,663 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 13:50:35,678 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 13:50:35,682 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 13:50:35,683 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 13:50:35,683 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 13:50:35,684 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,027 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG8ebdda21b [2018-04-11 13:50:36,142 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 13:50:36,142 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 13:50:36,142 INFO L168 CDTParser]: Scanning test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,150 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 13:50:36,150 INFO L215 ultiparseSymbolTable]: [2018-04-11 13:50:36,150 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 13:50:36,150 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,150 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 13:50:36,150 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__uid_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,150 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uint32_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,150 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fd_set in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,151 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__lldiv_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,151 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____id_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,151 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____qaddr_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,151 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__int16_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,151 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____rlim64_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,151 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fsblkcnt_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,151 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__blksize_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____blksize_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____int32_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____dev_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsblkcnt_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__div_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__time_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_key_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_rwlock_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_short in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int32_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__key_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__caddr_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__sigset_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__mode_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____caddr_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ulong in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int64_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,152 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ino_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__clock_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pid_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ldiv_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsfilcnt64_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uint16_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____int8_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____loff_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__daddr_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__int64_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_mutex_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsfilcnt_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____WAIT_STATUS in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_barrierattr_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____swblk_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__register_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____daddr_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____key_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,153 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____int64_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_quad_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ushort in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____time_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__int8_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uint8_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__loff_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_condattr_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__dev_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____useconds_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__id_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__wchar_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____clockid_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__clockid_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____clock_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____sig_atomic_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_int in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,154 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fd_mask in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__quad_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int16_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int8_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_cond_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fsid_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____sigset_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__suseconds_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____blkcnt_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fd_mask in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_once_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uint64_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_spinlock_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_long in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____ino_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____ino64_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__gid_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,155 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uid_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_short in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ssize_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__nlink_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsid_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__uint in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____socklen_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____blkcnt64_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____ssize_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_rwlockattr_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____mode_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fsfilcnt_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____off_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,156 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__int32_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____gid_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_long in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____nlink_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____intptr_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____int16_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__timer_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__blkcnt_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__size_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_char in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__off_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsblkcnt64_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,157 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____pthread_list_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,158 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_mutexattr_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,158 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____rlim_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,158 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____timer_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,158 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,158 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_attr_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,158 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_barrier_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,158 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_quad_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,158 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____pid_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,158 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____quad_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,159 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____off64_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,159 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____suseconds_t in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,159 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_char in test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:36,172 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG8ebdda21b [2018-04-11 13:50:36,176 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 13:50:36,178 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 13:50:36,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 13:50:36,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 13:50:36,182 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 13:50:36,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 01:50:36" (1/1) ... [2018-04-11 13:50:36,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16c04757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:50:36, skipping insertion in model container [2018-04-11 13:50:36,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 01:50:36" (1/1) ... [2018-04-11 13:50:36,196 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 13:50:36,219 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 13:50:36,353 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 13:50:36,393 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 13:50:36,399 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 113 non ball SCCs. Number of states in SCCs 113. [2018-04-11 13:50:36,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:50:36 WrapperNode [2018-04-11 13:50:36,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 13:50:36,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 13:50:36,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 13:50:36,438 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 13:50:36,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:50:36" (1/1) ... [2018-04-11 13:50:36,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:50:36" (1/1) ... [2018-04-11 13:50:36,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:50:36" (1/1) ... [2018-04-11 13:50:36,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:50:36" (1/1) ... [2018-04-11 13:50:36,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:50:36" (1/1) ... [2018-04-11 13:50:36,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:50:36" (1/1) ... [2018-04-11 13:50:36,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:50:36" (1/1) ... [2018-04-11 13:50:36,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 13:50:36,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 13:50:36,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 13:50:36,483 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 13:50:36,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:50:36" (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:50:36,580 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 13:50:36,580 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 13:50:36,580 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 13:50:36,580 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 13:50:36,580 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 13:50:36,580 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 13:50:36,581 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 13:50:36,581 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 13:50:36,581 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 13:50:36,581 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 13:50:36,581 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 13:50:36,581 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 13:50:36,581 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 13:50:36,581 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 13:50:36,581 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 13:50:36,581 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 13:50:36,582 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 13:50:36,582 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 13:50:36,582 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 13:50:36,582 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 13:50:36,582 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 13:50:36,582 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 13:50:36,582 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 13:50:36,582 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 13:50:36,583 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 13:50:36,583 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 13:50:36,583 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 13:50:36,583 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 13:50:36,583 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 13:50:36,583 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 13:50:36,583 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 13:50:36,583 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 13:50:36,583 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 13:50:36,584 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 13:50:36,584 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 13:50:36,584 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 13:50:36,584 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 13:50:36,584 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 13:50:36,584 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 13:50:36,584 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 13:50:36,584 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 13:50:36,584 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 13:50:36,585 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 13:50:36,585 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 13:50:36,585 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 13:50:36,585 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 13:50:36,585 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 13:50:36,585 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 13:50:36,585 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 13:50:36,585 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 13:50:36,585 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 13:50:36,586 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 13:50:36,586 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 13:50:36,586 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 13:50:36,586 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 13:50:36,586 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 13:50:36,586 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 13:50:36,586 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 13:50:36,586 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 13:50:36,586 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 13:50:36,587 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 13:50:36,587 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 13:50:36,587 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 13:50:36,587 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 13:50:36,587 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 13:50:36,587 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 13:50:36,587 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 13:50:36,587 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 13:50:36,587 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 13:50:36,587 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 13:50:36,588 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 13:50:36,588 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 13:50:36,588 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 13:50:36,588 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 13:50:36,588 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 13:50:36,588 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 13:50:36,588 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 13:50:36,588 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 13:50:36,588 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 13:50:36,588 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 13:50:36,588 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 13:50:36,589 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 13:50:36,589 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 13:50:36,589 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 13:50:36,589 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 13:50:36,589 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 13:50:36,589 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 13:50:36,589 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 13:50:36,589 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 13:50:36,589 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 13:50:36,589 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 13:50:36,590 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 13:50:36,590 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 13:50:36,590 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 13:50:36,590 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 13:50:36,590 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 13:50:36,590 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 13:50:36,590 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 13:50:36,590 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 13:50:36,590 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 13:50:36,590 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 13:50:36,591 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 13:50:36,591 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 13:50:36,591 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 13:50:36,591 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 13:50:36,591 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 13:50:36,591 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 13:50:36,591 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 13:50:36,591 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 13:50:36,591 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 13:50:36,591 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 13:50:36,592 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 13:50:36,592 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 13:50:36,592 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 13:50:36,592 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 13:50:36,592 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 13:50:37,012 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 13:50:37,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 01:50:37 BoogieIcfgContainer [2018-04-11 13:50:37,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 13:50:37,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 13:50:37,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 13:50:37,017 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 13:50:37,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 01:50:36" (1/3) ... [2018-04-11 13:50:37,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b276ea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 01:50:37, skipping insertion in model container [2018-04-11 13:50:37,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:50:36" (2/3) ... [2018-04-11 13:50:37,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b276ea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 01:50:37, skipping insertion in model container [2018-04-11 13:50:37,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 01:50:37" (3/3) ... [2018-04-11 13:50:37,021 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0504_1_true-valid-memsafety.i [2018-04-11 13:50:37,030 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-11 13:50:37,039 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-04-11 13:50:37,075 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 13:50:37,076 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 13:50:37,076 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 13:50:37,076 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-11 13:50:37,077 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-11 13:50:37,077 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 13:50:37,077 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 13:50:37,077 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 13:50:37,077 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 13:50:37,078 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 13:50:37,091 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2018-04-11 13:50:37,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-04-11 13:50:37,100 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:50:37,100 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:50:37,101 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-11 13:50:37,104 INFO L82 PathProgramCache]: Analyzing trace with hash -2019747464, now seen corresponding path program 1 times [2018-04-11 13:50:37,138 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:50:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:50:37,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:50:37,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:50:37,187 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:50:37,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 13:50:37,188 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:50:37,188 INFO 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:50:37,189 INFO L182 omatonBuilderFactory]: Interpolants [108#true, 109#false] [2018-04-11 13:50:37,189 INFO 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:50:37,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-11 13:50:37,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-11 13:50:37,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-11 13:50:37,200 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 2 states. [2018-04-11 13:50:37,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:50:37,216 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2018-04-11 13:50:37,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-11 13:50:37,218 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-04-11 13:50:37,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:50:37,225 INFO L225 Difference]: With dead ends: 105 [2018-04-11 13:50:37,225 INFO L226 Difference]: Without dead ends: 102 [2018-04-11 13:50:37,227 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:50:37,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-11 13:50:37,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-04-11 13:50:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-11 13:50:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2018-04-11 13:50:37,257 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 10 [2018-04-11 13:50:37,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:50:37,257 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2018-04-11 13:50:37,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-11 13:50:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-04-11 13:50:37,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 13:50:37,258 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:50:37,258 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:50:37,258 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-11 13:50:37,258 INFO L82 PathProgramCache]: Analyzing trace with hash 328561019, now seen corresponding path program 1 times [2018-04-11 13:50:37,259 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:50:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:50:37,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:50:37,301 INFO 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:50:37,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:50:37,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:50:37,301 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:50:37,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:50:37,302 INFO L182 omatonBuilderFactory]: Interpolants [317#true, 318#false, 319#(= main_~c1~0 0)] [2018-04-11 13:50:37,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:50:37,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 13:50:37,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 13:50:37,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:50:37,304 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 3 states. [2018-04-11 13:50:37,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:50:37,327 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2018-04-11 13:50:37,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 13:50:37,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-04-11 13:50:37,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:50:37,328 INFO L225 Difference]: With dead ends: 111 [2018-04-11 13:50:37,328 INFO L226 Difference]: Without dead ends: 111 [2018-04-11 13:50:37,328 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:50:37,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-04-11 13:50:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2018-04-11 13:50:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-11 13:50:37,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2018-04-11 13:50:37,333 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 13 [2018-04-11 13:50:37,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:50:37,334 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-04-11 13:50:37,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 13:50:37,334 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2018-04-11 13:50:37,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 13:50:37,334 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:50:37,334 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:50:37,334 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-11 13:50:37,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1595456672, now seen corresponding path program 1 times [2018-04-11 13:50:37,335 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:50:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:50:37,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:50:37,355 INFO 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:50:37,355 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:50:37,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 13:50:37,355 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:50:37,356 INFO 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:50:37,356 INFO L182 omatonBuilderFactory]: Interpolants [539#true, 540#false, 541#(= |#valid| |old(#valid)|)] [2018-04-11 13:50:37,356 INFO 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:50:37,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 13:50:37,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 13:50:37,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:50:37,356 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 3 states. [2018-04-11 13:50:37,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:50:37,437 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2018-04-11 13:50:37,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 13:50:37,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-04-11 13:50:37,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:50:37,439 INFO L225 Difference]: With dead ends: 111 [2018-04-11 13:50:37,439 INFO L226 Difference]: Without dead ends: 107 [2018-04-11 13:50:37,439 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:50:37,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-11 13:50:37,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-04-11 13:50:37,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-04-11 13:50:37,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2018-04-11 13:50:37,445 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 14 [2018-04-11 13:50:37,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:50:37,446 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2018-04-11 13:50:37,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 13:50:37,446 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2018-04-11 13:50:37,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 13:50:37,446 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:50:37,446 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:50:37,446 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-11 13:50:37,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1594374816, now seen corresponding path program 1 times [2018-04-11 13:50:37,447 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:50:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:50:37,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:50:37,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:50:37,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:50:37,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:50:37,481 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:50:37,481 INFO 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:50:37,481 INFO L182 omatonBuilderFactory]: Interpolants [759#true, 760#false, 761#(= 1 (select |#valid| |main_#t~malloc3.base|)), 762#(= 1 (select |#valid| main_~x~0.base))] [2018-04-11 13:50:37,481 INFO 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:50:37,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:50:37,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:50:37,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:50:37,482 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand 4 states. [2018-04-11 13:50:37,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:50:37,597 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2018-04-11 13:50:37,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 13:50:37,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-11 13:50:37,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:50:37,599 INFO L225 Difference]: With dead ends: 133 [2018-04-11 13:50:37,599 INFO L226 Difference]: Without dead ends: 133 [2018-04-11 13:50:37,600 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:50:37,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-11 13:50:37,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 98. [2018-04-11 13:50:37,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-11 13:50:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2018-04-11 13:50:37,606 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 14 [2018-04-11 13:50:37,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:50:37,607 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2018-04-11 13:50:37,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:50:37,607 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2018-04-11 13:50:37,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 13:50:37,608 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:50:37,608 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:50:37,608 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-11 13:50:37,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1594374817, now seen corresponding path program 1 times [2018-04-11 13:50:37,609 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:50:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:50:37,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:50:37,672 INFO 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:50:37,673 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:50:37,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:50:37,673 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:50:37,673 INFO 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:50:37,674 INFO L182 omatonBuilderFactory]: Interpolants [997#true, 998#false, 999#(and (= 20 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 1000#(and (= main_~x~0.offset 0) (= 20 (select |#length| main_~x~0.base)))] [2018-04-11 13:50:37,674 INFO 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:50:37,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:50:37,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:50:37,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:50:37,675 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 4 states. [2018-04-11 13:50:37,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:50:37,765 INFO L93 Difference]: Finished difference Result 144 states and 159 transitions. [2018-04-11 13:50:37,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 13:50:37,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-11 13:50:37,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:50:37,766 INFO L225 Difference]: With dead ends: 144 [2018-04-11 13:50:37,766 INFO L226 Difference]: Without dead ends: 144 [2018-04-11 13:50:37,766 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:50:37,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-04-11 13:50:37,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 101. [2018-04-11 13:50:37,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-11 13:50:37,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2018-04-11 13:50:37,771 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 14 [2018-04-11 13:50:37,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:50:37,772 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2018-04-11 13:50:37,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:50:37,772 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2018-04-11 13:50:37,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 13:50:37,773 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:50:37,773 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:50:37,773 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-11 13:50:37,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1816054924, now seen corresponding path program 1 times [2018-04-11 13:50:37,774 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:50:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:50:37,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:50:37,825 INFO 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:50:37,825 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:50:37,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:50:37,825 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:50:37,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:50:37,826 INFO L182 omatonBuilderFactory]: Interpolants [1249#true, 1250#false, 1251#(and (= main_~first~0.offset 0) (= main_~first~0.base 0))] [2018-04-11 13:50:37,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:50:37,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 13:50:37,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 13:50:37,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:50:37,826 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 3 states. [2018-04-11 13:50:37,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:50:37,834 INFO L93 Difference]: Finished difference Result 147 states and 164 transitions. [2018-04-11 13:50:37,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 13:50:37,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-04-11 13:50:37,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:50:37,835 INFO L225 Difference]: With dead ends: 147 [2018-04-11 13:50:37,836 INFO L226 Difference]: Without dead ends: 147 [2018-04-11 13:50:37,836 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:50:37,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-11 13:50:37,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 129. [2018-04-11 13:50:37,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 13:50:37,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 156 transitions. [2018-04-11 13:50:37,841 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 156 transitions. Word has length 26 [2018-04-11 13:50:37,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:50:37,841 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 156 transitions. [2018-04-11 13:50:37,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 13:50:37,841 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 156 transitions. [2018-04-11 13:50:37,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 13:50:37,842 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:50:37,842 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:50:37,842 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-11 13:50:37,842 INFO L82 PathProgramCache]: Analyzing trace with hash -462361963, now seen corresponding path program 1 times [2018-04-11 13:50:37,843 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:50:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:50:37,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:50:37,969 INFO 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:50:37,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:50:37,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 13:50:37,970 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:50:37,970 INFO 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:50:37,970 INFO L182 omatonBuilderFactory]: Interpolants [1528#true, 1529#false, 1530#(and (= 20 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 1531#(and (= main_~x~0.offset 0) (= 20 (select |#length| main_~x~0.base))), 1532#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset 0) (= 20 (select |#length| main_~x~0.base))), 1533#(and (= main_~x~0.offset 0) (not (= main_~x~0.base |main_#t~malloc7.base|)) (= 20 (select |#length| main_~x~0.base)))] [2018-04-11 13:50:37,970 INFO 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:50:37,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 13:50:37,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 13:50:37,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:50:37,970 INFO L87 Difference]: Start difference. First operand 129 states and 156 transitions. Second operand 6 states. [2018-04-11 13:50:38,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:50:38,201 INFO L93 Difference]: Finished difference Result 242 states and 275 transitions. [2018-04-11 13:50:38,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 13:50:38,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-04-11 13:50:38,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:50:38,203 INFO L225 Difference]: With dead ends: 242 [2018-04-11 13:50:38,203 INFO L226 Difference]: Without dead ends: 242 [2018-04-11 13:50:38,203 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:50:38,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-11 13:50:38,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 118. [2018-04-11 13:50:38,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 13:50:38,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions. [2018-04-11 13:50:38,209 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 138 transitions. Word has length 27 [2018-04-11 13:50:38,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:50:38,209 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 138 transitions. [2018-04-11 13:50:38,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 13:50:38,209 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2018-04-11 13:50:38,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 13:50:38,210 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:50:38,210 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:50:38,210 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-11 13:50:38,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1448318954, now seen corresponding path program 1 times [2018-04-11 13:50:38,211 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:50:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:50:38,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:50:38,256 INFO 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:50:38,256 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:50:38,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:50:38,257 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:50:38,257 INFO 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:50:38,257 INFO L182 omatonBuilderFactory]: Interpolants [1904#true, 1905#false, 1906#(= 1 (select |#valid| |main_#t~malloc7.base|)), 1907#(= 1 (select |#valid| main_~y~0.base))] [2018-04-11 13:50:38,257 INFO 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:50:38,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:50:38,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:50:38,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:50:38,258 INFO L87 Difference]: Start difference. First operand 118 states and 138 transitions. Second operand 4 states. [2018-04-11 13:50:38,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:50:38,370 INFO L93 Difference]: Finished difference Result 179 states and 204 transitions. [2018-04-11 13:50:38,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 13:50:38,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-04-11 13:50:38,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:50:38,372 INFO L225 Difference]: With dead ends: 179 [2018-04-11 13:50:38,372 INFO L226 Difference]: Without dead ends: 179 [2018-04-11 13:50:38,372 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:50:38,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-04-11 13:50:38,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 114. [2018-04-11 13:50:38,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-04-11 13:50:38,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2018-04-11 13:50:38,377 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 28 [2018-04-11 13:50:38,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:50:38,378 INFO L459 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2018-04-11 13:50:38,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:50:38,378 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2018-04-11 13:50:38,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 13:50:38,379 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:50:38,379 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:50:38,379 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-11 13:50:38,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1448318953, now seen corresponding path program 1 times [2018-04-11 13:50:38,380 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:50:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:50:38,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:50:38,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:50:38,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:50:38,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:50:38,442 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:50:38,442 INFO 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:50:38,442 INFO L182 omatonBuilderFactory]: Interpolants [2203#true, 2204#false, 2205#(and (= 0 |main_#t~malloc7.offset|) (= 12 (select |#length| |main_#t~malloc7.base|))), 2206#(and (= 12 (select |#length| main_~y~0.base)) (= main_~y~0.offset 0))] [2018-04-11 13:50:38,442 INFO 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:50:38,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:50:38,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:50:38,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:50:38,443 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand 4 states. [2018-04-11 13:50:38,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:50:38,491 INFO L93 Difference]: Finished difference Result 167 states and 188 transitions. [2018-04-11 13:50:38,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 13:50:38,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-04-11 13:50:38,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:50:38,492 INFO L225 Difference]: With dead ends: 167 [2018-04-11 13:50:38,492 INFO L226 Difference]: Without dead ends: 167 [2018-04-11 13:50:38,493 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:50:38,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-11 13:50:38,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 110. [2018-04-11 13:50:38,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-04-11 13:50:38,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2018-04-11 13:50:38,495 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 28 [2018-04-11 13:50:38,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:50:38,495 INFO L459 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2018-04-11 13:50:38,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:50:38,496 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2018-04-11 13:50:38,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 13:50:38,496 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:50:38,496 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:50:38,497 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-11 13:50:38,497 INFO L82 PathProgramCache]: Analyzing trace with hash 371541722, now seen corresponding path program 1 times [2018-04-11 13:50:38,497 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:50:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:50:38,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:50:38,555 INFO 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:50:38,555 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:50:38,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 13:50:38,555 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:50:38,555 INFO 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:50:38,555 INFO L182 omatonBuilderFactory]: Interpolants [2486#true, 2487#false, 2488#(= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)), 2489#(= 1 (select |#valid| |main_#t~mem8.base|)), 2490#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))), 2491#(= 1 (select |#valid| |main_#t~mem9.base|))] [2018-04-11 13:50:38,556 INFO 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:50:38,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 13:50:38,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 13:50:38,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:50:38,556 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand 6 states. [2018-04-11 13:50:38,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:50:38,695 INFO L93 Difference]: Finished difference Result 193 states and 215 transitions. [2018-04-11 13:50:38,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 13:50:38,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-11 13:50:38,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:50:38,696 INFO L225 Difference]: With dead ends: 193 [2018-04-11 13:50:38,696 INFO L226 Difference]: Without dead ends: 193 [2018-04-11 13:50:38,696 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:50:38,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-11 13:50:38,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 134. [2018-04-11 13:50:38,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-11 13:50:38,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 152 transitions. [2018-04-11 13:50:38,700 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 152 transitions. Word has length 31 [2018-04-11 13:50:38,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:50:38,700 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 152 transitions. [2018-04-11 13:50:38,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 13:50:38,700 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 152 transitions. [2018-04-11 13:50:38,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 13:50:38,700 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:50:38,700 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:50:38,701 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-11 13:50:38,701 INFO L82 PathProgramCache]: Analyzing trace with hash 371541723, now seen corresponding path program 1 times [2018-04-11 13:50:38,701 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:50:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:50:38,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:50:38,886 INFO 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:50:38,886 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:50:38,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 13:50:38,887 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:50:38,887 INFO 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:50:38,887 INFO L182 omatonBuilderFactory]: Interpolants [2832#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (<= 20 (select |#length| main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 2833#(and (<= 20 (select |#length| |main_#t~mem8.base|)) (= 0 |main_#t~mem8.offset|)), 2834#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset)) (<= 20 (select |#length| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)))), 2835#(and (<= 20 (select |#length| |main_#t~mem9.base|)) (= |main_#t~mem9.offset| 0)), 2825#true, 2826#false, 2827#(and (= 20 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 2828#(and (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 2829#(and (= (select |#length| main_~x~0.base) 20) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 2830#(and (= (select |#length| main_~x~0.base) 20) (= 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)), 2831#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (<= 20 (select |#length| main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~malloc7.base|)))] [2018-04-11 13:50:38,887 INFO 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:50:38,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 13:50:38,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 13:50:38,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-04-11 13:50:38,888 INFO L87 Difference]: Start difference. First operand 134 states and 152 transitions. Second operand 11 states. [2018-04-11 13:50:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:50:39,223 INFO L93 Difference]: Finished difference Result 250 states and 275 transitions. [2018-04-11 13:50:39,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 13:50:39,223 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-04-11 13:50:39,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:50:39,224 INFO L225 Difference]: With dead ends: 250 [2018-04-11 13:50:39,224 INFO L226 Difference]: Without dead ends: 250 [2018-04-11 13:50:39,224 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-04-11 13:50:39,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-04-11 13:50:39,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 134. [2018-04-11 13:50:39,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-11 13:50:39,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 150 transitions. [2018-04-11 13:50:39,226 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 150 transitions. Word has length 31 [2018-04-11 13:50:39,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:50:39,227 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 150 transitions. [2018-04-11 13:50:39,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 13:50:39,227 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 150 transitions. [2018-04-11 13:50:39,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 13:50:39,227 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:50:39,228 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] [2018-04-11 13:50:39,228 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-11 13:50:39,228 INFO L82 PathProgramCache]: Analyzing trace with hash 141443004, now seen corresponding path program 1 times [2018-04-11 13:50:39,228 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:50:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:50:39,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:50:39,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:50:39,265 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:50:39,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:50:39,266 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:50:39,266 INFO 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:50:39,266 INFO L182 omatonBuilderFactory]: Interpolants [3241#true, 3242#false, 3243#(= 1 (select |#valid| main_~x~0.base)), 3244#(= 1 (select |#valid| main_~first~0.base))] [2018-04-11 13:50:39,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:50:39,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:50:39,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:50:39,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:50:39,267 INFO L87 Difference]: Start difference. First operand 134 states and 150 transitions. Second operand 4 states. [2018-04-11 13:50:39,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:50:39,380 INFO L93 Difference]: Finished difference Result 168 states and 184 transitions. [2018-04-11 13:50:39,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:50:39,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-04-11 13:50:39,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:50:39,381 INFO L225 Difference]: With dead ends: 168 [2018-04-11 13:50:39,381 INFO L226 Difference]: Without dead ends: 168 [2018-04-11 13:50:39,381 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:50:39,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-04-11 13:50:39,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 137. [2018-04-11 13:50:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-11 13:50:39,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 155 transitions. [2018-04-11 13:50:39,385 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 155 transitions. Word has length 32 [2018-04-11 13:50:39,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:50:39,385 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 155 transitions. [2018-04-11 13:50:39,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:50:39,385 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2018-04-11 13:50:39,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 13:50:39,386 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:50:39,386 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] [2018-04-11 13:50:39,386 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-11 13:50:39,386 INFO L82 PathProgramCache]: Analyzing trace with hash 141443005, now seen corresponding path program 1 times [2018-04-11 13:50:39,387 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:50:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:50:39,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:50:39,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:50:39,434 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:50:39,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 13:50:39,435 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:50:39,435 INFO 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:50:39,435 INFO L182 omatonBuilderFactory]: Interpolants [3553#true, 3554#false, 3555#(and (= 20 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 3556#(and (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 3557#(and (= main_~first~0.offset 0) (= 20 (select |#length| main_~first~0.base)))] [2018-04-11 13:50:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:50:39,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:50:39,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:50:39,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:50:39,436 INFO L87 Difference]: Start difference. First operand 137 states and 155 transitions. Second operand 5 states. [2018-04-11 13:50:39,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:50:39,517 INFO L93 Difference]: Finished difference Result 220 states and 250 transitions. [2018-04-11 13:50:39,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:50:39,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-04-11 13:50:39,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:50:39,518 INFO L225 Difference]: With dead ends: 220 [2018-04-11 13:50:39,518 INFO L226 Difference]: Without dead ends: 220 [2018-04-11 13:50:39,519 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:50:39,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-04-11 13:50:39,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 166. [2018-04-11 13:50:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-11 13:50:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 193 transitions. [2018-04-11 13:50:39,521 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 193 transitions. Word has length 32 [2018-04-11 13:50:39,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:50:39,521 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 193 transitions. [2018-04-11 13:50:39,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:50:39,521 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 193 transitions. [2018-04-11 13:50:39,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 13:50:39,521 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:50:39,522 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] [2018-04-11 13:50:39,522 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-11 13:50:39,522 INFO L82 PathProgramCache]: Analyzing trace with hash 89765503, now seen corresponding path program 1 times [2018-04-11 13:50:39,522 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:50:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:50:39,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:50:39,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:50:39,555 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:50:39,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-04-11 13:50:39,555 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:50:39,555 INFO 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:50:39,555 INFO L182 omatonBuilderFactory]: Interpolants [3952#(= main_~c1~0 0), 3953#(<= 1 main_~c1~0), 3950#true, 3951#false] [2018-04-11 13:50:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:50:39,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:50:39,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:50:39,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:50:39,556 INFO L87 Difference]: Start difference. First operand 166 states and 193 transitions. Second operand 4 states. [2018-04-11 13:50:39,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:50:39,565 INFO L93 Difference]: Finished difference Result 166 states and 191 transitions. [2018-04-11 13:50:39,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 13:50:39,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-04-11 13:50:39,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:50:39,566 INFO L225 Difference]: With dead ends: 166 [2018-04-11 13:50:39,566 INFO L226 Difference]: Without dead ends: 166 [2018-04-11 13:50:39,566 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:50:39,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-04-11 13:50:39,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-04-11 13:50:39,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-11 13:50:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 191 transitions. [2018-04-11 13:50:39,569 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 191 transitions. Word has length 33 [2018-04-11 13:50:39,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:50:39,569 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 191 transitions. [2018-04-11 13:50:39,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:50:39,569 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 191 transitions. [2018-04-11 13:50:39,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 13:50:39,570 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:50:39,570 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] [2018-04-11 13:50:39,570 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-11 13:50:39,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1512223586, now seen corresponding path program 1 times [2018-04-11 13:50:39,570 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:50:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:50:39,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:50:39,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:50:39,611 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:50:39,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 13:50:39,611 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:50:39,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:50:39,611 INFO L182 omatonBuilderFactory]: Interpolants [4288#(and (= 20 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 4289#(and (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 4290#(and (= 20 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)), 4291#(and (= 20 (select |#length| main_~x~1.base)) (= main_~x~1.offset 0)), 4286#true, 4287#false] [2018-04-11 13:50:39,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:50:39,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 13:50:39,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 13:50:39,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:50:39,612 INFO L87 Difference]: Start difference. First operand 166 states and 191 transitions. Second operand 6 states. [2018-04-11 13:50:39,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:50:39,803 INFO L93 Difference]: Finished difference Result 244 states and 274 transitions. [2018-04-11 13:50:39,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 13:50:39,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-04-11 13:50:39,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:50:39,804 INFO L225 Difference]: With dead ends: 244 [2018-04-11 13:50:39,804 INFO L226 Difference]: Without dead ends: 244 [2018-04-11 13:50:39,805 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:50:39,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-04-11 13:50:39,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 179. [2018-04-11 13:50:39,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-11 13:50:39,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 213 transitions. [2018-04-11 13:50:39,809 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 213 transitions. Word has length 34 [2018-04-11 13:50:39,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:50:39,810 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 213 transitions. [2018-04-11 13:50:39,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 13:50:39,810 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 213 transitions. [2018-04-11 13:50:39,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 13:50:39,810 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:50:39,810 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] [2018-04-11 13:50:39,810 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-11 13:50:39,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1512223587, now seen corresponding path program 1 times [2018-04-11 13:50:39,811 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:50:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:50:39,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:50:39,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 13:50:39,840 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:50:39,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:50:39,841 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:50:39,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:50:39,841 INFO L182 omatonBuilderFactory]: Interpolants [4725#true, 4726#false, 4727#(= main_~first~0.base main_~x~1.base), 4728#(= 1 (select |#valid| main_~x~1.base))] [2018-04-11 13:50:39,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 13:50:39,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:50:39,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:50:39,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:50:39,842 INFO L87 Difference]: Start difference. First operand 179 states and 213 transitions. Second operand 4 states. [2018-04-11 13:50:39,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:50:39,917 INFO L93 Difference]: Finished difference Result 207 states and 250 transitions. [2018-04-11 13:50:39,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:50:39,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-04-11 13:50:39,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:50:39,919 INFO L225 Difference]: With dead ends: 207 [2018-04-11 13:50:39,919 INFO L226 Difference]: Without dead ends: 207 [2018-04-11 13:50:39,919 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:50:39,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-04-11 13:50:39,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 193. [2018-04-11 13:50:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-11 13:50:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 239 transitions. [2018-04-11 13:50:39,923 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 239 transitions. Word has length 34 [2018-04-11 13:50:39,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:50:39,923 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 239 transitions. [2018-04-11 13:50:39,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:50:39,923 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 239 transitions. [2018-04-11 13:50:39,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 13:50:39,924 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:50:39,924 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] [2018-04-11 13:50:39,924 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-11 13:50:39,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1490401502, now seen corresponding path program 1 times [2018-04-11 13:50:39,925 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:50:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:50:39,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:50:40,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:50:40,002 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:50:40,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 13:50:40,003 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:50:40,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:50:40,003 INFO L182 omatonBuilderFactory]: Interpolants [5136#(and (= main_~x~1.offset |main_#t~mem12.offset|) (= main_~x~1.base |main_#t~mem12.base|)), 5137#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base)), 5131#true, 5132#false, 5133#(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))), 5134#(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))), 5135#(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:50:40,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:50:40,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 13:50:40,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 13:50:40,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:50:40,004 INFO L87 Difference]: Start difference. First operand 193 states and 239 transitions. Second operand 7 states. [2018-04-11 13:50:40,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:50:40,190 INFO L93 Difference]: Finished difference Result 271 states and 331 transitions. [2018-04-11 13:50:40,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 13:50:40,191 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-04-11 13:50:40,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:50:40,192 INFO L225 Difference]: With dead ends: 271 [2018-04-11 13:50:40,192 INFO L226 Difference]: Without dead ends: 271 [2018-04-11 13:50:40,192 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:50:40,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-04-11 13:50:40,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 205. [2018-04-11 13:50:40,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-11 13:50:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 253 transitions. [2018-04-11 13:50:40,197 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 253 transitions. Word has length 38 [2018-04-11 13:50:40,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:50:40,197 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 253 transitions. [2018-04-11 13:50:40,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 13:50:40,198 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 253 transitions. [2018-04-11 13:50:40,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 13:50:40,198 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:50:40,198 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] [2018-04-11 13:50:40,198 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-11 13:50:40,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1754004315, now seen corresponding path program 1 times [2018-04-11 13:50:40,199 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:50:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:50:40,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:50:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:50:40,238 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:50:40,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-11 13:50:40,239 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:50:40,239 INFO 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:50:40,239 INFO L182 omatonBuilderFactory]: Interpolants [5627#true, 5628#false, 5629#(= main_~c1~0 0), 5630#(<= main_~c1~0 1), 5631#(<= main_~c1~0 0)] [2018-04-11 13:50:40,239 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:50:40,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:50:40,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:50:40,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:50:40,240 INFO L87 Difference]: Start difference. First operand 205 states and 253 transitions. Second operand 5 states. [2018-04-11 13:50:40,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:50:40,301 INFO L93 Difference]: Finished difference Result 265 states and 323 transitions. [2018-04-11 13:50:40,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:50:40,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-11 13:50:40,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:50:40,303 INFO L225 Difference]: With dead ends: 265 [2018-04-11 13:50:40,303 INFO L226 Difference]: Without dead ends: 265 [2018-04-11 13:50:40,303 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:50:40,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-04-11 13:50:40,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 250. [2018-04-11 13:50:40,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-11 13:50:40,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 321 transitions. [2018-04-11 13:50:40,308 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 321 transitions. Word has length 43 [2018-04-11 13:50:40,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:50:40,308 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 321 transitions. [2018-04-11 13:50:40,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:50:40,308 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 321 transitions. [2018-04-11 13:50:40,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 13:50:40,308 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:50:40,309 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:50:40,309 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-11 13:50:40,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1460441408, now seen corresponding path program 1 times [2018-04-11 13:50:40,309 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:50:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:50:40,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:50:40,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:50:40,378 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:50:40,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-11 13:50:40,379 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:50:40,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:50:40,379 INFO L182 omatonBuilderFactory]: Interpolants [6147#true, 6148#false, 6149#(= |#valid| |old(#valid)|), 6150#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0)), 6151#(= (store |#valid| main_~x~0.base 0) |old(#valid)|), 6152#(= (store |#valid| main_~first~0.base 0) |old(#valid)|), 6153#(= |old(#valid)| (store |#valid| main_~x~1.base 0))] [2018-04-11 13:50:40,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:50:40,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 13:50:40,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 13:50:40,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:50:40,380 INFO L87 Difference]: Start difference. First operand 250 states and 321 transitions. Second operand 7 states. [2018-04-11 13:50:40,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:50:40,547 INFO L93 Difference]: Finished difference Result 257 states and 327 transitions. [2018-04-11 13:50:40,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 13:50:40,548 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-04-11 13:50:40,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:50:40,549 INFO L225 Difference]: With dead ends: 257 [2018-04-11 13:50:40,549 INFO L226 Difference]: Without dead ends: 242 [2018-04-11 13:50:40,549 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:50:40,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-11 13:50:40,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-04-11 13:50:40,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-04-11 13:50:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 311 transitions. [2018-04-11 13:50:40,553 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 311 transitions. Word has length 44 [2018-04-11 13:50:40,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:50:40,553 INFO L459 AbstractCegarLoop]: Abstraction has 241 states and 311 transitions. [2018-04-11 13:50:40,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 13:50:40,554 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 311 transitions. [2018-04-11 13:50:40,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 13:50:40,554 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:50:40,554 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-11 13:50:40,554 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-11 13:50:40,555 INFO L82 PathProgramCache]: Analyzing trace with hash 259479251, now seen corresponding path program 1 times [2018-04-11 13:50:40,556 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:50:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:50:40,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:50:40,618 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:50:40,618 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:50:40,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-11 13:50:40,618 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:50:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:50:40,619 INFO L182 omatonBuilderFactory]: Interpolants [6662#true, 6663#false, 6664#(= 1 (select |#valid| main_~x~0.base)), 6665#(= 1 (select |#valid| main_~last~0.base)), 6666#(or (= main_~last~0.base |main_#t~malloc3.base|) (= 1 (select |#valid| main_~last~0.base))), 6667#(or (= 1 (select |#valid| main_~last~0.base)) (= main_~x~0.base main_~last~0.base)), 6668#(and (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~last~0.base)))] [2018-04-11 13:50:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:50:40,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 13:50:40,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 13:50:40,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:50:40,620 INFO L87 Difference]: Start difference. First operand 241 states and 311 transitions. Second operand 7 states. [2018-04-11 13:50:40,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:50:40,724 INFO L93 Difference]: Finished difference Result 273 states and 345 transitions. [2018-04-11 13:50:40,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:50:40,724 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-04-11 13:50:40,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:50:40,725 INFO L225 Difference]: With dead ends: 273 [2018-04-11 13:50:40,725 INFO L226 Difference]: Without dead ends: 273 [2018-04-11 13:50:40,725 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:50:40,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-04-11 13:50:40,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 240. [2018-04-11 13:50:40,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-04-11 13:50:40,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 309 transitions. [2018-04-11 13:50:40,730 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 309 transitions. Word has length 45 [2018-04-11 13:50:40,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:50:40,730 INFO L459 AbstractCegarLoop]: Abstraction has 240 states and 309 transitions. [2018-04-11 13:50:40,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 13:50:40,730 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 309 transitions. [2018-04-11 13:50:40,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 13:50:40,731 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:50:40,731 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-11 13:50:40,731 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-11 13:50:40,731 INFO L82 PathProgramCache]: Analyzing trace with hash 259479252, now seen corresponding path program 1 times [2018-04-11 13:50:40,732 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:50:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:50:40,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:50:40,805 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:50:40,805 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:50:40,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-04-11 13:50:40,805 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:50:40,805 INFO 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:50:40,805 INFO L182 omatonBuilderFactory]: Interpolants [7184#(and (= 20 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 7185#(and (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 7186#(and (<= 20 (select |#length| main_~last~0.base)) (= main_~last~0.offset 0)), 7182#true, 7183#false] [2018-04-11 13:50:40,806 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:50:40,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:50:40,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:50:40,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:50:40,806 INFO L87 Difference]: Start difference. First operand 240 states and 309 transitions. Second operand 5 states. [2018-04-11 13:50:40,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:50:40,920 INFO L93 Difference]: Finished difference Result 310 states and 393 transitions. [2018-04-11 13:50:40,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:50:40,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-04-11 13:50:40,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:50:40,921 INFO L225 Difference]: With dead ends: 310 [2018-04-11 13:50:40,921 INFO L226 Difference]: Without dead ends: 310 [2018-04-11 13:50:40,921 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:50:40,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-04-11 13:50:40,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 263. [2018-04-11 13:50:40,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-11 13:50:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 337 transitions. [2018-04-11 13:50:40,926 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 337 transitions. Word has length 45 [2018-04-11 13:50:40,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:50:40,926 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 337 transitions. [2018-04-11 13:50:40,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:50:40,927 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 337 transitions. [2018-04-11 13:50:40,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 13:50:40,927 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:50:40,927 INFO L355 BasicCegarLoop]: trace histogram [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:50:40,927 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-11 13:50:40,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1869032365, now seen corresponding path program 1 times [2018-04-11 13:50:40,928 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:50:40,936 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 13:50:40,936 INFO L293 seRefinementStrategy]: Strategy FixedRefinementStrategy was unsuccessful and could not determine trace feasibility. [2018-04-11 13:50:40,936 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-11 13:50:40,949 WARN L200 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-04-11 13:50:40,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 01:50:40 BoogieIcfgContainer [2018-04-11 13:50:40,949 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 13:50:40,950 INFO L168 Benchmark]: Toolchain (without parser) took 4773.12 ms. Allocated memory was 402.7 MB in the beginning and 741.9 MB in the end (delta: 339.2 MB). Free memory was 331.4 MB in the beginning and 685.2 MB in the end (delta: -353.8 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 13:50:40,952 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 402.7 MB. Free memory is still 361.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 13:50:40,952 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.52 ms. Allocated memory is still 402.7 MB. Free memory was 331.4 MB in the beginning and 306.3 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-04-11 13:50:40,952 INFO L168 Benchmark]: Boogie Preprocessor took 44.46 ms. Allocated memory is still 402.7 MB. Free memory was 306.3 MB in the beginning and 303.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:50:40,952 INFO L168 Benchmark]: RCFGBuilder took 529.68 ms. Allocated memory was 402.7 MB in the beginning and 614.5 MB in the end (delta: 211.8 MB). Free memory was 303.7 MB in the beginning and 536.9 MB in the end (delta: -233.2 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-11 13:50:40,953 INFO L168 Benchmark]: TraceAbstraction took 3935.96 ms. Allocated memory was 614.5 MB in the beginning and 741.9 MB in the end (delta: 127.4 MB). Free memory was 536.9 MB in the beginning and 685.2 MB in the end (delta: -148.3 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 13:50:40,954 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.15 ms. Allocated memory is still 402.7 MB. Free memory is still 361.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 259.52 ms. Allocated memory is still 402.7 MB. Free memory was 331.4 MB in the beginning and 306.3 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.46 ms. Allocated memory is still 402.7 MB. Free memory was 306.3 MB in the beginning and 303.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 529.68 ms. Allocated memory was 402.7 MB in the beginning and 614.5 MB in the end (delta: 211.8 MB). Free memory was 303.7 MB in the beginning and 536.9 MB in the end (delta: -233.2 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3935.96 ms. Allocated memory was 614.5 MB in the beginning and 741.9 MB in the end (delta: 127.4 MB). Free memory was 536.9 MB in the beginning and 685.2 MB in the end (delta: -148.3 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 652]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND TRUE c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND TRUE c2 < 3 && __VERIFIER_nondet_int() [L647] c2++ [L647] c2++ [L648] EXPR, FCALL malloc(sizeof(struct T)) [L648] y = malloc(sizeof(struct T)) [L649] COND FALSE !(!y) [L651] EXPR, FCALL x->head.next [L651] FCALL y->next = x->head.next [L652] EXPR, FCALL y->next [L652] FCALL y->next->prev = y [L653] FCALL y->prev = &x->head [L654] FCALL y->data = c2*c1 [L655] FCALL x->head.next = y [L656] y = ((void *)0) [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND TRUE c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND TRUE c2 < 3 && __VERIFIER_nondet_int() [L647] c2++ [L647] c2++ [L648] EXPR, FCALL malloc(sizeof(struct T)) [L648] y = malloc(sizeof(struct T)) [L649] COND FALSE !(!y) [L651] EXPR, FCALL x->head.next [L651] FCALL y->next = x->head.next [L652] EXPR, FCALL y->next [L652] FCALL y->next->prev = y - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 105 locations, 41 error locations. UNKNOWN Result, 3.8s OverallTime, 22 OverallIterations, 2 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1770 SDtfs, 2836 SDslu, 3080 SDs, 0 SdLazy, 2277 SolverSat, 140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 37/75 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 847 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 616 NumberOfCodeBlocks, 616 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 595 ConstructedInterpolants, 0 QuantifiedInterpolants, 95990 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 16 PerfectInterpolantSequences, 37/75 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_13-50-40-960.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_13-50-40-960.csv Received shutdown request...