java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0504_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 08:20:43,407 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 08:20:43,408 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 08:20:43,418 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 08:20:43,418 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 08:20:43,419 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 08:20:43,420 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 08:20:43,422 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 08:20:43,423 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 08:20:43,424 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 08:20:43,424 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 08:20:43,425 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 08:20:43,425 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 08:20:43,426 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 08:20:43,427 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 08:20:43,428 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 08:20:43,430 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 08:20:43,431 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 08:20:43,432 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 08:20:43,433 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 08:20:43,434 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 08:20:43,435 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 08:20:43,435 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 08:20:43,436 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 08:20:43,436 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 08:20:43,437 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 08:20:43,437 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 08:20:43,438 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 08:20:43,438 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 08:20:43,438 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 08:20:43,439 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 08:20:43,439 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-13 08:20:43,448 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 08:20:43,448 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 08:20:43,449 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 08:20:43,449 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 08:20:43,450 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 08:20:43,450 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 08:20:43,450 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 08:20:43,450 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 08:20:43,450 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 08:20:43,450 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 08:20:43,450 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 08:20:43,451 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 08:20:43,451 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 08:20:43,451 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 08:20:43,451 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 08:20:43,451 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 08:20:43,451 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 08:20:43,451 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 08:20:43,452 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 08:20:43,452 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 08:20:43,452 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 08:20:43,452 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 08:20:43,452 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 08:20:43,452 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 08:20:43,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 08:20:43,491 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 08:20:43,494 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 08:20:43,495 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 08:20:43,495 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 08:20:43,496 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-13 08:20:43,759 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG63b356f7f [2018-04-13 08:20:43,887 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 08:20:43,887 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 08:20:43,888 INFO L168 CDTParser]: Scanning test-0504_1_true-valid-memsafety.i [2018-04-13 08:20:43,895 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 08:20:43,895 INFO L215 ultiparseSymbolTable]: [2018-04-13 08:20:43,895 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 08:20:43,895 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-0504_1_true-valid-memsafety.i [2018-04-13 08:20:43,896 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 08:20:43,896 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-13 08:20:43,896 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-13 08:20:43,896 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-13 08:20:43,896 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-13 08:20:43,896 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-13 08:20:43,896 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-13 08:20:43,896 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-13 08:20:43,896 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-13 08:20:43,897 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-13 08:20:43,897 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-13 08:20:43,897 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-13 08:20:43,897 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-13 08:20:43,897 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-13 08:20:43,897 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-13 08:20:43,897 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-13 08:20:43,897 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-13 08:20:43,897 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-13 08:20:43,897 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-13 08:20:43,898 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-13 08:20:43,898 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-13 08:20:43,898 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-13 08:20:43,898 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-13 08:20:43,898 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-13 08:20:43,898 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-13 08:20:43,898 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-13 08:20:43,898 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-13 08:20:43,899 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-13 08:20:43,899 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-13 08:20:43,899 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-13 08:20:43,899 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-13 08:20:43,899 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-13 08:20:43,899 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-13 08:20:43,899 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-13 08:20:43,899 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-13 08:20:43,899 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-13 08:20:43,899 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-13 08:20:43,900 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-13 08:20:43,900 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-13 08:20:43,900 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-13 08:20:43,900 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-13 08:20:43,900 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-13 08:20:43,900 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-13 08:20:43,900 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-13 08:20:43,900 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-13 08:20:43,900 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-13 08:20:43,900 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-13 08:20:43,901 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-13 08:20:43,901 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-13 08:20:43,901 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-13 08:20:43,901 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-13 08:20:43,901 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-13 08:20:43,901 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-13 08:20:43,901 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-13 08:20:43,901 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-13 08:20:43,901 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-13 08:20:43,901 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-13 08:20:43,901 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-13 08:20:43,901 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-13 08:20:43,901 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-13 08:20:43,901 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-13 08:20:43,901 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-13 08:20:43,901 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-13 08:20:43,902 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-13 08:20:43,902 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-13 08:20:43,902 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-13 08:20:43,902 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-13 08:20:43,902 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-13 08:20:43,902 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-13 08:20:43,902 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-13 08:20:43,902 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-13 08:20:43,902 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-13 08:20:43,902 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-13 08:20:43,902 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-13 08:20:43,902 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-13 08:20:43,902 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-13 08:20:43,902 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-13 08:20:43,902 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-13 08:20:43,902 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-13 08:20:43,902 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-13 08:20:43,902 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-13 08:20:43,902 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-13 08:20:43,903 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-13 08:20:43,903 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-13 08:20:43,903 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-13 08:20:43,903 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-13 08:20:43,903 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-13 08:20:43,903 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-13 08:20:43,903 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-13 08:20:43,903 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-13 08:20:43,903 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-13 08:20:43,903 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-13 08:20:43,904 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-13 08:20:43,904 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-13 08:20:43,904 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-13 08:20:43,904 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-13 08:20:43,904 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-13 08:20:43,904 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-13 08:20:43,904 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-13 08:20:43,904 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-13 08:20:43,904 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-13 08:20:43,904 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-13 08:20:43,904 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-13 08:20:43,904 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-13 08:20:43,905 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-13 08:20:43,905 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-13 08:20:43,905 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-13 08:20:43,905 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-13 08:20:43,905 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-13 08:20:43,905 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-13 08:20:43,905 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-13 08:20:43,905 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-13 08:20:43,905 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-13 08:20:43,905 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-13 08:20:43,905 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-13 08:20:43,906 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-13 08:20:43,906 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-13 08:20:43,906 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-13 08:20:43,906 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-13 08:20:43,918 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG63b356f7f [2018-04-13 08:20:43,921 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 08:20:43,921 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 08:20:43,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 08:20:43,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 08:20:43,926 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 08:20:43,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:20:43" (1/1) ... [2018-04-13 08:20:43,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d093458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:20:43, skipping insertion in model container [2018-04-13 08:20:43,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:20:43" (1/1) ... [2018-04-13 08:20:43,938 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 08:20:43,960 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 08:20:44,082 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 08:20:44,119 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 08:20:44,124 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 113 non ball SCCs. Number of states in SCCs 113. [2018-04-13 08:20:44,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:20:44 WrapperNode [2018-04-13 08:20:44,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 08:20:44,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 08:20:44,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 08:20:44,154 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 08:20:44,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:20:44" (1/1) ... [2018-04-13 08:20:44,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:20:44" (1/1) ... [2018-04-13 08:20:44,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:20:44" (1/1) ... [2018-04-13 08:20:44,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:20:44" (1/1) ... [2018-04-13 08:20:44,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:20:44" (1/1) ... [2018-04-13 08:20:44,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:20:44" (1/1) ... [2018-04-13 08:20:44,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:20:44" (1/1) ... [2018-04-13 08:20:44,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 08:20:44,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 08:20:44,198 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 08:20:44,198 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 08:20:44,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:20:44" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 08:20:44,273 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 08:20:44,273 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 08:20:44,273 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 08:20:44,273 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-13 08:20:44,273 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 08:20:44,273 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 08:20:44,273 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 08:20:44,273 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 08:20:44,274 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 08:20:44,274 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 08:20:44,274 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 08:20:44,274 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 08:20:44,274 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 08:20:44,274 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 08:20:44,274 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 08:20:44,274 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 08:20:44,274 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 08:20:44,274 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 08:20:44,274 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 08:20:44,274 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 08:20:44,275 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 08:20:44,275 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 08:20:44,275 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 08:20:44,275 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 08:20:44,275 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 08:20:44,275 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 08:20:44,275 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 08:20:44,275 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 08:20:44,275 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 08:20:44,276 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 08:20:44,276 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 08:20:44,276 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 08:20:44,276 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 08:20:44,276 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 08:20:44,276 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 08:20:44,276 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 08:20:44,276 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 08:20:44,276 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 08:20:44,277 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 08:20:44,277 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 08:20:44,277 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 08:20:44,277 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 08:20:44,277 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 08:20:44,277 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 08:20:44,277 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 08:20:44,277 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 08:20:44,277 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 08:20:44,277 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 08:20:44,278 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 08:20:44,278 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 08:20:44,278 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 08:20:44,278 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 08:20:44,278 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 08:20:44,278 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 08:20:44,278 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 08:20:44,278 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 08:20:44,278 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 08:20:44,279 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 08:20:44,279 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 08:20:44,279 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 08:20:44,279 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 08:20:44,279 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 08:20:44,279 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 08:20:44,279 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 08:20:44,279 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 08:20:44,279 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 08:20:44,279 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 08:20:44,280 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 08:20:44,280 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-13 08:20:44,280 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 08:20:44,280 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 08:20:44,280 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 08:20:44,280 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 08:20:44,280 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 08:20:44,280 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 08:20:44,280 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 08:20:44,280 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 08:20:44,281 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 08:20:44,281 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 08:20:44,281 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 08:20:44,281 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 08:20:44,281 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 08:20:44,281 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 08:20:44,281 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 08:20:44,281 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 08:20:44,281 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 08:20:44,281 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 08:20:44,282 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 08:20:44,282 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 08:20:44,282 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 08:20:44,282 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 08:20:44,282 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 08:20:44,282 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 08:20:44,282 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 08:20:44,282 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 08:20:44,282 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 08:20:44,282 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 08:20:44,283 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 08:20:44,283 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 08:20:44,283 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 08:20:44,283 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 08:20:44,283 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 08:20:44,283 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 08:20:44,283 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 08:20:44,283 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 08:20:44,283 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 08:20:44,283 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 08:20:44,284 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 08:20:44,284 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-13 08:20:44,284 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 08:20:44,284 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-13 08:20:44,284 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 08:20:44,284 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 08:20:44,284 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 08:20:44,284 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 08:20:44,284 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 08:20:44,616 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 08:20:44,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:20:44 BoogieIcfgContainer [2018-04-13 08:20:44,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 08:20:44,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 08:20:44,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 08:20:44,619 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 08:20:44,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:20:43" (1/3) ... [2018-04-13 08:20:44,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541be7d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:20:44, skipping insertion in model container [2018-04-13 08:20:44,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:20:44" (2/3) ... [2018-04-13 08:20:44,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541be7d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:20:44, skipping insertion in model container [2018-04-13 08:20:44,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:20:44" (3/3) ... [2018-04-13 08:20:44,621 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0504_1_true-valid-memsafety.i [2018-04-13 08:20:44,627 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 08:20:44,632 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-04-13 08:20:44,654 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 08:20:44,655 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 08:20:44,655 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 08:20:44,655 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 08:20:44,655 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 08:20:44,655 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 08:20:44,655 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 08:20:44,655 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 08:20:44,655 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 08:20:44,655 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 08:20:44,664 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2018-04-13 08:20:44,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-04-13 08:20:44,671 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:20:44,671 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 08:20:44,672 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-13 08:20:44,674 INFO L82 PathProgramCache]: Analyzing trace with hash -2019747464, now seen corresponding path program 1 times [2018-04-13 08:20:44,675 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:20:44,676 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:20:44,703 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:44,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:44,703 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:44,727 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:20:44,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:20:44,746 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:20:44,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-13 08:20:44,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-13 08:20:44,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-13 08:20:44,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-13 08:20:44,757 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 2 states. [2018-04-13 08:20:44,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:20:44,772 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2018-04-13 08:20:44,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-13 08:20:44,773 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-04-13 08:20:44,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:20:44,781 INFO L225 Difference]: With dead ends: 105 [2018-04-13 08:20:44,781 INFO L226 Difference]: Without dead ends: 102 [2018-04-13 08:20:44,783 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-13 08:20:44,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-13 08:20:44,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-04-13 08:20:44,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-13 08:20:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2018-04-13 08:20:44,808 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 10 [2018-04-13 08:20:44,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:20:44,809 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2018-04-13 08:20:44,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-13 08:20:44,809 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-04-13 08:20:44,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 08:20:44,809 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:20:44,809 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 08:20:44,809 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-13 08:20:44,810 INFO L82 PathProgramCache]: Analyzing trace with hash 328561019, now seen corresponding path program 1 times [2018-04-13 08:20:44,810 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:20:44,810 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:20:44,811 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:44,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:44,811 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:44,824 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:20:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:20:44,860 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:20:44,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 08:20:44,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 08:20:44,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 08:20:44,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 08:20:44,862 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 3 states. [2018-04-13 08:20:44,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:20:44,884 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2018-04-13 08:20:44,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 08:20:44,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-04-13 08:20:44,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:20:44,885 INFO L225 Difference]: With dead ends: 111 [2018-04-13 08:20:44,886 INFO L226 Difference]: Without dead ends: 111 [2018-04-13 08:20:44,886 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-13 08:20:44,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-04-13 08:20:44,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2018-04-13 08:20:44,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-13 08:20:44,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2018-04-13 08:20:44,891 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 13 [2018-04-13 08:20:44,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:20:44,891 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-04-13 08:20:44,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 08:20:44,891 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2018-04-13 08:20:44,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 08:20:44,892 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:20:44,892 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 08:20:44,892 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-13 08:20:44,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1595456672, now seen corresponding path program 1 times [2018-04-13 08:20:44,892 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:20:44,892 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:20:44,893 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:44,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:44,893 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:44,899 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:20:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:20:44,910 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:20:44,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-13 08:20:44,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 08:20:44,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 08:20:44,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 08:20:44,910 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 3 states. [2018-04-13 08:20:44,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:20:44,957 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2018-04-13 08:20:44,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 08:20:44,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-04-13 08:20:44,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:20:44,958 INFO L225 Difference]: With dead ends: 111 [2018-04-13 08:20:44,958 INFO L226 Difference]: Without dead ends: 107 [2018-04-13 08:20:44,958 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-13 08:20:44,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-13 08:20:44,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-04-13 08:20:44,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-04-13 08:20:44,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2018-04-13 08:20:44,964 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 14 [2018-04-13 08:20:44,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:20:44,964 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2018-04-13 08:20:44,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 08:20:44,964 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2018-04-13 08:20:44,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 08:20:44,965 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:20:44,965 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 08:20:44,965 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-13 08:20:44,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1594374816, now seen corresponding path program 1 times [2018-04-13 08:20:44,965 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:20:44,965 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:20:44,966 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:44,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:44,966 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:44,976 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:20:44,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:20:44,996 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:20:44,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 08:20:44,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 08:20:44,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 08:20:44,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 08:20:44,997 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand 4 states. [2018-04-13 08:20:45,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:20:45,098 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2018-04-13 08:20:45,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 08:20:45,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-13 08:20:45,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:20:45,100 INFO L225 Difference]: With dead ends: 133 [2018-04-13 08:20:45,100 INFO L226 Difference]: Without dead ends: 133 [2018-04-13 08:20:45,100 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 08:20:45,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-13 08:20:45,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 98. [2018-04-13 08:20:45,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-13 08:20:45,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2018-04-13 08:20:45,106 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 14 [2018-04-13 08:20:45,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:20:45,106 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2018-04-13 08:20:45,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 08:20:45,107 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2018-04-13 08:20:45,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 08:20:45,107 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:20:45,107 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 08:20:45,107 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-13 08:20:45,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1594374817, now seen corresponding path program 1 times [2018-04-13 08:20:45,107 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:20:45,108 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:20:45,108 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:45,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:45,109 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:45,117 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:20:45,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:20:45,160 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:20:45,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 08:20:45,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 08:20:45,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 08:20:45,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 08:20:45,161 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 4 states. [2018-04-13 08:20:45,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:20:45,268 INFO L93 Difference]: Finished difference Result 144 states and 159 transitions. [2018-04-13 08:20:45,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 08:20:45,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-13 08:20:45,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:20:45,269 INFO L225 Difference]: With dead ends: 144 [2018-04-13 08:20:45,269 INFO L226 Difference]: Without dead ends: 144 [2018-04-13 08:20:45,269 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-13 08:20:45,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-04-13 08:20:45,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 101. [2018-04-13 08:20:45,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-13 08:20:45,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2018-04-13 08:20:45,274 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 14 [2018-04-13 08:20:45,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:20:45,275 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2018-04-13 08:20:45,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 08:20:45,275 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2018-04-13 08:20:45,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-13 08:20:45,275 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:20:45,275 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-13 08:20:45,275 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-13 08:20:45,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1816054924, now seen corresponding path program 1 times [2018-04-13 08:20:45,276 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:20:45,276 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:20:45,276 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:45,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:45,276 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:45,289 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:20:45,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:20:45,320 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:20:45,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 08:20:45,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 08:20:45,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 08:20:45,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 08:20:45,320 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 3 states. [2018-04-13 08:20:45,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:20:45,327 INFO L93 Difference]: Finished difference Result 147 states and 164 transitions. [2018-04-13 08:20:45,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 08:20:45,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-04-13 08:20:45,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:20:45,328 INFO L225 Difference]: With dead ends: 147 [2018-04-13 08:20:45,328 INFO L226 Difference]: Without dead ends: 147 [2018-04-13 08:20:45,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-13 08:20:45,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-13 08:20:45,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 129. [2018-04-13 08:20:45,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-13 08:20:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 156 transitions. [2018-04-13 08:20:45,333 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 156 transitions. Word has length 26 [2018-04-13 08:20:45,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:20:45,333 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 156 transitions. [2018-04-13 08:20:45,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 08:20:45,333 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 156 transitions. [2018-04-13 08:20:45,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-13 08:20:45,333 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:20:45,334 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-13 08:20:45,334 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-13 08:20:45,334 INFO L82 PathProgramCache]: Analyzing trace with hash -462361963, now seen corresponding path program 1 times [2018-04-13 08:20:45,334 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:20:45,334 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:20:45,335 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:45,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:45,335 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:45,351 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:20:45,356 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:20:45,357 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:20:45,357 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:20:45,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:45,386 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:20:45,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:20:45,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:20:45,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-13 08:20:45,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:45,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:20:45,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:20:45,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-13 08:20:45,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:45,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 08:20:45,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-04-13 08:20:45,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:20:45,503 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:20:45,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 08:20:45,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 08:20:45,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 08:20:45,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-13 08:20:45,504 INFO L87 Difference]: Start difference. First operand 129 states and 156 transitions. Second operand 6 states. [2018-04-13 08:20:45,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:20:45,674 INFO L93 Difference]: Finished difference Result 241 states and 274 transitions. [2018-04-13 08:20:45,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 08:20:45,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-04-13 08:20:45,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:20:45,675 INFO L225 Difference]: With dead ends: 241 [2018-04-13 08:20:45,675 INFO L226 Difference]: Without dead ends: 241 [2018-04-13 08:20:45,675 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-13 08:20:45,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-04-13 08:20:45,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 118. [2018-04-13 08:20:45,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-13 08:20:45,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions. [2018-04-13 08:20:45,678 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 138 transitions. Word has length 27 [2018-04-13 08:20:45,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:20:45,678 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 138 transitions. [2018-04-13 08:20:45,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 08:20:45,679 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2018-04-13 08:20:45,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 08:20:45,679 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:20:45,679 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 08:20:45,679 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-13 08:20:45,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1448318954, now seen corresponding path program 1 times [2018-04-13 08:20:45,679 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:20:45,679 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:20:45,680 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:45,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:45,680 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:45,688 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:20:45,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:20:45,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:20:45,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 08:20:45,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 08:20:45,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 08:20:45,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 08:20:45,710 INFO L87 Difference]: Start difference. First operand 118 states and 138 transitions. Second operand 4 states. [2018-04-13 08:20:45,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:20:45,837 INFO L93 Difference]: Finished difference Result 179 states and 204 transitions. [2018-04-13 08:20:45,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 08:20:45,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-04-13 08:20:45,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:20:45,838 INFO L225 Difference]: With dead ends: 179 [2018-04-13 08:20:45,838 INFO L226 Difference]: Without dead ends: 179 [2018-04-13 08:20:45,839 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 08:20:45,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-04-13 08:20:45,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 114. [2018-04-13 08:20:45,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-04-13 08:20:45,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2018-04-13 08:20:45,841 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 28 [2018-04-13 08:20:45,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:20:45,842 INFO L459 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2018-04-13 08:20:45,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 08:20:45,842 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2018-04-13 08:20:45,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 08:20:45,842 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:20:45,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, 1] [2018-04-13 08:20:45,842 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-13 08:20:45,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1448318953, now seen corresponding path program 1 times [2018-04-13 08:20:45,842 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:20:45,842 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:20:45,843 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:45,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:45,843 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:45,851 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:20:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:20:45,878 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:20:45,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 08:20:45,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 08:20:45,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 08:20:45,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 08:20:45,878 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand 4 states. [2018-04-13 08:20:45,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:20:45,932 INFO L93 Difference]: Finished difference Result 167 states and 188 transitions. [2018-04-13 08:20:45,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 08:20:45,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-04-13 08:20:45,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:20:45,933 INFO L225 Difference]: With dead ends: 167 [2018-04-13 08:20:45,933 INFO L226 Difference]: Without dead ends: 167 [2018-04-13 08:20:45,933 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 08:20:45,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-13 08:20:45,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 110. [2018-04-13 08:20:45,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-04-13 08:20:45,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2018-04-13 08:20:45,936 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 28 [2018-04-13 08:20:45,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:20:45,936 INFO L459 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2018-04-13 08:20:45,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 08:20:45,937 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2018-04-13 08:20:45,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-13 08:20:45,937 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:20:45,937 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-13 08:20:45,937 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-13 08:20:45,938 INFO L82 PathProgramCache]: Analyzing trace with hash 371541722, now seen corresponding path program 1 times [2018-04-13 08:20:45,938 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:20:45,938 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:20:45,939 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:45,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:45,939 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:45,950 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:20:45,953 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:20:45,953 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:20:45,954 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:20:45,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:45,980 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:20:45,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-13 08:20:45,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 08:20:45,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:45,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:45,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:45,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-04-13 08:20:45,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-13 08:20:46,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:20:46,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-13 08:20:46,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-04-13 08:20:46,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:20:46,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:20:46,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 08:20:46,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:17 [2018-04-13 08:20:46,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-04-13 08:20:46,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-04-13 08:20:46,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 08:20:46,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-04-13 08:20:46,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2018-04-13 08:20:46,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:20:46,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-04-13 08:20:46,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:5 [2018-04-13 08:20:46,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:20:46,100 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:20:46,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 08:20:46,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 08:20:46,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 08:20:46,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-04-13 08:20:46,101 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand 9 states. [2018-04-13 08:20:46,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:20:46,406 INFO L93 Difference]: Finished difference Result 249 states and 275 transitions. [2018-04-13 08:20:46,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 08:20:46,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-04-13 08:20:46,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:20:46,407 INFO L225 Difference]: With dead ends: 249 [2018-04-13 08:20:46,408 INFO L226 Difference]: Without dead ends: 249 [2018-04-13 08:20:46,408 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-04-13 08:20:46,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-04-13 08:20:46,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 134. [2018-04-13 08:20:46,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-13 08:20:46,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 152 transitions. [2018-04-13 08:20:46,411 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 152 transitions. Word has length 31 [2018-04-13 08:20:46,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:20:46,411 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 152 transitions. [2018-04-13 08:20:46,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 08:20:46,412 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 152 transitions. [2018-04-13 08:20:46,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-13 08:20:46,412 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:20:46,412 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-13 08:20:46,413 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-13 08:20:46,414 INFO L82 PathProgramCache]: Analyzing trace with hash 371541723, now seen corresponding path program 1 times [2018-04-13 08:20:46,414 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:20:46,414 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:20:46,414 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:46,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:46,415 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:46,425 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:20:46,428 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:20:46,428 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:20:46,428 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:20:46,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:46,453 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:20:46,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 08:20:46,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 08:20:46,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-13 08:20:46,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 08:20:46,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-13 08:20:46,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 08:20:46,495 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,508 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,516 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-04-13 08:20:46,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-13 08:20:46,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:20:46,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-13 08:20:46,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-13 08:20:46,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:20:46,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-13 08:20:46,548 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,558 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-04-13 08:20:46,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:20:46,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:20:46,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-13 08:20:46,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:20:46,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-13 08:20:46,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 08:20:46,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:46 [2018-04-13 08:20:46,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2018-04-13 08:20:46,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-04-13 08:20:46,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2018-04-13 08:20:46,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-04-13 08:20:46,695 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,708 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 08:20:46,717 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:69, output treesize:61 [2018-04-13 08:20:46,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 31 [2018-04-13 08:20:46,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-04-13 08:20:46,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-13 08:20:46,765 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2018-04-13 08:20:46,774 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 31 [2018-04-13 08:20:46,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2018-04-13 08:20:46,794 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,798 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:46,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 08:20:46,801 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:75, output treesize:14 [2018-04-13 08:20:46,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:20:46,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:20:46,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-13 08:20:46,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 08:20:46,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 08:20:46,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-04-13 08:20:46,814 INFO L87 Difference]: Start difference. First operand 134 states and 152 transitions. Second operand 11 states. [2018-04-13 08:20:47,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:20:47,167 INFO L93 Difference]: Finished difference Result 250 states and 275 transitions. [2018-04-13 08:20:47,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 08:20:47,167 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-04-13 08:20:47,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:20:47,168 INFO L225 Difference]: With dead ends: 250 [2018-04-13 08:20:47,168 INFO L226 Difference]: Without dead ends: 250 [2018-04-13 08:20:47,169 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=324, Unknown=1, NotChecked=0, Total=420 [2018-04-13 08:20:47,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-04-13 08:20:47,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 134. [2018-04-13 08:20:47,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-13 08:20:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 150 transitions. [2018-04-13 08:20:47,172 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 150 transitions. Word has length 31 [2018-04-13 08:20:47,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:20:47,172 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 150 transitions. [2018-04-13 08:20:47,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 08:20:47,172 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 150 transitions. [2018-04-13 08:20:47,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 08:20:47,173 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:20:47,173 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-13 08:20:47,173 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-13 08:20:47,174 INFO L82 PathProgramCache]: Analyzing trace with hash 141443004, now seen corresponding path program 1 times [2018-04-13 08:20:47,174 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:20:47,174 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:20:47,174 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:47,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:47,174 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:47,181 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:20:47,214 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-13 08:20:47,215 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:20:47,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 08:20:47,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 08:20:47,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 08:20:47,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 08:20:47,215 INFO L87 Difference]: Start difference. First operand 134 states and 150 transitions. Second operand 4 states. [2018-04-13 08:20:47,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:20:47,318 INFO L93 Difference]: Finished difference Result 168 states and 184 transitions. [2018-04-13 08:20:47,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 08:20:47,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-04-13 08:20:47,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:20:47,320 INFO L225 Difference]: With dead ends: 168 [2018-04-13 08:20:47,320 INFO L226 Difference]: Without dead ends: 168 [2018-04-13 08:20:47,320 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 08:20:47,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-04-13 08:20:47,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 137. [2018-04-13 08:20:47,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-13 08:20:47,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 155 transitions. [2018-04-13 08:20:47,323 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 155 transitions. Word has length 32 [2018-04-13 08:20:47,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:20:47,324 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 155 transitions. [2018-04-13 08:20:47,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 08:20:47,324 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2018-04-13 08:20:47,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 08:20:47,324 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:20:47,324 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-13 08:20:47,325 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-13 08:20:47,325 INFO L82 PathProgramCache]: Analyzing trace with hash 141443005, now seen corresponding path program 1 times [2018-04-13 08:20:47,325 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:20:47,325 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:20:47,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:47,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:47,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:47,334 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:20:47,368 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-13 08:20:47,368 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:20:47,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 08:20:47,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 08:20:47,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 08:20:47,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 08:20:47,369 INFO L87 Difference]: Start difference. First operand 137 states and 155 transitions. Second operand 5 states. [2018-04-13 08:20:47,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:20:47,502 INFO L93 Difference]: Finished difference Result 220 states and 250 transitions. [2018-04-13 08:20:47,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 08:20:47,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-04-13 08:20:47,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:20:47,503 INFO L225 Difference]: With dead ends: 220 [2018-04-13 08:20:47,503 INFO L226 Difference]: Without dead ends: 220 [2018-04-13 08:20:47,504 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-13 08:20:47,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-04-13 08:20:47,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 166. [2018-04-13 08:20:47,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-13 08:20:47,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 193 transitions. [2018-04-13 08:20:47,508 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 193 transitions. Word has length 32 [2018-04-13 08:20:47,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:20:47,508 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 193 transitions. [2018-04-13 08:20:47,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 08:20:47,508 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 193 transitions. [2018-04-13 08:20:47,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 08:20:47,509 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:20:47,509 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-13 08:20:47,509 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-13 08:20:47,509 INFO L82 PathProgramCache]: Analyzing trace with hash 89765503, now seen corresponding path program 1 times [2018-04-13 08:20:47,509 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:20:47,509 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:20:47,510 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:47,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:47,510 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:47,517 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:20:47,535 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-13 08:20:47,535 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:20:47,535 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:20:47,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:47,547 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:20:47,555 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-13 08:20:47,556 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:20:47,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-04-13 08:20:47,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 08:20:47,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 08:20:47,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 08:20:47,557 INFO L87 Difference]: Start difference. First operand 166 states and 193 transitions. Second operand 5 states. [2018-04-13 08:20:47,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:20:47,572 INFO L93 Difference]: Finished difference Result 166 states and 191 transitions. [2018-04-13 08:20:47,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 08:20:47,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-04-13 08:20:47,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:20:47,574 INFO L225 Difference]: With dead ends: 166 [2018-04-13 08:20:47,574 INFO L226 Difference]: Without dead ends: 166 [2018-04-13 08:20:47,574 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 08:20:47,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-04-13 08:20:47,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-04-13 08:20:47,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-13 08:20:47,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 191 transitions. [2018-04-13 08:20:47,577 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 191 transitions. Word has length 33 [2018-04-13 08:20:47,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:20:47,577 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 191 transitions. [2018-04-13 08:20:47,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 08:20:47,578 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 191 transitions. [2018-04-13 08:20:47,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-13 08:20:47,578 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:20:47,578 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-13 08:20:47,578 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-13 08:20:47,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1512223586, now seen corresponding path program 1 times [2018-04-13 08:20:47,579 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:20:47,579 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:20:47,579 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:47,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:47,579 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:47,587 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:20:47,624 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-13 08:20:47,625 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:20:47,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 08:20:47,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 08:20:47,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 08:20:47,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 08:20:47,625 INFO L87 Difference]: Start difference. First operand 166 states and 191 transitions. Second operand 6 states. [2018-04-13 08:20:47,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:20:47,801 INFO L93 Difference]: Finished difference Result 244 states and 274 transitions. [2018-04-13 08:20:47,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 08:20:47,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-04-13 08:20:47,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:20:47,803 INFO L225 Difference]: With dead ends: 244 [2018-04-13 08:20:47,803 INFO L226 Difference]: Without dead ends: 244 [2018-04-13 08:20:47,803 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-13 08:20:47,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-04-13 08:20:47,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 179. [2018-04-13 08:20:47,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-13 08:20:47,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 213 transitions. [2018-04-13 08:20:47,807 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 213 transitions. Word has length 34 [2018-04-13 08:20:47,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:20:47,808 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 213 transitions. [2018-04-13 08:20:47,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 08:20:47,808 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 213 transitions. [2018-04-13 08:20:47,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-13 08:20:47,808 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:20:47,808 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-13 08:20:47,808 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-13 08:20:47,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1512223587, now seen corresponding path program 1 times [2018-04-13 08:20:47,809 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:20:47,809 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:20:47,809 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:47,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:47,810 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:47,816 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:20:47,831 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-13 08:20:47,831 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:20:47,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 08:20:47,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 08:20:47,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 08:20:47,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 08:20:47,832 INFO L87 Difference]: Start difference. First operand 179 states and 213 transitions. Second operand 4 states. [2018-04-13 08:20:47,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:20:47,890 INFO L93 Difference]: Finished difference Result 207 states and 250 transitions. [2018-04-13 08:20:47,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 08:20:47,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-04-13 08:20:47,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:20:47,892 INFO L225 Difference]: With dead ends: 207 [2018-04-13 08:20:47,892 INFO L226 Difference]: Without dead ends: 207 [2018-04-13 08:20:47,892 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 08:20:47,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-04-13 08:20:47,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 193. [2018-04-13 08:20:47,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-13 08:20:47,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 239 transitions. [2018-04-13 08:20:47,896 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 239 transitions. Word has length 34 [2018-04-13 08:20:47,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:20:47,896 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 239 transitions. [2018-04-13 08:20:47,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 08:20:47,896 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 239 transitions. [2018-04-13 08:20:47,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-13 08:20:47,897 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:20:47,897 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-13 08:20:47,897 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-13 08:20:47,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1490401502, now seen corresponding path program 1 times [2018-04-13 08:20:47,897 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:20:47,898 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:20:47,898 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:47,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:47,898 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:47,906 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:20:47,909 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:20:47,909 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:20:47,909 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:20:47,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:47,928 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:20:47,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-13 08:20:47,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 08:20:47,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:47,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:47,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-13 08:20:47,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 08:20:47,953 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:47,954 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:47,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:47,959 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-04-13 08:20:47,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-13 08:20:47,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:20:47,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-13 08:20:47,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:47,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:47,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-13 08:20:47,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:20:47,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-13 08:20:47,990 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:47,994 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:47,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:47,999 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-13 08:20:48,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-13 08:20:48,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-04-13 08:20:48,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:48,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:48,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-13 08:20:48,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-04-13 08:20:48,050 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:48,052 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:48,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:48,056 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:10 [2018-04-13 08:20:48,075 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-13 08:20:48,076 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:20:48,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-13 08:20:48,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 08:20:48,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 08:20:48,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-13 08:20:48,076 INFO L87 Difference]: Start difference. First operand 193 states and 239 transitions. Second operand 10 states. [2018-04-13 08:20:48,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:20:48,420 INFO L93 Difference]: Finished difference Result 290 states and 353 transitions. [2018-04-13 08:20:48,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 08:20:48,420 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-04-13 08:20:48,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:20:48,421 INFO L225 Difference]: With dead ends: 290 [2018-04-13 08:20:48,421 INFO L226 Difference]: Without dead ends: 290 [2018-04-13 08:20:48,421 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2018-04-13 08:20:48,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-04-13 08:20:48,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 205. [2018-04-13 08:20:48,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-13 08:20:48,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 253 transitions. [2018-04-13 08:20:48,424 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 253 transitions. Word has length 38 [2018-04-13 08:20:48,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:20:48,424 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 253 transitions. [2018-04-13 08:20:48,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 08:20:48,424 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 253 transitions. [2018-04-13 08:20:48,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-13 08:20:48,425 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:20:48,425 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-13 08:20:48,425 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-13 08:20:48,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1754004315, now seen corresponding path program 1 times [2018-04-13 08:20:48,425 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:20:48,425 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:20:48,425 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:48,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:48,426 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:48,432 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:20:48,471 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-13 08:20:48,471 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:20:48,471 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:20:48,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:48,489 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:20:48,494 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-13 08:20:48,494 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:20:48,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-04-13 08:20:48,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 08:20:48,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 08:20:48,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-13 08:20:48,495 INFO L87 Difference]: Start difference. First operand 205 states and 253 transitions. Second operand 5 states. [2018-04-13 08:20:48,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:20:48,515 INFO L93 Difference]: Finished difference Result 265 states and 323 transitions. [2018-04-13 08:20:48,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 08:20:48,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-13 08:20:48,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:20:48,516 INFO L225 Difference]: With dead ends: 265 [2018-04-13 08:20:48,516 INFO L226 Difference]: Without dead ends: 265 [2018-04-13 08:20:48,516 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-13 08:20:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-04-13 08:20:48,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 250. [2018-04-13 08:20:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-13 08:20:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 321 transitions. [2018-04-13 08:20:48,519 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 321 transitions. Word has length 43 [2018-04-13 08:20:48,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:20:48,519 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 321 transitions. [2018-04-13 08:20:48,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 08:20:48,519 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 321 transitions. [2018-04-13 08:20:48,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-13 08:20:48,520 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:20:48,520 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-13 08:20:48,520 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-13 08:20:48,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1460441408, now seen corresponding path program 1 times [2018-04-13 08:20:48,520 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:20:48,520 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:20:48,521 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:48,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:48,521 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:48,526 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:20:48,527 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:20:48,527 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:20:48,527 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:20:48,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:48,541 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:20:48,582 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~x~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_~x~1.base 0)) (= 0 (select |c_old(#valid)| main_~x~1.base)))) is different from true [2018-04-13 08:20:48,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-13 08:20:48,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:20:48,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-13 08:20:48,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 08:20:48,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 08:20:48,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=32, Unknown=1, NotChecked=10, Total=56 [2018-04-13 08:20:48,589 INFO L87 Difference]: Start difference. First operand 250 states and 321 transitions. Second operand 8 states. [2018-04-13 08:20:48,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:20:48,756 INFO L93 Difference]: Finished difference Result 257 states and 327 transitions. [2018-04-13 08:20:48,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 08:20:48,757 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-04-13 08:20:48,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:20:48,757 INFO L225 Difference]: With dead ends: 257 [2018-04-13 08:20:48,757 INFO L226 Difference]: Without dead ends: 242 [2018-04-13 08:20:48,758 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=93, Unknown=2, NotChecked=20, Total=156 [2018-04-13 08:20:48,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-13 08:20:48,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-04-13 08:20:48,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-04-13 08:20:48,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 311 transitions. [2018-04-13 08:20:48,762 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 311 transitions. Word has length 44 [2018-04-13 08:20:48,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:20:48,762 INFO L459 AbstractCegarLoop]: Abstraction has 241 states and 311 transitions. [2018-04-13 08:20:48,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 08:20:48,763 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 311 transitions. [2018-04-13 08:20:48,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-13 08:20:48,763 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:20:48,763 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-13 08:20:48,763 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-13 08:20:48,763 INFO L82 PathProgramCache]: Analyzing trace with hash 259479251, now seen corresponding path program 1 times [2018-04-13 08:20:48,764 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:20:48,764 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:20:48,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:48,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:48,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:48,773 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:20:48,775 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:20:48,775 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:20:48,775 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:20:48,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:48,792 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:20:48,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 08:20:48,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:48,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:48,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 08:20:48,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 08:20:48,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:48,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 08:20:48,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-13 08:20:48,823 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-13 08:20:48,824 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:20:48,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-04-13 08:20:48,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 08:20:48,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 08:20:48,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 08:20:48,825 INFO L87 Difference]: Start difference. First operand 241 states and 311 transitions. Second operand 5 states. [2018-04-13 08:20:48,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:20:48,910 INFO L93 Difference]: Finished difference Result 273 states and 345 transitions. [2018-04-13 08:20:48,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 08:20:48,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-04-13 08:20:48,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:20:48,912 INFO L225 Difference]: With dead ends: 273 [2018-04-13 08:20:48,912 INFO L226 Difference]: Without dead ends: 273 [2018-04-13 08:20:48,912 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-13 08:20:48,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-04-13 08:20:48,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 240. [2018-04-13 08:20:48,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-04-13 08:20:48,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 309 transitions. [2018-04-13 08:20:48,917 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 309 transitions. Word has length 45 [2018-04-13 08:20:48,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:20:48,917 INFO L459 AbstractCegarLoop]: Abstraction has 240 states and 309 transitions. [2018-04-13 08:20:48,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 08:20:48,917 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 309 transitions. [2018-04-13 08:20:48,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-13 08:20:48,917 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:20:48,918 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-13 08:20:48,918 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-13 08:20:48,918 INFO L82 PathProgramCache]: Analyzing trace with hash 259479252, now seen corresponding path program 1 times [2018-04-13 08:20:48,918 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:20:48,918 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:20:48,919 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:48,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:48,919 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:48,929 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:20:48,931 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:20:48,931 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:20:48,931 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:20:48,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:20:48,946 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:20:48,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 08:20:48,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:48,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 08:20:48,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:48,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:20:48,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 08:20:49,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:20:49,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:20:49,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 08:20:49,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:49,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 08:20:49,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:20:49,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 08:20:49,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-04-13 08:20:49,030 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-13 08:20:49,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:20:49,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-13 08:20:49,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 08:20:49,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 08:20:49,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 08:20:49,031 INFO L87 Difference]: Start difference. First operand 240 states and 309 transitions. Second operand 6 states. [2018-04-13 08:20:49,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:20:49,280 INFO L93 Difference]: Finished difference Result 348 states and 432 transitions. [2018-04-13 08:20:49,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 08:20:49,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-04-13 08:20:49,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:20:49,281 INFO L225 Difference]: With dead ends: 348 [2018-04-13 08:20:49,281 INFO L226 Difference]: Without dead ends: 348 [2018-04-13 08:20:49,281 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-13 08:20:49,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-04-13 08:20:49,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 239. [2018-04-13 08:20:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-04-13 08:20:49,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 307 transitions. [2018-04-13 08:20:49,284 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 307 transitions. Word has length 45 [2018-04-13 08:20:49,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:20:49,284 INFO L459 AbstractCegarLoop]: Abstraction has 239 states and 307 transitions. [2018-04-13 08:20:49,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 08:20:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 307 transitions. [2018-04-13 08:20:49,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-13 08:20:49,285 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:20:49,285 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-13 08:20:49,285 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-13 08:20:49,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1869032365, now seen corresponding path program 1 times [2018-04-13 08:20:49,285 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:20:49,285 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:20:49,285 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:49,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:49,285 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:20:49,290 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-13 08:20:49,290 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-13 08:20:49,290 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:20:49,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:20:49,296 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-13 08:20:49,296 INFO L293 seRefinementStrategy]: Strategy SmtInterpolRefinementStrategy was unsuccessful and could not determine trace feasibility. [2018-04-13 08:20:49,296 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-13 08:20:49,304 WARN L200 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-04-13 08:20:49,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:20:49 BoogieIcfgContainer [2018-04-13 08:20:49,305 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 08:20:49,305 INFO L168 Benchmark]: Toolchain (without parser) took 5384.21 ms. Allocated memory was 402.1 MB in the beginning and 733.5 MB in the end (delta: 331.4 MB). Free memory was 338.4 MB in the beginning and 495.6 MB in the end (delta: -157.1 MB). Peak memory consumption was 174.2 MB. Max. memory is 5.3 GB. [2018-04-13 08:20:49,306 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 402.1 MB. Free memory is still 365.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 08:20:49,306 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.86 ms. Allocated memory is still 402.1 MB. Free memory was 338.4 MB in the beginning and 312.4 MB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 5.3 GB. [2018-04-13 08:20:49,306 INFO L168 Benchmark]: Boogie Preprocessor took 43.16 ms. Allocated memory is still 402.1 MB. Free memory was 312.4 MB in the beginning and 309.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-13 08:20:49,306 INFO L168 Benchmark]: RCFGBuilder took 419.09 ms. Allocated memory was 402.1 MB in the beginning and 608.2 MB in the end (delta: 206.0 MB). Free memory was 308.4 MB in the beginning and 532.2 MB in the end (delta: -223.8 MB). Peak memory consumption was 23.7 MB. Max. memory is 5.3 GB. [2018-04-13 08:20:49,306 INFO L168 Benchmark]: TraceAbstraction took 4687.61 ms. Allocated memory was 608.2 MB in the beginning and 733.5 MB in the end (delta: 125.3 MB). Free memory was 532.2 MB in the beginning and 495.6 MB in the end (delta: 36.6 MB). Peak memory consumption was 161.9 MB. Max. memory is 5.3 GB. [2018-04-13 08:20:49,307 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.14 ms. Allocated memory is still 402.1 MB. Free memory is still 365.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 231.86 ms. Allocated memory is still 402.1 MB. Free memory was 338.4 MB in the beginning and 312.4 MB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.16 ms. Allocated memory is still 402.1 MB. Free memory was 312.4 MB in the beginning and 309.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 419.09 ms. Allocated memory was 402.1 MB in the beginning and 608.2 MB in the end (delta: 206.0 MB). Free memory was 308.4 MB in the beginning and 532.2 MB in the end (delta: -223.8 MB). Peak memory consumption was 23.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4687.61 ms. Allocated memory was 608.2 MB in the beginning and 733.5 MB in the end (delta: 125.3 MB). Free memory was 532.2 MB in the beginning and 495.6 MB in the end (delta: 36.6 MB). Peak memory consumption was 161.9 MB. 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, 4.6s OverallTime, 22 OverallIterations, 2 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1734 SDtfs, 2923 SDslu, 3269 SDs, 0 SdLazy, 2563 SolverSat, 143 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 439 GetRequests, 321 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=250occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 983 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 953 NumberOfCodeBlocks, 953 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 669 ConstructedInterpolants, 32 QuantifiedInterpolants, 154463 SizeOfPredicates, 45 NumberOfNonLiveVariables, 1409 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 23 InterpolantComputations, 17 PerfectInterpolantSequences, 40/86 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_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_08-20-49-311.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_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_08-20-49-311.csv Received shutdown request...