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_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0219_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 21:04:45,471 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 21:04:45,472 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 21:04:45,483 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 21:04:45,483 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 21:04:45,484 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 21:04:45,485 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 21:04:45,486 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 21:04:45,488 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 21:04:45,488 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 21:04:45,489 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 21:04:45,489 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 21:04:45,490 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 21:04:45,491 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 21:04:45,491 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 21:04:45,493 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 21:04:45,494 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 21:04:45,495 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 21:04:45,496 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 21:04:45,497 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 21:04:45,499 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 21:04:45,499 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 21:04:45,499 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 21:04:45,500 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 21:04:45,501 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 21:04:45,501 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 21:04:45,502 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 21:04:45,502 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 21:04:45,503 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 21:04:45,503 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 21:04:45,503 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 21:04:45,503 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-11 21:04:45,523 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 21:04:45,524 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 21:04:45,525 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 21:04:45,525 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 21:04:45,525 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 21:04:45,525 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 21:04:45,525 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 21:04:45,525 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 21:04:45,526 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 21:04:45,526 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 21:04:45,526 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 21:04:45,526 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 21:04:45,526 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 21:04:45,526 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 21:04:45,526 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 21:04:45,526 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 21:04:45,526 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 21:04:45,527 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 21:04:45,527 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 21:04:45,527 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 21:04:45,527 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 21:04:45,527 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 21:04:45,527 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 21:04:45,527 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 21:04:45,558 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 21:04:45,567 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 21:04:45,571 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 21:04:45,572 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 21:04:45,572 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 21:04:45,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0219_true-valid-memsafety.i [2018-04-11 21:04:45,944 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG30d7ad2aa [2018-04-11 21:04:46,078 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 21:04:46,078 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 21:04:46,078 INFO L168 CDTParser]: Scanning test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,087 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 21:04:46,087 INFO L215 ultiparseSymbolTable]: [2018-04-11 21:04:46,087 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 21:04:46,087 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_ftest______true_valid_memsafety_i__l2_destroy ('l2_destroy') in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,087 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_ftest______true_valid_memsafety_i__calloc_model ('calloc_model') in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,087 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_ftest______true_valid_memsafety_i__l2_insert ('l2_insert') in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,088 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_ftest______true_valid_memsafety_i__l1_insert ('l1_insert') in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,088 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,088 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 21:04:46,088 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int32_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,088 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__div_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,088 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____suseconds_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,088 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__time_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,088 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fsblkcnt_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,088 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__key_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,088 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_mutex_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,089 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_short in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,089 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__uid_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,089 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fd_set in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,089 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_rwlock_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,089 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__locale_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,089 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____rlim_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,089 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____dev_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,089 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsblkcnt_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,089 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__mode_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,089 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int16_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,089 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__lldiv_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,090 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_char in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,090 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____blksize_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,090 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____off64_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,090 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____time_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,090 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____timer_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,090 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int8_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,090 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_quad_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,090 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____id_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,090 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int64_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_mutexattr_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsfilcnt_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____qaddr_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____rlim64_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_long in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_char in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int8_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__blkcnt_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int16_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_short in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__off_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__gid_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ulong in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pid_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__daddr_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____pthread_list_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_attr_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____socklen_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__clock_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____intptr_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_long in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____caddr_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsid_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__size_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____sigset_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_once_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint32_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____ino_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__caddr_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____mode_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__blksize_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____clock_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_spinlock_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____clockid_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__clockid_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fsid_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__dev_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__quad_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_int in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint8_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____blkcnt_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_cond_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int8_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int16_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____key_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____loff_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____useconds_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__wchar_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fd_mask in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__suseconds_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_quad_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____gid_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_barrier_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____quad_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fd_mask in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int64_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ushort in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__loff_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int64_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____WAIT_STATUS in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsblkcnt64_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_condattr_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint16_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____pid_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____daddr_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ldiv_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsfilcnt64_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____blkcnt64_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int32_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_rwlockattr_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ino_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint64_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____swblk_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_barrierattr_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__timer_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____ssize_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int32_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__register_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____sig_atomic_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____locale_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____nlink_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_key_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,097 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____ino64_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,097 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____off_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,097 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__nlink_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,097 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fsfilcnt_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,097 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uid_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,097 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ssize_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,097 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__id_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,097 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__uint in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,097 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__sigset_t in test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,120 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG30d7ad2aa [2018-04-11 21:04:46,123 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 21:04:46,124 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 21:04:46,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 21:04:46,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 21:04:46,128 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 21:04:46,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 09:04:46" (1/1) ... [2018-04-11 21:04:46,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25fea465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:04:46, skipping insertion in model container [2018-04-11 21:04:46,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 09:04:46" (1/1) ... [2018-04-11 21:04:46,145 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 21:04:46,167 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 21:04:46,314 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 21:04:46,351 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 21:04:46,357 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 162 non ball SCCs. Number of states in SCCs 162. [2018-04-11 21:04:46,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:04:46 WrapperNode [2018-04-11 21:04:46,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 21:04:46,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 21:04:46,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 21:04:46,412 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 21:04:46,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:04:46" (1/1) ... [2018-04-11 21:04:46,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:04:46" (1/1) ... [2018-04-11 21:04:46,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:04:46" (1/1) ... [2018-04-11 21:04:46,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:04:46" (1/1) ... [2018-04-11 21:04:46,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:04:46" (1/1) ... [2018-04-11 21:04:46,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:04:46" (1/1) ... [2018-04-11 21:04:46,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:04:46" (1/1) ... [2018-04-11 21:04:46,464 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 21:04:46,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 21:04:46,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 21:04:46,465 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 21:04:46,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:04:46" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 21:04:46,583 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 21:04:46,583 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 21:04:46,583 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_ftest______true_valid_memsafety_i__calloc_model [2018-04-11 21:04:46,583 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_ftest______true_valid_memsafety_i__l2_insert [2018-04-11 21:04:46,583 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_ftest______true_valid_memsafety_i__l2_destroy [2018-04-11 21:04:46,583 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_ftest______true_valid_memsafety_i__l1_insert [2018-04-11 21:04:46,583 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 21:04:46,583 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-04-11 21:04:46,584 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 21:04:46,584 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 21:04:46,584 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 21:04:46,584 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 21:04:46,584 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 21:04:46,584 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 21:04:46,584 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 21:04:46,584 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 21:04:46,584 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 21:04:46,584 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 21:04:46,584 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 21:04:46,585 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 21:04:46,585 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 21:04:46,585 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 21:04:46,585 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 21:04:46,585 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 21:04:46,585 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 21:04:46,585 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 21:04:46,585 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 21:04:46,586 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 21:04:46,586 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 21:04:46,586 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 21:04:46,586 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 21:04:46,586 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 21:04:46,586 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 21:04:46,586 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 21:04:46,586 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 21:04:46,586 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 21:04:46,587 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 21:04:46,587 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 21:04:46,587 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 21:04:46,587 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 21:04:46,587 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 21:04:46,587 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 21:04:46,587 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 21:04:46,587 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 21:04:46,587 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 21:04:46,587 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 21:04:46,588 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 21:04:46,588 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 21:04:46,588 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 21:04:46,588 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 21:04:46,588 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 21:04:46,588 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 21:04:46,588 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 21:04:46,588 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 21:04:46,588 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 21:04:46,589 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 21:04:46,589 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 21:04:46,589 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 21:04:46,589 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 21:04:46,589 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 21:04:46,589 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 21:04:46,589 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 21:04:46,589 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 21:04:46,589 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 21:04:46,589 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 21:04:46,590 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 21:04:46,590 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 21:04:46,590 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 21:04:46,590 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 21:04:46,590 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 21:04:46,590 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 21:04:46,590 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 21:04:46,590 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 21:04:46,590 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 21:04:46,590 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 21:04:46,591 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 21:04:46,591 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 21:04:46,591 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 21:04:46,591 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 21:04:46,591 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 21:04:46,591 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 21:04:46,591 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 21:04:46,591 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 21:04:46,591 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 21:04:46,591 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 21:04:46,592 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 21:04:46,592 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 21:04:46,592 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 21:04:46,592 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 21:04:46,592 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 21:04:46,592 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 21:04:46,592 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 21:04:46,592 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 21:04:46,592 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 21:04:46,592 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 21:04:46,593 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 21:04:46,593 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 21:04:46,593 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 21:04:46,593 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 21:04:46,593 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 21:04:46,593 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 21:04:46,593 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 21:04:46,593 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 21:04:46,593 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 21:04:46,593 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 21:04:46,593 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 21:04:46,594 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 21:04:46,594 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 21:04:46,594 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 21:04:46,594 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 21:04:46,594 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-11 21:04:46,594 INFO L128 BoogieDeclarations]: Found specification of procedure memmove [2018-04-11 21:04:46,594 INFO L128 BoogieDeclarations]: Found specification of procedure memccpy [2018-04-11 21:04:46,594 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-04-11 21:04:46,594 INFO L128 BoogieDeclarations]: Found specification of procedure memcmp [2018-04-11 21:04:46,594 INFO L128 BoogieDeclarations]: Found specification of procedure memchr [2018-04-11 21:04:46,594 INFO L128 BoogieDeclarations]: Found specification of procedure strcpy [2018-04-11 21:04:46,595 INFO L128 BoogieDeclarations]: Found specification of procedure strncpy [2018-04-11 21:04:46,595 INFO L128 BoogieDeclarations]: Found specification of procedure strcat [2018-04-11 21:04:46,595 INFO L128 BoogieDeclarations]: Found specification of procedure strncat [2018-04-11 21:04:46,595 INFO L128 BoogieDeclarations]: Found specification of procedure strcmp [2018-04-11 21:04:46,595 INFO L128 BoogieDeclarations]: Found specification of procedure strncmp [2018-04-11 21:04:46,595 INFO L128 BoogieDeclarations]: Found specification of procedure strcoll [2018-04-11 21:04:46,595 INFO L128 BoogieDeclarations]: Found specification of procedure strxfrm [2018-04-11 21:04:46,595 INFO L128 BoogieDeclarations]: Found specification of procedure strcoll_l [2018-04-11 21:04:46,595 INFO L128 BoogieDeclarations]: Found specification of procedure strxfrm_l [2018-04-11 21:04:46,595 INFO L128 BoogieDeclarations]: Found specification of procedure strdup [2018-04-11 21:04:46,595 INFO L128 BoogieDeclarations]: Found specification of procedure strndup [2018-04-11 21:04:46,596 INFO L128 BoogieDeclarations]: Found specification of procedure strchr [2018-04-11 21:04:46,596 INFO L128 BoogieDeclarations]: Found specification of procedure strrchr [2018-04-11 21:04:46,596 INFO L128 BoogieDeclarations]: Found specification of procedure strcspn [2018-04-11 21:04:46,596 INFO L128 BoogieDeclarations]: Found specification of procedure strspn [2018-04-11 21:04:46,596 INFO L128 BoogieDeclarations]: Found specification of procedure strpbrk [2018-04-11 21:04:46,596 INFO L128 BoogieDeclarations]: Found specification of procedure strstr [2018-04-11 21:04:46,596 INFO L128 BoogieDeclarations]: Found specification of procedure strtok [2018-04-11 21:04:46,596 INFO L128 BoogieDeclarations]: Found specification of procedure __strtok_r [2018-04-11 21:04:46,596 INFO L128 BoogieDeclarations]: Found specification of procedure strtok_r [2018-04-11 21:04:46,596 INFO L128 BoogieDeclarations]: Found specification of procedure strlen [2018-04-11 21:04:46,596 INFO L128 BoogieDeclarations]: Found specification of procedure strnlen [2018-04-11 21:04:46,597 INFO L128 BoogieDeclarations]: Found specification of procedure strerror [2018-04-11 21:04:46,597 INFO L128 BoogieDeclarations]: Found specification of procedure strerror_r [2018-04-11 21:04:46,597 INFO L128 BoogieDeclarations]: Found specification of procedure strerror_l [2018-04-11 21:04:46,597 INFO L128 BoogieDeclarations]: Found specification of procedure __bzero [2018-04-11 21:04:46,597 INFO L128 BoogieDeclarations]: Found specification of procedure bcopy [2018-04-11 21:04:46,597 INFO L128 BoogieDeclarations]: Found specification of procedure bzero [2018-04-11 21:04:46,597 INFO L128 BoogieDeclarations]: Found specification of procedure bcmp [2018-04-11 21:04:46,597 INFO L128 BoogieDeclarations]: Found specification of procedure index [2018-04-11 21:04:46,597 INFO L128 BoogieDeclarations]: Found specification of procedure rindex [2018-04-11 21:04:46,597 INFO L128 BoogieDeclarations]: Found specification of procedure ffs [2018-04-11 21:04:46,597 INFO L128 BoogieDeclarations]: Found specification of procedure strcasecmp [2018-04-11 21:04:46,597 INFO L128 BoogieDeclarations]: Found specification of procedure strncasecmp [2018-04-11 21:04:46,598 INFO L128 BoogieDeclarations]: Found specification of procedure strsep [2018-04-11 21:04:46,598 INFO L128 BoogieDeclarations]: Found specification of procedure strsignal [2018-04-11 21:04:46,598 INFO L128 BoogieDeclarations]: Found specification of procedure __stpcpy [2018-04-11 21:04:46,598 INFO L128 BoogieDeclarations]: Found specification of procedure stpcpy [2018-04-11 21:04:46,598 INFO L128 BoogieDeclarations]: Found specification of procedure __stpncpy [2018-04-11 21:04:46,598 INFO L128 BoogieDeclarations]: Found specification of procedure stpncpy [2018-04-11 21:04:46,598 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_ftest______true_valid_memsafety_i__calloc_model [2018-04-11 21:04:46,598 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 21:04:46,598 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-04-11 21:04:46,598 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 21:04:46,598 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_ftest______true_valid_memsafety_i__l2_insert [2018-04-11 21:04:46,599 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 21:04:46,599 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 21:04:46,599 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_ftest______true_valid_memsafety_i__l2_destroy [2018-04-11 21:04:46,599 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 21:04:46,599 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_ftest______true_valid_memsafety_i__l1_insert [2018-04-11 21:04:46,599 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 21:04:46,599 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 21:04:46,599 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 21:04:46,859 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-11 21:04:46,972 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 21:04:46,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 09:04:46 BoogieIcfgContainer [2018-04-11 21:04:46,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 21:04:46,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 21:04:46,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 21:04:46,976 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 21:04:46,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 09:04:46" (1/3) ... [2018-04-11 21:04:46,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440681bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 09:04:46, skipping insertion in model container [2018-04-11 21:04:46,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:04:46" (2/3) ... [2018-04-11 21:04:46,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440681bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 09:04:46, skipping insertion in model container [2018-04-11 21:04:46,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 09:04:46" (3/3) ... [2018-04-11 21:04:46,979 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0219_true-valid-memsafety.i [2018-04-11 21:04:46,985 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 21:04:46,992 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-04-11 21:04:47,022 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 21:04:47,023 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 21:04:47,023 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 21:04:47,023 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 21:04:47,023 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 21:04:47,023 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 21:04:47,023 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 21:04:47,024 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 21:04:47,024 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 21:04:47,024 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 21:04:47,036 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states. [2018-04-11 21:04:47,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-04-11 21:04:47,042 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:04:47,042 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-04-11 21:04:47,042 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr8RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr6RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr7RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr9RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr8RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:04:47,045 INFO L82 PathProgramCache]: Analyzing trace with hash 6843025, now seen corresponding path program 1 times [2018-04-11 21:04:47,046 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:04:47,046 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:04:47,077 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:04:47,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:04:47,077 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:04:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:04:47,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:04:47,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:04:47,139 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:04:47,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 21:04:47,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 21:04:47,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 21:04:47,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 21:04:47,149 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 3 states. [2018-04-11 21:04:47,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:04:47,265 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2018-04-11 21:04:47,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 21:04:47,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-04-11 21:04:47,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:04:47,275 INFO L225 Difference]: With dead ends: 141 [2018-04-11 21:04:47,275 INFO L226 Difference]: Without dead ends: 138 [2018-04-11 21:04:47,276 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 21:04:47,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-04-11 21:04:47,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 125. [2018-04-11 21:04:47,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-11 21:04:47,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2018-04-11 21:04:47,305 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 4 [2018-04-11 21:04:47,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:04:47,305 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2018-04-11 21:04:47,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 21:04:47,305 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2018-04-11 21:04:47,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-04-11 21:04:47,305 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:04:47,306 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-04-11 21:04:47,306 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr8RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr6RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr7RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr9RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr8RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:04:47,306 INFO L82 PathProgramCache]: Analyzing trace with hash 6843026, now seen corresponding path program 1 times [2018-04-11 21:04:47,306 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:04:47,306 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:04:47,307 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:04:47,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:04:47,307 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:04:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:04:47,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:04:47,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:04:47,343 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:04:47,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 21:04:47,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 21:04:47,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 21:04:47,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 21:04:47,344 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 3 states. [2018-04-11 21:04:47,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:04:47,399 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2018-04-11 21:04:47,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 21:04:47,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-04-11 21:04:47,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:04:47,402 INFO L225 Difference]: With dead ends: 130 [2018-04-11 21:04:47,402 INFO L226 Difference]: Without dead ends: 130 [2018-04-11 21:04:47,403 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 21:04:47,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-04-11 21:04:47,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2018-04-11 21:04:47,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-11 21:04:47,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2018-04-11 21:04:47,413 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 4 [2018-04-11 21:04:47,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:04:47,413 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2018-04-11 21:04:47,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 21:04:47,413 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2018-04-11 21:04:47,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 21:04:47,414 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:04:47,414 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:04:47,414 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr8RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr6RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr7RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr9RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr8RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:04:47,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2071428562, now seen corresponding path program 1 times [2018-04-11 21:04:47,414 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:04:47,414 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:04:47,415 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:04:47,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:04:47,415 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:04:47,428 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:04:47,428 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:04:47,428 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2018-04-11 21:04:47,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-04-11 21:04:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:04:47,461 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:04:47,487 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-11 21:04:47,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:04:47,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:04:47,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 21:04:47,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:04:47,525 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:04:47,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:04:47,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:04:47,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:04:47,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:04:47,526 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand 4 states. [2018-04-11 21:04:47,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:04:47,620 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2018-04-11 21:04:47,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 21:04:47,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-11 21:04:47,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:04:47,621 INFO L225 Difference]: With dead ends: 123 [2018-04-11 21:04:47,621 INFO L226 Difference]: Without dead ends: 123 [2018-04-11 21:04:47,622 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:04:47,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-11 21:04:47,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-04-11 21:04:47,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 21:04:47,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2018-04-11 21:04:47,625 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 15 [2018-04-11 21:04:47,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:04:47,626 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2018-04-11 21:04:47,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:04:47,626 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2018-04-11 21:04:47,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 21:04:47,626 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:04:47,626 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:04:47,626 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr8RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr6RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr7RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr9RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr8RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:04:47,626 INFO L82 PathProgramCache]: Analyzing trace with hash 2071428563, now seen corresponding path program 1 times [2018-04-11 21:04:47,626 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:04:47,626 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:04:47,627 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:04:47,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:04:47,627 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:04:47,637 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:04:47,638 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:04:47,638 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-04-11 21:04:47,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:04:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:04:47,666 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:04:47,674 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 21 treesize of output 20 [2018-04-11 21:04:47,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:04:47,698 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 24 treesize of output 23 [2018-04-11 21:04:47,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:04:47,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:04:47,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-04-11 21:04:47,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:04:47,794 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:04:47,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:04:47,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:04:47,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:04:47,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:04:47,795 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand 4 states. [2018-04-11 21:04:47,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:04:47,926 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2018-04-11 21:04:47,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 21:04:47,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-11 21:04:47,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:04:47,927 INFO L225 Difference]: With dead ends: 122 [2018-04-11 21:04:47,928 INFO L226 Difference]: Without dead ends: 122 [2018-04-11 21:04:47,928 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:04:47,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-04-11 21:04:47,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-04-11 21:04:47,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-11 21:04:47,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2018-04-11 21:04:47,934 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 15 [2018-04-11 21:04:47,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:04:47,934 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2018-04-11 21:04:47,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:04:47,934 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2018-04-11 21:04:47,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 21:04:47,935 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:04:47,935 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] [2018-04-11 21:04:47,936 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr8RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr6RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr7RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr9RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr8RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:04:47,936 INFO L82 PathProgramCache]: Analyzing trace with hash -209811957, now seen corresponding path program 1 times [2018-04-11 21:04:47,936 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:04:47,936 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:04:47,937 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:04:47,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:04:47,937 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:04:47,947 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:04:47,947 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:04:47,947 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-04-11 21:04:47,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:04:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:04:47,984 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:04:47,988 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-11 21:04:47,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:04:47,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:04:47,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 21:04:48,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:04:48,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:04:48,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-04-11 21:04:48,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:04:48,034 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-11 21:04:48,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-11 21:04:48,050 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 21:04:48,077 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:04:48,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 21:04:48,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 21:04:48,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 21:04:48,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:04:48,078 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand 9 states. [2018-04-11 21:04:48,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:04:48,250 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2018-04-11 21:04:48,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 21:04:48,250 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-04-11 21:04:48,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:04:48,251 INFO L225 Difference]: With dead ends: 123 [2018-04-11 21:04:48,252 INFO L226 Difference]: Without dead ends: 123 [2018-04-11 21:04:48,252 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-04-11 21:04:48,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-11 21:04:48,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2018-04-11 21:04:48,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-04-11 21:04:48,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2018-04-11 21:04:48,256 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 45 [2018-04-11 21:04:48,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:04:48,259 INFO L459 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2018-04-11 21:04:48,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 21:04:48,259 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2018-04-11 21:04:48,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 21:04:48,260 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:04:48,260 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] [2018-04-11 21:04:48,260 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr8RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr6RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr7RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr9RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr8RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:04:48,260 INFO L82 PathProgramCache]: Analyzing trace with hash -209811956, now seen corresponding path program 1 times [2018-04-11 21:04:48,261 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:04:48,261 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:04:48,261 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:04:48,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:04:48,262 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:04:48,270 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:04:48,271 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:04:48,271 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-04-11 21:04:48,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:04:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:04:48,323 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:04:48,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:04:48,402 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:04:48,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 21:04:48,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 21:04:48,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 21:04:48,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 21:04:48,403 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand 6 states. [2018-04-11 21:04:48,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:04:48,461 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-04-11 21:04:48,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:04:48,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-04-11 21:04:48,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:04:48,463 INFO L225 Difference]: With dead ends: 125 [2018-04-11 21:04:48,463 INFO L226 Difference]: Without dead ends: 120 [2018-04-11 21:04:48,463 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-11 21:04:48,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-04-11 21:04:48,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-04-11 21:04:48,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-11 21:04:48,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2018-04-11 21:04:48,468 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 45 [2018-04-11 21:04:48,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:04:48,468 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2018-04-11 21:04:48,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 21:04:48,469 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2018-04-11 21:04:48,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 21:04:48,469 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:04:48,470 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:04:48,470 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr8RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr6RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr7RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr9RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr8RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:04:48,470 INFO L82 PathProgramCache]: Analyzing trace with hash -2094426572, now seen corresponding path program 1 times [2018-04-11 21:04:48,470 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:04:48,470 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:04:48,471 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:04:48,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:04:48,471 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:04:48,480 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:04:48,480 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:04:48,480 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-04-11 21:04:48,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:04:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:04:48,517 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:04:48,573 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-11 21:04:48,592 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:04:48,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-11 21:04:48,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 21:04:48,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 21:04:48,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 21:04:48,593 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand 7 states. [2018-04-11 21:04:48,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:04:48,653 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2018-04-11 21:04:48,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 21:04:48,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-04-11 21:04:48,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:04:48,654 INFO L225 Difference]: With dead ends: 126 [2018-04-11 21:04:48,654 INFO L226 Difference]: Without dead ends: 121 [2018-04-11 21:04:48,654 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:04:48,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-04-11 21:04:48,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-04-11 21:04:48,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-04-11 21:04:48,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2018-04-11 21:04:48,657 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 47 [2018-04-11 21:04:48,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:04:48,657 INFO L459 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2018-04-11 21:04:48,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 21:04:48,658 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2018-04-11 21:04:48,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 21:04:48,658 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:04:48,659 INFO L355 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:04:48,659 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr8RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr6RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr7RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr9RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr8RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:04:48,659 INFO L82 PathProgramCache]: Analyzing trace with hash 189910988, now seen corresponding path program 2 times [2018-04-11 21:04:48,659 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:04:48,659 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:04:48,660 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:04:48,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:04:48,660 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:04:48,667 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:04:48,667 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:04:48,667 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-04-11 21:04:48,679 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 21:04:48,767 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 21:04:48,768 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 21:04:48,770 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:04:48,813 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-11 21:04:48,830 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:04:48,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 21:04:48,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 21:04:48,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 21:04:48,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-11 21:04:48,831 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand 8 states. [2018-04-11 21:04:48,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:04:48,893 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2018-04-11 21:04:48,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 21:04:48,893 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-04-11 21:04:48,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:04:48,894 INFO L225 Difference]: With dead ends: 127 [2018-04-11 21:04:48,894 INFO L226 Difference]: Without dead ends: 122 [2018-04-11 21:04:48,894 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-04-11 21:04:48,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-04-11 21:04:48,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-04-11 21:04:48,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-11 21:04:48,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2018-04-11 21:04:48,896 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 49 [2018-04-11 21:04:48,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:04:48,896 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2018-04-11 21:04:48,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 21:04:48,897 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2018-04-11 21:04:48,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 21:04:48,897 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:04:48,897 INFO L355 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:04:48,897 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr8RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr6RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr7RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr9RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr8RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:04:48,897 INFO L82 PathProgramCache]: Analyzing trace with hash -748429836, now seen corresponding path program 3 times [2018-04-11 21:04:48,897 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:04:48,898 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:04:48,898 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:04:48,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 21:04:48,898 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:04:48,904 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:04:48,904 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:04:48,904 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-04-11 21:04:48,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 21:04:48,965 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-04-11 21:04:48,965 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 21:04:48,968 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:04:48,984 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-11 21:04:48,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:04:49,012 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 32 treesize of output 31 [2018-04-11 21:04:49,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:04:49,014 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 36 treesize of output 35 [2018-04-11 21:04:49,015 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:04:49,038 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 35 treesize of output 34 [2018-04-11 21:04:49,038 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:04:49,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:04:49,059 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-04-11 21:04:53,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:04:53,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:04:53,565 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-11 21:04:53,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:04:53,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:04:53,571 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-11 21:04:53,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:04:53,578 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-11 21:04:53,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-04-11 21:04:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-04-11 21:04:53,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:04:53,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 21:04:53,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 21:04:53,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 21:04:53,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=144, Unknown=2, NotChecked=0, Total=182 [2018-04-11 21:04:53,616 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand 14 states. [2018-04-11 21:04:54,444 WARN L151 SmtUtils]: Spent 486ms on a formula simplification. DAG size of input: 46 DAG size of output 35 [2018-04-11 21:04:54,775 WARN L151 SmtUtils]: Spent 287ms on a formula simplification. DAG size of input: 53 DAG size of output 42 [2018-04-11 21:05:02,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:05:02,939 INFO L93 Difference]: Finished difference Result 153 states and 161 transitions. [2018-04-11 21:05:02,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 21:05:02,939 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2018-04-11 21:05:02,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:05:02,940 INFO L225 Difference]: With dead ends: 153 [2018-04-11 21:05:02,940 INFO L226 Difference]: Without dead ends: 153 [2018-04-11 21:05:02,940 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=82, Invalid=296, Unknown=2, NotChecked=0, Total=380 [2018-04-11 21:05:02,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-11 21:05:02,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 119. [2018-04-11 21:05:02,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-04-11 21:05:02,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2018-04-11 21:05:02,943 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 51 [2018-04-11 21:05:02,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:05:02,943 INFO L459 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2018-04-11 21:05:02,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 21:05:02,943 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2018-04-11 21:05:02,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 21:05:02,944 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:05:02,944 INFO L355 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:05:02,944 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr8RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr6RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr7RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr9RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr8RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:05:02,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1298000585, now seen corresponding path program 1 times [2018-04-11 21:05:02,944 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:05:02,944 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:05:02,945 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:05:02,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 21:05:02,945 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:05:02,953 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:05:02,953 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:05:02,953 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-04-11 21:05:02,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:05:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:05:02,988 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:05:02,990 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-11 21:05:02,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:05:02,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:05:02,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 21:05:03,027 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| 1)) (= (select |c_old(#valid)| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base|) 0))) is different from true [2018-04-11 21:05:03,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:05:03,030 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 5 [2018-04-11 21:05:03,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:05:03,031 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-11 21:05:03,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-04-11 21:05:03,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:05:03,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:05:03,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-04-11 21:05:03,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:05:03,060 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-11 21:05:03,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-11 21:05:03,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 20 [2018-04-11 21:05:03,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:05:03,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 21:05:03,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-04-11 21:05:03,110 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 2 not checked. [2018-04-11 21:05:03,137 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:05:03,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 21:05:03,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 21:05:03,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 21:05:03,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=123, Unknown=2, NotChecked=22, Total=182 [2018-04-11 21:05:03,138 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand 14 states. [2018-04-11 21:05:03,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:05:03,560 INFO L93 Difference]: Finished difference Result 133 states and 140 transitions. [2018-04-11 21:05:03,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 21:05:03,560 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2018-04-11 21:05:03,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:05:03,561 INFO L225 Difference]: With dead ends: 133 [2018-04-11 21:05:03,561 INFO L226 Difference]: Without dead ends: 133 [2018-04-11 21:05:03,562 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=410, Unknown=2, NotChecked=42, Total=552 [2018-04-11 21:05:03,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-11 21:05:03,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 116. [2018-04-11 21:05:03,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-11 21:05:03,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 121 transitions. [2018-04-11 21:05:03,565 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 121 transitions. Word has length 54 [2018-04-11 21:05:03,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:05:03,565 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 121 transitions. [2018-04-11 21:05:03,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 21:05:03,565 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2018-04-11 21:05:03,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 21:05:03,566 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:05:03,567 INFO L355 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:05:03,567 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr8RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr6RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr7RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr9RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr8RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:05:03,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1298000584, now seen corresponding path program 1 times [2018-04-11 21:05:03,568 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:05:03,568 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:05:03,568 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:05:03,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:05:03,568 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:05:03,574 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:05:03,575 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:05:03,575 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-04-11 21:05:03,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:05:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:05:03,614 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:05:03,637 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 24 treesize of output 23 [2018-04-11 21:05:03,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:05:03,654 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 27 treesize of output 26 [2018-04-11 21:05:03,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:05:03,668 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 23 treesize of output 22 [2018-04-11 21:05:03,668 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:05:03,670 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 26 treesize of output 25 [2018-04-11 21:05:03,670 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:05:03,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:05:03,682 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-04-11 21:05:04,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:05:04,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:05:04,137 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 42 treesize of output 51 [2018-04-11 21:05:04,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:05:04,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:05:04,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:05:04,168 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 33 treesize of output 42 [2018-04-11 21:05:04,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:05:04,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:05:04,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:05:04,195 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 34 treesize of output 28 [2018-04-11 21:05:04,195 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:05:04,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:05:04,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:05:04,217 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 32 treesize of output 26 [2018-04-11 21:05:04,217 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:05:04,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-11 21:05:04,234 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:83, output treesize:47 [2018-04-11 21:05:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-04-11 21:05:04,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:05:04,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 21:05:04,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 21:05:04,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 21:05:04,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-04-11 21:05:04,287 INFO L87 Difference]: Start difference. First operand 116 states and 121 transitions. Second operand 15 states. [2018-04-11 21:05:04,685 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 49 DAG size of output 47 [2018-04-11 21:05:15,264 WARN L151 SmtUtils]: Spent 8542ms on a formula simplification. DAG size of input: 63 DAG size of output 61 [2018-04-11 21:05:19,543 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 50 DAG size of output 39 [2018-04-11 21:05:20,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:05:20,047 INFO L93 Difference]: Finished difference Result 153 states and 160 transitions. [2018-04-11 21:05:20,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 21:05:20,047 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-04-11 21:05:20,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:05:20,048 INFO L225 Difference]: With dead ends: 153 [2018-04-11 21:05:20,048 INFO L226 Difference]: Without dead ends: 149 [2018-04-11 21:05:20,048 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=75, Invalid=304, Unknown=1, NotChecked=0, Total=380 [2018-04-11 21:05:20,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-04-11 21:05:20,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 122. [2018-04-11 21:05:20,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-11 21:05:20,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2018-04-11 21:05:20,051 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 54 [2018-04-11 21:05:20,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:05:20,051 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2018-04-11 21:05:20,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 21:05:20,051 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2018-04-11 21:05:20,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 21:05:20,052 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:05:20,052 INFO L355 BasicCegarLoop]: trace histogram [7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:05:20,052 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr8RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr6RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr7RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr9RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr8RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:05:20,052 INFO L82 PathProgramCache]: Analyzing trace with hash -128314179, now seen corresponding path program 2 times [2018-04-11 21:05:20,052 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:05:20,052 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:05:20,052 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:05:20,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:05:20,053 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:05:20,058 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:05:20,058 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:05:20,059 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-04-11 21:05:20,065 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 21:05:20,241 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 21:05:20,241 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 21:05:20,244 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:05:20,253 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 30 treesize of output 29 [2018-04-11 21:05:20,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:05:20,270 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-11 21:05:20,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:05:20,286 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 29 treesize of output 28 [2018-04-11 21:05:20,286 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:05:20,288 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 32 treesize of output 31 [2018-04-11 21:05:20,288 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:05:20,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:05:20,303 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:60 [2018-04-11 21:05:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 30 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-11 21:05:23,673 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:05:23,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 21:05:23,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 21:05:23,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 21:05:23,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=135, Unknown=2, NotChecked=0, Total=182 [2018-04-11 21:05:23,674 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand 14 states. [2018-04-11 21:05:27,833 WARN L151 SmtUtils]: Spent 4054ms on a formula simplification. DAG size of input: 52 DAG size of output 25 [2018-04-11 21:05:34,020 WARN L151 SmtUtils]: Spent 2032ms on a formula simplification. DAG size of input: 43 DAG size of output 40 [2018-04-11 21:05:49,845 WARN L151 SmtUtils]: Spent 15659ms on a formula simplification. DAG size of input: 46 DAG size of output 41 [2018-04-11 21:06:13,102 WARN L151 SmtUtils]: Spent 23224ms on a formula simplification. DAG size of input: 56 DAG size of output 51 [2018-04-11 21:06:19,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:06:19,695 INFO L93 Difference]: Finished difference Result 155 states and 161 transitions. [2018-04-11 21:06:19,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 21:06:19,695 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-04-11 21:06:19,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:06:19,696 INFO L225 Difference]: With dead ends: 155 [2018-04-11 21:06:19,696 INFO L226 Difference]: Without dead ends: 145 [2018-04-11 21:06:19,696 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 50.6s TimeCoverageRelationStatistics Valid=97, Invalid=320, Unknown=3, NotChecked=0, Total=420 [2018-04-11 21:06:19,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-04-11 21:06:19,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 118. [2018-04-11 21:06:19,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 21:06:19,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2018-04-11 21:06:19,699 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 55 [2018-04-11 21:06:19,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:06:19,699 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2018-04-11 21:06:19,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 21:06:19,699 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2018-04-11 21:06:19,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 21:06:19,700 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:06:19,700 INFO L355 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:06:19,700 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr8RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr6RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr7RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr9RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr8RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:06:19,700 INFO L82 PathProgramCache]: Analyzing trace with hash -238693000, now seen corresponding path program 3 times [2018-04-11 21:06:19,700 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:06:19,700 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:06:19,701 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:06:19,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 21:06:19,701 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:06:19,707 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:06:19,707 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:06:19,708 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-04-11 21:06:19,718 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 21:06:19,791 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-04-11 21:06:19,791 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 21:06:19,793 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:06:19,799 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 30 treesize of output 29 [2018-04-11 21:06:19,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:06:19,816 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 27 treesize of output 26 [2018-04-11 21:06:19,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:06:19,831 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 29 treesize of output 28 [2018-04-11 21:06:19,831 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:06:19,832 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 26 treesize of output 25 [2018-04-11 21:06:19,832 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:06:19,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:06:19,843 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2018-04-11 21:06:20,073 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-11 21:06:20,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:06:20,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:06:20,093 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 30 treesize of output 24 [2018-04-11 21:06:20,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:06:20,110 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 29 treesize of output 28 [2018-04-11 21:06:20,110 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:06:20,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:06:20,130 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 28 treesize of output 22 [2018-04-11 21:06:20,130 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:06:20,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-11 21:06:20,146 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:61, output treesize:47 [2018-04-11 21:06:20,229 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:06:20,230 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-11 21:06:20,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:06:20,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:06:20,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:06:20,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-04-11 21:06:20,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:06:20,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:06:20,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2018-04-11 21:06:20,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:06:20,307 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:06:20,307 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:06:20,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 34 [2018-04-11 21:06:20,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:06:20,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:06:20,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:06:20,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:06:20,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 21:06:20,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:06:20,357 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-11 21:06:20,357 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:23 [2018-04-11 21:06:20,427 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-04-11 21:06:20,444 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:06:20,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 21:06:20,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 21:06:20,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 21:06:20,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-04-11 21:06:20,445 INFO L87 Difference]: Start difference. First operand 118 states and 123 transitions. Second operand 20 states. [2018-04-11 21:06:21,352 WARN L151 SmtUtils]: Spent 547ms on a formula simplification. DAG size of input: 46 DAG size of output 42 [2018-04-11 21:06:23,569 WARN L151 SmtUtils]: Spent 2191ms on a formula simplification. DAG size of input: 69 DAG size of output 47 [2018-04-11 21:06:27,284 WARN L151 SmtUtils]: Spent 3577ms on a formula simplification. DAG size of input: 92 DAG size of output 48 [2018-04-11 21:06:34,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:06:34,111 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2018-04-11 21:06:34,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 21:06:34,111 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 58 [2018-04-11 21:06:34,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:06:34,112 INFO L225 Difference]: With dead ends: 156 [2018-04-11 21:06:34,112 INFO L226 Difference]: Without dead ends: 156 [2018-04-11 21:06:34,112 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2018-04-11 21:06:34,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-11 21:06:34,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 115. [2018-04-11 21:06:34,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-11 21:06:34,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2018-04-11 21:06:34,114 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 58 [2018-04-11 21:06:34,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:06:34,114 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2018-04-11 21:06:34,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 21:06:34,114 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2018-04-11 21:06:34,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 21:06:34,115 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:06:34,115 INFO L355 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:06:34,115 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr8RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr6RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr7RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr9RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr8RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:06:34,115 INFO L82 PathProgramCache]: Analyzing trace with hash 322820043, now seen corresponding path program 1 times [2018-04-11 21:06:34,116 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:06:34,116 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:06:34,116 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:06:34,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 21:06:34,116 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:06:34,122 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:06:34,122 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:06:34,122 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-04-11 21:06:34,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:06:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:06:34,154 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:06:34,157 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 30 treesize of output 29 [2018-04-11 21:06:34,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:06:34,171 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 29 treesize of output 28 [2018-04-11 21:06:34,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:06:34,173 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 27 treesize of output 26 [2018-04-11 21:06:34,173 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:06:34,185 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 26 treesize of output 25 [2018-04-11 21:06:34,185 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:06:34,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:06:34,198 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2018-04-11 21:06:34,657 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_59 Int) (v_prenex_58 Int) (v_prenex_60 Int)) (and (= |c_#length| (store |c_old(#length)| v_prenex_60 (mod (* v_prenex_59 v_prenex_58) 4294967296))) (<= (mod (* v_prenex_58 v_prenex_59) 4294967296) 2147483647) (= |c_#valid| (store |c_old(#valid)| v_prenex_60 1)) (= (select |c_old(#valid)| v_prenex_60) 0))) (exists ((__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb Int) (__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size Int) (|__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse0 (mod (* __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size) 4294967296))) (and (< 2147483647 .cse0) (= (store |c_old(#length)| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| (+ .cse0 (- 4294967296))) |c_#length|) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| 1)) (= (select |c_old(#valid)| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base|) 0))))) is different from true [2018-04-11 21:06:34,662 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-11 21:06:34,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:06:34,681 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 29 treesize of output 28 [2018-04-11 21:06:34,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:06:34,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:06:34,702 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 30 treesize of output 24 [2018-04-11 21:06:34,702 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:06:34,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:06:34,720 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 28 treesize of output 22 [2018-04-11 21:06:34,720 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:06:34,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-11 21:06:34,737 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:61, output treesize:47 [2018-04-11 21:06:34,776 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~ptr~0.base_BEFORE_CALL_8 Int) (v___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb_BEFORE_CALL_7 Int) (v___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size_BEFORE_CALL_7 Int)) (let ((.cse6 (mod (* v___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb_BEFORE_CALL_7 v___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size_BEFORE_CALL_7) 4294967296))) (and (<= .cse6 2147483647) (= (select |c_#length| v___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~ptr~0.base_BEFORE_CALL_8) .cse6) (= 1 (select |c_#valid| v___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~ptr~0.base_BEFORE_CALL_8)))))) (.cse1 (exists ((__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb Int) (__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size Int) (|__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse5 (mod (* __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size) 4294967296))) (and (< 2147483647 .cse5) (= (store |c_old(#length)| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| (+ .cse5 (- 4294967296))) |c_#length|) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| 1)) (= (select |c_old(#valid)| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base|) 0))))) (.cse3 (exists ((v_prenex_49 Int) (v_prenex_48 Int) (v_prenex_47 Int)) (let ((.cse4 (mod (* v_prenex_48 v_prenex_49) 4294967296))) (and (= (+ (select |c_#length| v_prenex_47) 4294967296) .cse4) (< 2147483647 .cse4) (= 1 (select |c_#valid| v_prenex_47)))))) (.cse2 (exists ((v_prenex_59 Int) (v_prenex_58 Int) (v_prenex_60 Int)) (and (= |c_#length| (store |c_old(#length)| v_prenex_60 (mod (* v_prenex_59 v_prenex_58) 4294967296))) (<= (mod (* v_prenex_58 v_prenex_59) 4294967296) 2147483647) (= |c_#valid| (store |c_old(#valid)| v_prenex_60 1)) (= (select |c_old(#valid)| v_prenex_60) 0))))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) is different from true [2018-04-11 21:06:34,796 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_69 Int) (v_prenex_73 Int) (v_prenex_71 Int)) (let ((.cse0 (mod (* v_prenex_71 v_prenex_69) 4294967296))) (and (< 2147483647 .cse0) (= (+ (select |c_#length| v_prenex_73) 4294967296) .cse0) (= 1 (select |c_#valid| v_prenex_73))))) (exists ((v_prenex_74 Int) (v_prenex_70 Int) (v_prenex_72 Int)) (let ((.cse1 (mod (* v_prenex_72 v_prenex_70) 4294967296))) (and (<= .cse1 2147483647) (= |c_#valid| (store |c_old(#valid)| v_prenex_74 1)) (= (select |c_old(#valid)| v_prenex_74) 0) (= |c_#length| (store |c_old(#length)| v_prenex_74 .cse1)))))) (and (exists ((v___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~ptr~0.base_BEFORE_CALL_8 Int) (v___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb_BEFORE_CALL_7 Int) (v___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size_BEFORE_CALL_7 Int)) (let ((.cse2 (mod (* v___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb_BEFORE_CALL_7 v___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size_BEFORE_CALL_7) 4294967296))) (and (<= .cse2 2147483647) (= (select |c_#length| v___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~ptr~0.base_BEFORE_CALL_8) .cse2) (= 1 (select |c_#valid| v___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~ptr~0.base_BEFORE_CALL_8))))) (exists ((__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb Int) (__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size Int) (|__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse3 (mod (* __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size) 4294967296))) (and (< 2147483647 .cse3) (= (store |c_old(#length)| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| (+ .cse3 (- 4294967296))) |c_#length|) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| 1)) (= (select |c_old(#valid)| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base|) 0))))) (and (exists ((v_prenex_63 Int) (v_prenex_65 Int) (v_prenex_64 Int)) (let ((.cse4 (mod (* v_prenex_64 v_prenex_65) 4294967296))) (and (= 1 (select |c_#valid| v_prenex_63)) (<= .cse4 2147483647) (= (select |c_#length| v_prenex_63) .cse4)))) (exists ((v_prenex_59 Int) (v_prenex_58 Int) (v_prenex_60 Int)) (and (= |c_#length| (store |c_old(#length)| v_prenex_60 (mod (* v_prenex_59 v_prenex_58) 4294967296))) (<= (mod (* v_prenex_58 v_prenex_59) 4294967296) 2147483647) (= |c_#valid| (store |c_old(#valid)| v_prenex_60 1)) (= (select |c_old(#valid)| v_prenex_60) 0)))) (and (exists ((v_prenex_49 Int) (v_prenex_48 Int) (v_prenex_47 Int)) (let ((.cse5 (mod (* v_prenex_48 v_prenex_49) 4294967296))) (and (= (+ (select |c_#length| v_prenex_47) 4294967296) .cse5) (< 2147483647 .cse5) (= 1 (select |c_#valid| v_prenex_47))))) (exists ((v_prenex_67 Int) (v_prenex_66 Int) (v_prenex_68 Int)) (and (= |c_#valid| (store |c_old(#valid)| v_prenex_67 1)) (= |c_#length| (store |c_old(#length)| v_prenex_67 (+ (mod (* v_prenex_68 v_prenex_66) 4294967296) (- 4294967296)))) (= (select |c_old(#valid)| v_prenex_67) 0) (< 2147483647 (mod (* v_prenex_66 v_prenex_68) 4294967296)))))) is different from true [2018-04-11 21:06:35,121 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 53 refuted. 0 times theorem prover too weak. 17 trivial. 5 not checked. [2018-04-11 21:06:35,146 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:06:35,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 21:06:35,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 21:06:35,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 21:06:35,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=354, Unknown=3, NotChecked=120, Total=552 [2018-04-11 21:06:35,146 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand 24 states. [2018-04-11 21:06:39,621 WARN L148 SmtUtils]: Spent 145ms on a formula simplification that was a NOOP. DAG size: 66 [2018-04-11 21:06:41,460 WARN L148 SmtUtils]: Spent 1699ms on a formula simplification that was a NOOP. DAG size: 40 [2018-04-11 21:06:57,073 WARN L151 SmtUtils]: Spent 12908ms on a formula simplification. DAG size of input: 112 DAG size of output 81 [2018-04-11 21:08:02,534 WARN L151 SmtUtils]: Spent 65094ms on a formula simplification. DAG size of input: 184 DAG size of output 105 [2018-04-11 21:08:22,017 WARN L151 SmtUtils]: Spent 8336ms on a formula simplification. DAG size of input: 92 DAG size of output 90 [2018-04-11 21:08:23,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:08:23,322 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2018-04-11 21:08:23,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 21:08:23,322 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 66 [2018-04-11 21:08:23,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:08:23,323 INFO L225 Difference]: With dead ends: 167 [2018-04-11 21:08:23,323 INFO L226 Difference]: Without dead ends: 163 [2018-04-11 21:08:23,324 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 98.5s TimeCoverageRelationStatistics Valid=197, Invalid=1067, Unknown=8, NotChecked=210, Total=1482 [2018-04-11 21:08:23,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-11 21:08:23,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 121. [2018-04-11 21:08:23,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-04-11 21:08:23,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2018-04-11 21:08:23,328 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 66 [2018-04-11 21:08:23,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:08:23,328 INFO L459 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2018-04-11 21:08:23,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 21:08:23,328 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2018-04-11 21:08:23,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-11 21:08:23,329 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:08:23,329 INFO L355 BasicCegarLoop]: trace histogram [12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:08:23,329 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr8RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr6RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr7RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr9RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr8RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:08:23,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1220318413, now seen corresponding path program 2 times [2018-04-11 21:08:23,329 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:08:23,330 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:08:23,330 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:08:23,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:08:23,330 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:08:23,343 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:08:23,343 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:08:23,343 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-04-11 21:08:23,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 21:08:23,386 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 21:08:23,386 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 21:08:23,389 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:08:23,390 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-11 21:08:23,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:08:23,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:08:23,392 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 21:08:23,401 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| 1)) (= (select |c_old(#valid)| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base|) 0))) is different from true [2018-04-11 21:08:23,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:08:23,403 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 5 [2018-04-11 21:08:23,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:08:23,403 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-11 21:08:23,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-04-11 21:08:23,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:08:23,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:08:23,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-04-11 21:08:23,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:08:23,421 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-11 21:08:23,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-11 21:08:23,455 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-11 21:08:23,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:08:23,456 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-11 21:08:23,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:5 [2018-04-11 21:08:23,488 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_ftest______true_valid_memsafety_i__l2_insert_#t~malloc3.base| Int)) (= |c_#valid| (store (store |c_old(#valid)| c___U_MULTI_ftest______true_valid_memsafety_i__l2_insert_~item~0.base 1) |__U_MULTI_ftest______true_valid_memsafety_i__l2_insert_#t~malloc3.base| 1))) is different from true [2018-04-11 21:08:23,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-04-11 21:08:23,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 22 treesize of output 25 [2018-04-11 21:08:23,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:08:23,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:08:23,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 21:08:23,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:25 [2018-04-11 21:08:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 97 trivial. 2 not checked. [2018-04-11 21:08:23,569 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:08:23,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 21:08:23,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 21:08:23,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 21:08:23,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=161, Unknown=14, NotChecked=54, Total=272 [2018-04-11 21:08:23,570 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand 17 states. [2018-04-11 21:08:24,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:08:24,008 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2018-04-11 21:08:24,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 21:08:24,008 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2018-04-11 21:08:24,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:08:24,009 INFO L225 Difference]: With dead ends: 136 [2018-04-11 21:08:24,009 INFO L226 Difference]: Without dead ends: 136 [2018-04-11 21:08:24,010 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=537, Unknown=46, NotChecked=102, Total=812 [2018-04-11 21:08:24,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-11 21:08:24,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 119. [2018-04-11 21:08:24,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-04-11 21:08:24,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 125 transitions. [2018-04-11 21:08:24,013 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 125 transitions. Word has length 68 [2018-04-11 21:08:24,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:08:24,013 INFO L459 AbstractCegarLoop]: Abstraction has 119 states and 125 transitions. [2018-04-11 21:08:24,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 21:08:24,013 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2018-04-11 21:08:24,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-11 21:08:24,014 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:08:24,014 INFO L355 BasicCegarLoop]: trace histogram [12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:08:24,014 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr8RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr6RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr7RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr9RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr8RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:08:24,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1220318412, now seen corresponding path program 1 times [2018-04-11 21:08:24,014 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:08:24,015 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:08:24,015 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:08:24,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 21:08:24,015 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:08:24,019 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:08:24,019 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:08:24,019 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-04-11 21:08:24,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:08:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:08:24,051 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:08:24,054 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 27 treesize of output 26 [2018-04-11 21:08:24,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:08:24,071 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 30 treesize of output 29 [2018-04-11 21:08:24,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:08:24,087 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 26 treesize of output 25 [2018-04-11 21:08:24,087 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:08:24,088 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 29 treesize of output 28 [2018-04-11 21:08:24,088 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:08:24,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:08:24,101 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2018-04-11 21:08:24,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:08:24,749 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 29 treesize of output 23 [2018-04-11 21:08:24,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:08:24,769 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 23 treesize of output 22 [2018-04-11 21:08:24,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:08:24,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:08:24,802 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 31 treesize of output 25 [2018-04-11 21:08:24,802 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:08:24,819 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 25 treesize of output 24 [2018-04-11 21:08:24,820 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:08:24,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-11 21:08:24,837 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:61, output treesize:47 [2018-04-11 21:08:25,252 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 2 proven. 77 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-04-11 21:08:25,269 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:08:25,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 21:08:25,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 21:08:25,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 21:08:25,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2018-04-11 21:08:25,270 INFO L87 Difference]: Start difference. First operand 119 states and 125 transitions. Second operand 26 states. [2018-04-11 21:08:30,053 WARN L151 SmtUtils]: Spent 372ms on a formula simplification. DAG size of input: 78 DAG size of output 53 [2018-04-11 21:08:57,703 WARN L151 SmtUtils]: Spent 26846ms on a formula simplification. DAG size of input: 95 DAG size of output 69 [2018-04-11 21:09:22,458 WARN L151 SmtUtils]: Spent 22147ms on a formula simplification. DAG size of input: 126 DAG size of output 74 [2018-04-11 21:09:35,913 WARN L151 SmtUtils]: Spent 7175ms on a formula simplification. DAG size of input: 94 DAG size of output 56 [2018-04-11 21:09:39,344 WARN L151 SmtUtils]: Spent 2246ms on a formula simplification. DAG size of input: 90 DAG size of output 87 [2018-04-11 21:09:42,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:09:42,748 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2018-04-11 21:09:42,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 21:09:42,748 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 68 [2018-04-11 21:09:42,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:09:42,749 INFO L225 Difference]: With dead ends: 171 [2018-04-11 21:09:42,749 INFO L226 Difference]: Without dead ends: 167 [2018-04-11 21:09:42,750 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 69.6s TimeCoverageRelationStatistics Valid=261, Invalid=1626, Unknown=5, NotChecked=0, Total=1892 [2018-04-11 21:09:42,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-11 21:09:42,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 120. [2018-04-11 21:09:42,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-11 21:09:42,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2018-04-11 21:09:42,752 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 68 [2018-04-11 21:09:42,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:09:42,752 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2018-04-11 21:09:42,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 21:09:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2018-04-11 21:09:42,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-11 21:09:42,752 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:09:42,752 INFO L355 BasicCegarLoop]: trace histogram [12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:09:42,752 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr8RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr6RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr7RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr9RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr8RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:09:42,753 INFO L82 PathProgramCache]: Analyzing trace with hash 119185260, now seen corresponding path program 2 times [2018-04-11 21:09:42,753 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:09:42,753 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:09:42,753 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:09:42,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:09:42,753 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:09:42,759 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:09:42,759 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:09:42,759 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-04-11 21:09:42,767 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 21:09:42,808 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 21:09:42,808 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 21:09:42,810 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:09:42,840 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 27 treesize of output 26 [2018-04-11 21:09:42,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:09:42,853 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 24 treesize of output 23 [2018-04-11 21:09:42,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:09:42,870 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 26 treesize of output 25 [2018-04-11 21:09:42,871 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:09:42,872 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 23 treesize of output 22 [2018-04-11 21:09:42,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:09:42,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:09:42,886 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-04-11 21:09:47,281 WARN L151 SmtUtils]: Spent 4107ms on a formula simplification. DAG size of input: 116 DAG size of output 33 [2018-04-11 21:09:47,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:09:47,389 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:09:47,389 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 40 treesize of output 49 [2018-04-11 21:09:47,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:09:47,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:09:47,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:09:47,422 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 35 treesize of output 44 [2018-04-11 21:09:47,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:09:47,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:09:47,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:09:47,454 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 34 treesize of output 28 [2018-04-11 21:09:47,455 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:09:47,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:09:47,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:09:47,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-04-11 21:09:47,476 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:09:47,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-11 21:09:47,493 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:83, output treesize:47 [2018-04-11 21:09:47,561 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 57 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-04-11 21:09:47,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:09:47,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 21:09:47,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 21:09:47,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 21:09:47,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-04-11 21:09:47,579 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand 18 states. [2018-04-11 21:09:48,010 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 49 DAG size of output 47 [2018-04-11 21:09:55,874 WARN L151 SmtUtils]: Spent 7822ms on a formula simplification. DAG size of input: 63 DAG size of output 61 [2018-04-11 21:10:00,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:10:00,854 INFO L93 Difference]: Finished difference Result 160 states and 167 transitions. [2018-04-11 21:10:00,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 21:10:00,854 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 68 [2018-04-11 21:10:00,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:10:00,855 INFO L225 Difference]: With dead ends: 160 [2018-04-11 21:10:00,855 INFO L226 Difference]: Without dead ends: 147 [2018-04-11 21:10:00,855 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2018-04-11 21:10:00,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-11 21:10:00,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 120. [2018-04-11 21:10:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-11 21:10:00,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 126 transitions. [2018-04-11 21:10:00,858 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 126 transitions. Word has length 68 [2018-04-11 21:10:00,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:10:00,859 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 126 transitions. [2018-04-11 21:10:00,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 21:10:00,859 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2018-04-11 21:10:00,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 21:10:00,859 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:10:00,859 INFO L355 BasicCegarLoop]: trace histogram [13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:10:00,859 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr8RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr6RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr7RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr9RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr8RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:10:00,860 INFO L82 PathProgramCache]: Analyzing trace with hash -624839119, now seen corresponding path program 3 times [2018-04-11 21:10:00,860 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:10:00,860 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:10:00,860 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:10:00,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 21:10:00,860 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:10:00,864 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:10:00,864 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:10:00,864 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-04-11 21:10:00,881 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 21:10:00,927 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-04-11 21:10:00,927 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 21:10:00,930 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:10:00,931 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-11 21:10:00,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:10:00,936 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-11 21:10:00,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:10:00,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:10:00,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 21:10:00,965 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_139 Int) (v_prenex_141 Int) (v_prenex_140 Int)) (let ((.cse0 (mod (* v_prenex_139 v_prenex_140) 4294967296))) (and (= (select |c_old(#valid)| v_prenex_141) 0) (= |c_#length| (store |c_old(#length)| v_prenex_141 (+ .cse0 (- 4294967296)))) (< 2147483647 .cse0)))) (exists ((__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb Int) (__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size Int) (|__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse1 (mod (* __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size) 4294967296))) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| .cse1)) (<= .cse1 2147483647) (= (select |c_old(#valid)| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base|) 0))))) is different from true [2018-04-11 21:10:00,969 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 23 treesize of output 22 [2018-04-11 21:10:00,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:10:00,990 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 25 treesize of output 20 [2018-04-11 21:10:00,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:10:01,006 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 22 treesize of output 17 [2018-04-11 21:10:01,006 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:10:01,020 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 20 treesize of output 19 [2018-04-11 21:10:01,020 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:10:01,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-11 21:10:01,034 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-04-11 21:10:03,036 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb Int) (__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size Int) (|__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse0 (mod (* __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size) 4294967296))) (and (= (select |c_#length| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base|) .cse0) (<= .cse0 2147483647)))) (exists ((v_prenex_139 Int) (v_prenex_141 Int) (v_prenex_140 Int)) (let ((.cse1 (mod (* v_prenex_139 v_prenex_140) 4294967296))) (and (= .cse1 (+ (select |c_#length| v_prenex_141) 4294967296)) (< 2147483647 .cse1))))) is different from true [2018-04-11 21:10:03,901 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse2 (exists ((__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb Int) (__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size Int) (|__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse5 (mod (* __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size) 4294967296))) (and (= (select |c_#length| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base|) .cse5) (<= .cse5 2147483647))))) (.cse0 (exists ((v_prenex_149 Int) (v_prenex_148 Int) (v_prenex_144 Int)) (and (= |c_#length| (store |c_old(#length)| v_prenex_148 (+ (mod (* v_prenex_149 v_prenex_144) 4294967296) (- 4294967296)))) (< 2147483647 (mod (* v_prenex_144 v_prenex_149) 4294967296)) (= (select |c_old(#valid)| v_prenex_148) 0)))) (.cse1 (exists ((v_prenex_139 Int) (v_prenex_141 Int) (v_prenex_140 Int)) (let ((.cse4 (mod (* v_prenex_139 v_prenex_140) 4294967296))) (and (= .cse4 (+ (select |c_#length| v_prenex_141) 4294967296)) (< 2147483647 .cse4))))) (.cse3 (exists ((v_prenex_147 Int) (v_prenex_145 Int) (v_prenex_146 Int)) (and (= (select |c_old(#valid)| v_prenex_147) 0) (= (store |c_old(#length)| v_prenex_147 (mod (* v_prenex_146 v_prenex_145) 4294967296)) |c_#length|) (<= (mod (* v_prenex_145 v_prenex_146) 4294967296) 2147483647))))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse2 .cse0) (and .cse1 .cse3))) is different from true [2018-04-11 21:10:05,922 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_149 Int) (v_prenex_148 Int) (v_prenex_144 Int)) (and (= |c_#length| (store |c_old(#length)| v_prenex_148 (+ (mod (* v_prenex_149 v_prenex_144) 4294967296) (- 4294967296)))) (< 2147483647 (mod (* v_prenex_144 v_prenex_149) 4294967296)) (= (select |c_old(#valid)| v_prenex_148) 0))) (exists ((v_prenex_139 Int) (v_prenex_141 Int) (v_prenex_140 Int)) (let ((.cse0 (mod (* v_prenex_139 v_prenex_140) 4294967296))) (and (= .cse0 (+ (select |c_#length| v_prenex_141) 4294967296)) (< 2147483647 .cse0))))) (and (exists ((v_prenex_156 Int) (v_prenex_161 Int) (v_prenex_160 Int)) (let ((.cse1 (mod (* v_prenex_156 v_prenex_161) 4294967296))) (and (< 2147483647 .cse1) (= .cse1 (+ (select |c_#length| v_prenex_160) 4294967296))))) (exists ((v_prenex_158 Int) (v_prenex_159 Int) (v_prenex_157 Int)) (and (= (select |c_old(#valid)| v_prenex_157) 0) (<= (mod (* v_prenex_158 v_prenex_159) 4294967296) 2147483647) (= |c_#length| (store |c_old(#length)| v_prenex_157 (mod (* v_prenex_159 v_prenex_158) 4294967296)))))) (and (exists ((__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb Int) (__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size Int) (|__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse2 (mod (* __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size) 4294967296))) (and (= (select |c_#length| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base|) .cse2) (<= .cse2 2147483647)))) (exists ((v_prenex_147 Int) (v_prenex_145 Int) (v_prenex_146 Int)) (and (= (select |c_old(#valid)| v_prenex_147) 0) (= (store |c_old(#length)| v_prenex_147 (mod (* v_prenex_146 v_prenex_145) 4294967296)) |c_#length|) (<= (mod (* v_prenex_145 v_prenex_146) 4294967296) 2147483647)))) (and (exists ((v_prenex_154 Int) (v_prenex_150 Int) (v_prenex_151 Int)) (let ((.cse3 (mod (* v_prenex_150 v_prenex_154) 4294967296))) (and (= (select |c_#length| v_prenex_151) .cse3) (<= .cse3 2147483647)))) (exists ((v_prenex_155 Int) (v_prenex_152 Int) (v_prenex_153 Int)) (let ((.cse4 (mod (* v_prenex_155 v_prenex_152) 4294967296))) (and (= (select |c_old(#valid)| v_prenex_153) 0) (< 2147483647 .cse4) (= |c_#length| (store |c_old(#length)| v_prenex_153 (+ .cse4 (- 4294967296))))))))) is different from true [2018-04-11 21:10:05,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:05,937 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 52 treesize of output 55 [2018-04-11 21:10:05,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:10:06,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:06,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:06,479 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 54 treesize of output 48 [2018-04-11 21:10:06,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:10:07,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:07,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:07,237 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 56 treesize of output 50 [2018-04-11 21:10:07,237 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:10:07,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:07,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:07,900 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 51 treesize of output 45 [2018-04-11 21:10:07,900 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:10:08,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:08,634 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 50 treesize of output 61 [2018-04-11 21:10:08,634 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:10:09,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:09,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:09,073 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 54 treesize of output 48 [2018-04-11 21:10:09,073 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:10:09,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:09,597 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 48 treesize of output 59 [2018-04-11 21:10:09,597 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 21:10:10,072 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 48 treesize of output 47 [2018-04-11 21:10:10,072 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:10:10,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 24 dim-0 vars, 8 dim-1 vars, End of recursive call: 24 dim-0 vars, and 4 xjuncts. [2018-04-11 21:10:10,426 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 32 variables, input treesize:217, output treesize:181 [2018-04-11 21:10:23,372 WARN L151 SmtUtils]: Spent 12758ms on a formula simplification. DAG size of input: 109 DAG size of output 38 [2018-04-11 21:10:23,385 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_169 Int) (v_prenex_168 Int)) (and (<= (mod (* v_prenex_168 v_prenex_169) 4294967296) 2147483647) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| (mod (* v_prenex_169 v_prenex_168) 4294967296))))) (exists ((__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb Int) (__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size Int)) (let ((.cse0 (mod (* __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size) 4294967296))) (and (< 2147483647 .cse0) (= (store |c_old(#length)| |c___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| (+ .cse0 (- 4294967296))) |c_#length|))))) is different from true [2018-04-11 21:10:23,388 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_169 Int) (v_prenex_168 Int)) (and (<= (mod (* v_prenex_168 v_prenex_169) 4294967296) 2147483647) (= |c_#length| (store |c_old(#length)| c___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~ptr~0.base (mod (* v_prenex_169 v_prenex_168) 4294967296))))) (exists ((__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb Int) (__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size Int)) (let ((.cse0 (mod (* __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size) 4294967296))) (and (< 2147483647 .cse0) (= |c_#length| (store |c_old(#length)| c___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~ptr~0.base (+ .cse0 (- 4294967296)))))))) is different from true [2018-04-11 21:10:23,390 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 18 treesize of output 17 [2018-04-11 21:10:23,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:10:23,404 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 20 treesize of output 19 [2018-04-11 21:10:23,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:10:23,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-11 21:10:23,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:39, output treesize:37 [2018-04-11 21:10:27,440 WARN L148 SmtUtils]: Spent 4007ms on a formula simplification that was a NOOP. DAG size: 27 [2018-04-11 21:10:36,329 WARN L151 SmtUtils]: Spent 8849ms on a formula simplification. DAG size of input: 55 DAG size of output 28 [2018-04-11 21:10:36,332 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_174 Int) (v_prenex_172 Int)) (and (< 2147483647 (mod (* v_prenex_172 v_prenex_174) 4294967296)) (= (store |c_old(#length)| |c___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#res.base| (+ (mod (* v_prenex_174 v_prenex_172) 4294967296) (- 4294967296))) |c_#length|))) (exists ((v_prenex_175 Int) (v_prenex_173 Int)) (let ((.cse0 (mod (* v_prenex_175 v_prenex_173) 4294967296))) (and (<= .cse0 2147483647) (= (store |c_old(#length)| |c___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#res.base| .cse0) |c_#length|))))) is different from true [2018-04-11 21:10:36,336 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_174 Int) (v_prenex_172 Int)) (and (< 2147483647 (mod (* v_prenex_172 v_prenex_174) 4294967296)) (= (store |c_old(#length)| |c___U_MULTI_ftest______true_valid_memsafety_i__l2_insert_#t~ret2.base| (+ (mod (* v_prenex_174 v_prenex_172) 4294967296) (- 4294967296))) |c_#length|))) (exists ((v_prenex_175 Int) (v_prenex_173 Int)) (let ((.cse0 (mod (* v_prenex_175 v_prenex_173) 4294967296))) (and (<= .cse0 2147483647) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_ftest______true_valid_memsafety_i__l2_insert_#t~ret2.base| .cse0)))))) is different from true [2018-04-11 21:10:36,339 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_174 Int) (v_prenex_172 Int)) (and (= |c_#length| (store |c_old(#length)| c___U_MULTI_ftest______true_valid_memsafety_i__l2_insert_~item~0.base (+ (mod (* v_prenex_174 v_prenex_172) 4294967296) (- 4294967296)))) (< 2147483647 (mod (* v_prenex_172 v_prenex_174) 4294967296)))) (exists ((v_prenex_175 Int) (v_prenex_173 Int)) (let ((.cse0 (mod (* v_prenex_175 v_prenex_173) 4294967296))) (and (<= .cse0 2147483647) (= (store |c_old(#length)| c___U_MULTI_ftest______true_valid_memsafety_i__l2_insert_~item~0.base .cse0) |c_#length|))))) is different from true [2018-04-11 21:10:36,343 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_176 Int) (v_prenex_174 Int) (v_prenex_172 Int)) (and (= (store (store |c_old(#length)| c___U_MULTI_ftest______true_valid_memsafety_i__l2_insert_~item~0.base (+ (mod (* v_prenex_174 v_prenex_172) 4294967296) (- 4294967296))) v_prenex_176 119) |c_#length|) (< 2147483647 (mod (* v_prenex_172 v_prenex_174) 4294967296)))) (exists ((|__U_MULTI_ftest______true_valid_memsafety_i__l2_insert_#t~malloc3.base| Int) (v_prenex_175 Int) (v_prenex_173 Int)) (let ((.cse0 (mod (* v_prenex_175 v_prenex_173) 4294967296))) (and (= (store (store |c_old(#length)| c___U_MULTI_ftest______true_valid_memsafety_i__l2_insert_~item~0.base .cse0) |__U_MULTI_ftest______true_valid_memsafety_i__l2_insert_#t~malloc3.base| 119) |c_#length|) (<= .cse0 2147483647))))) is different from true [2018-04-11 21:10:38,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:38,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:38,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 90 [2018-04-11 21:10:38,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:38,405 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:10:38,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:38,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:38,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:38,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 103 [2018-04-11 21:10:38,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:10:38,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:38,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:38,495 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:10:38,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:38,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:38,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 73 [2018-04-11 21:10:38,499 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:10:38,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:38,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:38,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:38,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:38,628 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:10:38,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:38,636 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:38,636 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:38,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:38,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 105 [2018-04-11 21:10:38,638 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:10:38,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:10:39,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:39,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:39,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:39,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 90 [2018-04-11 21:10:39,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:39,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:39,687 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:39,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:39,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:39,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 82 treesize of output 119 [2018-04-11 21:10:39,722 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 16 xjuncts. [2018-04-11 21:10:40,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:40,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 61 [2018-04-11 21:10:40,108 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-04-11 21:10:40,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:40,311 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:40,314 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:40,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 87 [2018-04-11 21:10:40,332 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-04-11 21:10:40,569 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-04-11 21:10:42,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:42,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:42,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:42,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 88 [2018-04-11 21:10:42,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:42,636 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:10:42,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:42,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:42,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:42,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:42,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:42,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 149 [2018-04-11 21:10:42,663 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 3 xjuncts. [2018-04-11 21:10:42,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:42,934 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:10:42,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:42,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:42,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:42,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 71 [2018-04-11 21:10:42,937 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 21:10:43,015 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:10:43,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:43,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:43,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 69 [2018-04-11 21:10:43,025 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 21:10:43,075 INFO L267 ElimStorePlain]: Start of recursive call 10: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:10:45,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 64 [2018-04-11 21:10:45,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:45,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 61 [2018-04-11 21:10:45,087 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-04-11 21:10:45,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 65 [2018-04-11 21:10:45,223 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-04-11 21:10:45,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:10:45,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 56 treesize of output 95 [2018-04-11 21:10:45,589 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 32 xjuncts. [2018-04-11 21:10:45,880 INFO L267 ElimStorePlain]: Start of recursive call 14: 4 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-04-11 21:10:48,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 28 dim-0 vars, 4 dim-1 vars, End of recursive call: 98 dim-0 vars, and 26 xjuncts. [2018-04-11 21:10:48,016 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 32 variables, input treesize:217, output treesize:889 [2018-04-11 21:11:33,532 WARN L151 SmtUtils]: Spent 41390ms on a formula simplification. DAG size of input: 443 DAG size of output 62 [2018-04-11 21:11:33,557 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 65 not checked. [2018-04-11 21:11:33,574 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:11:33,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 21:11:33,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 21:11:33,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 21:11:33,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=99, Unknown=26, NotChecked=290, Total=462 [2018-04-11 21:11:33,575 INFO L87 Difference]: Start difference. First operand 120 states and 126 transitions. Second operand 22 states. [2018-04-11 21:11:35,710 WARN L1033 $PredicateComparison]: unable to prove that (and (or (exists ((v_prenex_169 Int) (v_prenex_168 Int)) (and (<= (mod (* v_prenex_168 v_prenex_169) 4294967296) 2147483647) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| (mod (* v_prenex_169 v_prenex_168) 4294967296))))) (exists ((__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb Int) (__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size Int)) (let ((.cse0 (mod (* __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size) 4294967296))) (and (< 2147483647 .cse0) (= (store |c_old(#length)| |c___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| (+ .cse0 (- 4294967296))) |c_#length|))))) (= 1 (select |c_#valid| |c_~#list~0.base|)) (= 0 |c_~#list~0.offset|) (= 4 (select |c_#length| |c_~#list~0.base|)) (or (exists ((v_prenex_139 Int) (v_prenex_141 Int) (v_prenex_140 Int)) (let ((.cse1 (mod (* v_prenex_139 v_prenex_140) 4294967296))) (and (= (select |c_old(#valid)| v_prenex_141) 0) (= |c_#length| (store |c_old(#length)| v_prenex_141 (+ .cse1 (- 4294967296)))) (< 2147483647 .cse1)))) (exists ((__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb Int) (__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size Int) (|__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse2 (mod (* __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size) 4294967296))) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| .cse2)) (<= .cse2 2147483647) (= (select |c_old(#valid)| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base|) 0)))))) is different from true [2018-04-11 21:11:35,714 WARN L1033 $PredicateComparison]: unable to prove that (and (or (exists ((v_prenex_139 Int) (v_prenex_141 Int) (v_prenex_140 Int)) (let ((.cse0 (mod (* v_prenex_139 v_prenex_140) 4294967296))) (and (= (select |c_old(#valid)| v_prenex_141) 0) (= |c_#length| (store |c_old(#length)| v_prenex_141 (+ .cse0 (- 4294967296)))) (< 2147483647 .cse0)))) (exists ((__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb Int) (__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size Int) (|__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse1 (mod (* __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size) 4294967296))) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| .cse1)) (<= .cse1 2147483647) (= (select |c_old(#valid)| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base|) 0))))) (or (exists ((v_prenex_169 Int) (v_prenex_168 Int)) (and (<= (mod (* v_prenex_168 v_prenex_169) 4294967296) 2147483647) (= |c_#length| (store |c_old(#length)| c___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~ptr~0.base (mod (* v_prenex_169 v_prenex_168) 4294967296))))) (exists ((__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb Int) (__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size Int)) (let ((.cse2 (mod (* __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size) 4294967296))) (and (< 2147483647 .cse2) (= |c_#length| (store |c_old(#length)| c___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~ptr~0.base (+ .cse2 (- 4294967296))))))))) is different from true [2018-04-11 21:11:36,205 WARN L1033 $PredicateComparison]: unable to prove that (and (or (exists ((__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb Int) (__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size Int) (v_prenex_171 Int)) (let ((.cse0 (mod (* __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size) 4294967296))) (and (< 2147483647 .cse0) (= (+ (select |c_#length| v_prenex_171) 4294967296) .cse0)))) (exists ((v_prenex_169 Int) (v_prenex_168 Int) (v___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~ptr~0.base_BEFORE_CALL_13 Int)) (and (<= (mod (* v_prenex_168 v_prenex_169) 4294967296) 2147483647) (= (select |c_#length| v___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~ptr~0.base_BEFORE_CALL_13) (mod (* v_prenex_169 v_prenex_168) 4294967296))))) (or (exists ((__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb Int) (__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size Int) (|__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse1 (mod (* __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size) 4294967296))) (and (= (select |c_#length| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base|) .cse1) (<= .cse1 2147483647)))) (exists ((v_prenex_139 Int) (v_prenex_141 Int) (v_prenex_140 Int)) (let ((.cse2 (mod (* v_prenex_139 v_prenex_140) 4294967296))) (and (= .cse2 (+ (select |c_#length| v_prenex_141) 4294967296)) (< 2147483647 .cse2)))))) is different from true [2018-04-11 21:11:40,391 WARN L151 SmtUtils]: Spent 4091ms on a formula simplification. DAG size of input: 86 DAG size of output 61 [2018-04-11 21:11:40,583 WARN L1033 $PredicateComparison]: unable to prove that (and (or (exists ((v_prenex_174 Int) (v_prenex_172 Int)) (and (< 2147483647 (mod (* v_prenex_172 v_prenex_174) 4294967296)) (= (store |c_old(#length)| c___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~ptr~0.base (+ (mod (* v_prenex_174 v_prenex_172) 4294967296) (- 4294967296))) |c_#length|))) (exists ((v_prenex_175 Int) (v_prenex_173 Int)) (let ((.cse0 (mod (* v_prenex_175 v_prenex_173) 4294967296))) (and (<= .cse0 2147483647) (= (store |c_old(#length)| c___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~ptr~0.base .cse0) |c_#length|))))) (or (exists ((v_prenex_174 Int) (v_prenex_172 Int)) (and (< 2147483647 (mod (* v_prenex_172 v_prenex_174) 4294967296)) (= (store |c_old(#length)| |c___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#res.base| (+ (mod (* v_prenex_174 v_prenex_172) 4294967296) (- 4294967296))) |c_#length|))) (exists ((v_prenex_175 Int) (v_prenex_173 Int)) (let ((.cse1 (mod (* v_prenex_175 v_prenex_173) 4294967296))) (and (<= .cse1 2147483647) (= (store |c_old(#length)| |c___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#res.base| .cse1) |c_#length|))))) (or (and (exists ((v_prenex_149 Int) (v_prenex_148 Int) (v_prenex_144 Int)) (and (= |c_#length| (store |c_old(#length)| v_prenex_148 (+ (mod (* v_prenex_149 v_prenex_144) 4294967296) (- 4294967296)))) (< 2147483647 (mod (* v_prenex_144 v_prenex_149) 4294967296)) (= (select |c_old(#valid)| v_prenex_148) 0))) (exists ((v_prenex_139 Int) (v_prenex_141 Int) (v_prenex_140 Int)) (let ((.cse2 (mod (* v_prenex_139 v_prenex_140) 4294967296))) (and (= .cse2 (+ (select |c_#length| v_prenex_141) 4294967296)) (< 2147483647 .cse2))))) (and (exists ((v_prenex_156 Int) (v_prenex_161 Int) (v_prenex_160 Int)) (let ((.cse3 (mod (* v_prenex_156 v_prenex_161) 4294967296))) (and (< 2147483647 .cse3) (= .cse3 (+ (select |c_#length| v_prenex_160) 4294967296))))) (exists ((v_prenex_158 Int) (v_prenex_159 Int) (v_prenex_157 Int)) (and (= (select |c_old(#valid)| v_prenex_157) 0) (<= (mod (* v_prenex_158 v_prenex_159) 4294967296) 2147483647) (= |c_#length| (store |c_old(#length)| v_prenex_157 (mod (* v_prenex_159 v_prenex_158) 4294967296)))))) (and (exists ((__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb Int) (__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size Int) (|__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse4 (mod (* __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size) 4294967296))) (and (= (select |c_#length| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base|) .cse4) (<= .cse4 2147483647)))) (exists ((v_prenex_147 Int) (v_prenex_145 Int) (v_prenex_146 Int)) (and (= (select |c_old(#valid)| v_prenex_147) 0) (= (store |c_old(#length)| v_prenex_147 (mod (* v_prenex_146 v_prenex_145) 4294967296)) |c_#length|) (<= (mod (* v_prenex_145 v_prenex_146) 4294967296) 2147483647)))) (and (exists ((v_prenex_154 Int) (v_prenex_150 Int) (v_prenex_151 Int)) (let ((.cse5 (mod (* v_prenex_150 v_prenex_154) 4294967296))) (and (= (select |c_#length| v_prenex_151) .cse5) (<= .cse5 2147483647)))) (exists ((v_prenex_155 Int) (v_prenex_152 Int) (v_prenex_153 Int)) (let ((.cse6 (mod (* v_prenex_155 v_prenex_152) 4294967296))) (and (= (select |c_old(#valid)| v_prenex_153) 0) (< 2147483647 .cse6) (= |c_#length| (store |c_old(#length)| v_prenex_153 (+ .cse6 (- 4294967296)))))))))) is different from true [2018-04-11 21:11:50,505 WARN L151 SmtUtils]: Spent 8246ms on a formula simplification. DAG size of input: 134 DAG size of output 61 [2018-04-11 21:11:53,421 WARN L148 SmtUtils]: Spent 2061ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-11 21:11:53,458 WARN L1033 $PredicateComparison]: unable to prove that (and (or (exists ((v_prenex_169 Int) (v_prenex_168 Int)) (and (<= (mod (* v_prenex_168 v_prenex_169) 4294967296) 2147483647) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| (mod (* v_prenex_169 v_prenex_168) 4294967296))))) (exists ((__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb Int) (__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size Int)) (let ((.cse0 (mod (* __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size) 4294967296))) (and (< 2147483647 .cse0) (= (store |c_old(#length)| |c___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| (+ .cse0 (- 4294967296))) |c_#length|))))) (or (exists ((__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb Int) (__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size Int) (v_prenex_171 Int)) (let ((.cse1 (mod (* __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size) 4294967296))) (and (< 2147483647 .cse1) (= (+ (select |c_#length| v_prenex_171) 4294967296) .cse1)))) (exists ((v_prenex_169 Int) (v_prenex_168 Int) (v___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~ptr~0.base_BEFORE_CALL_13 Int)) (and (<= (mod (* v_prenex_168 v_prenex_169) 4294967296) 2147483647) (= (select |c_#length| v___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~ptr~0.base_BEFORE_CALL_13) (mod (* v_prenex_169 v_prenex_168) 4294967296))))) (or (exists ((v_prenex_139 Int) (v_prenex_141 Int) (v_prenex_140 Int)) (let ((.cse2 (mod (* v_prenex_139 v_prenex_140) 4294967296))) (and (= (select |c_old(#valid)| v_prenex_141) 0) (= |c_#length| (store |c_old(#length)| v_prenex_141 (+ .cse2 (- 4294967296)))) (< 2147483647 .cse2)))) (exists ((__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb Int) (__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size Int) (|__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse3 (mod (* __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size) 4294967296))) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base| .cse3)) (<= .cse3 2147483647) (= (select |c_old(#valid)| |__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_#t~malloc0.base|) 0)))))) is different from true [2018-04-11 21:11:53,722 WARN L1033 $PredicateComparison]: unable to prove that (and (or (exists ((v_prenex_174 Int) (v_prenex_172 Int)) (and (< 2147483647 (mod (* v_prenex_172 v_prenex_174) 4294967296)) (= (store |c_old(#length)| |c___U_MULTI_ftest______true_valid_memsafety_i__l2_insert_#t~ret2.base| (+ (mod (* v_prenex_174 v_prenex_172) 4294967296) (- 4294967296))) |c_#length|))) (exists ((v_prenex_175 Int) (v_prenex_173 Int)) (let ((.cse0 (mod (* v_prenex_175 v_prenex_173) 4294967296))) (and (<= .cse0 2147483647) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_ftest______true_valid_memsafety_i__l2_insert_#t~ret2.base| .cse0)))))) (or (exists ((__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb Int) (__U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size Int) (v_prenex_171 Int)) (let ((.cse1 (mod (* __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~nmemb __U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~size) 4294967296))) (and (< 2147483647 .cse1) (= (+ (select |c_#length| v_prenex_171) 4294967296) .cse1)))) (exists ((v_prenex_169 Int) (v_prenex_168 Int) (v___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~ptr~0.base_BEFORE_CALL_13 Int)) (and (<= (mod (* v_prenex_168 v_prenex_169) 4294967296) 2147483647) (= (select |c_#length| v___U_MULTI_ftest______true_valid_memsafety_i__calloc_model_~ptr~0.base_BEFORE_CALL_13) (mod (* v_prenex_169 v_prenex_168) 4294967296)))))) is different from true [2018-04-11 21:12:33,590 WARN L148 SmtUtils]: Spent 23738ms on a formula simplification that was a NOOP. DAG size: 87 [2018-04-11 21:12:39,905 WARN L148 SmtUtils]: Spent 2009ms on a formula simplification that was a NOOP. DAG size: 30 [2018-04-11 21:13:28,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:13:28,908 INFO L93 Difference]: Finished difference Result 234 states and 252 transitions. [2018-04-11 21:13:28,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 21:13:28,918 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 69 [2018-04-11 21:13:28,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:13:28,919 INFO L225 Difference]: With dead ends: 234 [2018-04-11 21:13:28,919 INFO L226 Difference]: Without dead ends: 234 [2018-04-11 21:13:28,919 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 123.2s TimeCoverageRelationStatistics Valid=110, Invalid=279, Unknown=55, NotChecked=816, Total=1260 [2018-04-11 21:13:28,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-04-11 21:13:28,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 136. [2018-04-11 21:13:28,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-11 21:13:28,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2018-04-11 21:13:28,923 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 69 [2018-04-11 21:13:28,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:13:28,923 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2018-04-11 21:13:28,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 21:13:28,923 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2018-04-11 21:13:28,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-11 21:13:28,924 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:13:28,924 INFO L355 BasicCegarLoop]: trace histogram [13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:13:28,924 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr8RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr6RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr7RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr9RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr8RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:13:28,924 INFO L82 PathProgramCache]: Analyzing trace with hash -542161325, now seen corresponding path program 1 times [2018-04-11 21:13:28,924 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:13:28,924 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:13:28,924 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:13:28,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 21:13:28,925 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:13:28,929 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:13:28,929 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:13:28,929 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-04-11 21:13:28,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:13:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:13:28,960 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:13:28,990 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-04-11 21:13:29,006 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:13:29,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 21:13:29,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 21:13:29,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 21:13:29,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-11 21:13:29,007 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand 6 states. [2018-04-11 21:13:29,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:13:29,103 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2018-04-11 21:13:29,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 21:13:29,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-04-11 21:13:29,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:13:29,104 INFO L225 Difference]: With dead ends: 133 [2018-04-11 21:13:29,104 INFO L226 Difference]: Without dead ends: 133 [2018-04-11 21:13:29,105 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:13:29,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-11 21:13:29,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-04-11 21:13:29,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-11 21:13:29,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2018-04-11 21:13:29,108 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 78 [2018-04-11 21:13:29,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:13:29,108 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2018-04-11 21:13:29,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 21:13:29,108 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2018-04-11 21:13:29,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-11 21:13:29,109 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:13:29,109 INFO L355 BasicCegarLoop]: trace histogram [13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:13:29,109 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr8RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr6RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr7RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr9RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr8RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:13:29,110 INFO L82 PathProgramCache]: Analyzing trace with hash 372868192, now seen corresponding path program 1 times [2018-04-11 21:13:29,110 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:13:29,110 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:13:29,110 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:13:29,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:13:29,110 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:13:29,116 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:13:29,116 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:13:29,116 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-04-11 21:13:29,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:13:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:13:29,165 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:13:29,189 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-11 21:13:29,190 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-11 21:13:29,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:29,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:13:29,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:13:29,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 21:13:29,211 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 17 treesize of output 13 [2018-04-11 21:13:29,212 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 13 treesize of output 5 [2018-04-11 21:13:29,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:29,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:13:29,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:13:29,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-04-11 21:13:29,225 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-04-11 21:13:29,245 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:13:29,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 21:13:29,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 21:13:29,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 21:13:29,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-04-11 21:13:29,246 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand 8 states. [2018-04-11 21:13:29,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:13:29,403 INFO L93 Difference]: Finished difference Result 162 states and 175 transitions. [2018-04-11 21:13:29,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 21:13:29,403 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2018-04-11 21:13:29,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:13:29,404 INFO L225 Difference]: With dead ends: 162 [2018-04-11 21:13:29,404 INFO L226 Difference]: Without dead ends: 162 [2018-04-11 21:13:29,404 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-04-11 21:13:29,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-11 21:13:29,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 134. [2018-04-11 21:13:29,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-11 21:13:29,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2018-04-11 21:13:29,408 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 79 [2018-04-11 21:13:29,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:13:29,409 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2018-04-11 21:13:29,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 21:13:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2018-04-11 21:13:29,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-11 21:13:29,409 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:13:29,409 INFO L355 BasicCegarLoop]: trace histogram [13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:13:29,409 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr8RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr6RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr7RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr9RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr8RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:13:29,409 INFO L82 PathProgramCache]: Analyzing trace with hash 372868193, now seen corresponding path program 1 times [2018-04-11 21:13:29,409 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:13:29,409 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:13:29,410 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:13:29,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:13:29,410 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:13:29,415 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:13:29,415 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:13:29,415 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-04-11 21:13:29,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:13:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:13:29,459 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:13:29,516 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-11 21:13:29,518 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-11 21:13:29,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:29,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:13:29,526 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-11 21:13:29,527 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-11 21:13:29,527 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:29,528 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:13:29,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:13:29,533 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:26 [2018-04-11 21:13:29,551 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 23 treesize of output 19 [2018-04-11 21:13:29,552 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 19 treesize of output 11 [2018-04-11 21:13:29,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:29,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:13:29,556 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 26 treesize of output 20 [2018-04-11 21:13:29,557 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 20 treesize of output 11 [2018-04-11 21:13:29,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:29,559 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:13:29,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:13:29,561 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2018-04-11 21:13:29,571 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-04-11 21:13:29,588 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:13:29,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 21:13:29,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 21:13:29,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 21:13:29,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-04-11 21:13:29,589 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand 11 states. [2018-04-11 21:13:29,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:13:29,809 INFO L93 Difference]: Finished difference Result 181 states and 195 transitions. [2018-04-11 21:13:29,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 21:13:29,809 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2018-04-11 21:13:29,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:13:29,810 INFO L225 Difference]: With dead ends: 181 [2018-04-11 21:13:29,810 INFO L226 Difference]: Without dead ends: 181 [2018-04-11 21:13:29,810 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-04-11 21:13:29,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-04-11 21:13:29,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 134. [2018-04-11 21:13:29,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-11 21:13:29,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2018-04-11 21:13:29,812 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 79 [2018-04-11 21:13:29,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:13:29,813 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2018-04-11 21:13:29,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 21:13:29,813 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2018-04-11 21:13:29,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-11 21:13:29,813 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:13:29,813 INFO L355 BasicCegarLoop]: trace histogram [14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:13:29,813 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr8RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr6RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr7RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr9RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr8RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:13:29,814 INFO L82 PathProgramCache]: Analyzing trace with hash 867614621, now seen corresponding path program 1 times [2018-04-11 21:13:29,814 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:13:29,814 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:13:29,814 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:13:29,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:13:29,814 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:13:29,818 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:13:29,818 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:13:29,818 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-04-11 21:13:29,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:13:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:13:29,861 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:13:29,868 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 17 treesize of output 13 [2018-04-11 21:13:29,869 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 13 treesize of output 5 [2018-04-11 21:13:29,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:29,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:13:29,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:13:29,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-11 21:13:29,911 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-04-11 21:13:29,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:13:29,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:13:29,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:13:29,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:13:29,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:13:29,930 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand 5 states. [2018-04-11 21:13:30,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:13:30,006 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2018-04-11 21:13:30,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:13:30,006 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-04-11 21:13:30,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:13:30,007 INFO L225 Difference]: With dead ends: 146 [2018-04-11 21:13:30,007 INFO L226 Difference]: Without dead ends: 146 [2018-04-11 21:13:30,007 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 21:13:30,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-04-11 21:13:30,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2018-04-11 21:13:30,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-11 21:13:30,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2018-04-11 21:13:30,011 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 83 [2018-04-11 21:13:30,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:13:30,011 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2018-04-11 21:13:30,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:13:30,011 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2018-04-11 21:13:30,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-11 21:13:30,011 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:13:30,011 INFO L355 BasicCegarLoop]: trace histogram [13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:13:30,011 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr8RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr6RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr7RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr9RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr8RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:13:30,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1330996633, now seen corresponding path program 1 times [2018-04-11 21:13:30,012 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:13:30,012 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:13:30,012 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:13:30,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:13:30,012 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:13:30,016 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:13:30,016 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:13:30,017 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-04-11 21:13:30,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:13:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:13:30,060 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:13:30,109 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-11 21:13:30,111 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-11 21:13:30,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:30,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:13:30,122 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-11 21:13:30,123 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-11 21:13:30,124 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:30,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:13:30,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:13:30,132 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:19 [2018-04-11 21:13:30,183 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 23 treesize of output 19 [2018-04-11 21:13:30,184 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 19 treesize of output 11 [2018-04-11 21:13:30,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:30,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:13:30,191 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 26 treesize of output 20 [2018-04-11 21:13:30,193 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 20 treesize of output 11 [2018-04-11 21:13:30,193 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:30,196 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:13:30,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:13:30,199 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2018-04-11 21:13:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-04-11 21:13:30,246 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:13:30,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 21:13:30,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 21:13:30,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 21:13:30,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-04-11 21:13:30,247 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand 12 states. [2018-04-11 21:13:30,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:13:30,576 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2018-04-11 21:13:30,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 21:13:30,577 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 82 [2018-04-11 21:13:30,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:13:30,578 INFO L225 Difference]: With dead ends: 178 [2018-04-11 21:13:30,578 INFO L226 Difference]: Without dead ends: 178 [2018-04-11 21:13:30,578 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-04-11 21:13:30,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-11 21:13:30,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 136. [2018-04-11 21:13:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-11 21:13:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2018-04-11 21:13:30,581 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 82 [2018-04-11 21:13:30,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:13:30,581 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2018-04-11 21:13:30,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 21:13:30,581 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2018-04-11 21:13:30,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-11 21:13:30,582 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:13:30,582 INFO L355 BasicCegarLoop]: trace histogram [14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:13:30,582 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr8RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr6RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr7RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr9RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_insertErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______true_valid_memsafety_i__l2_destroyErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr8RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 21:13:30,582 INFO L82 PathProgramCache]: Analyzing trace with hash -181520773, now seen corresponding path program 1 times [2018-04-11 21:13:30,582 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:13:30,582 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:13:30,582 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:13:30,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:13:30,583 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:13:30,586 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:13:30,586 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:13:30,586 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-04-11 21:13:30,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:13:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:13:30,633 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:13:30,642 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 27 treesize of output 26 [2018-04-11 21:13:30,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:30,643 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 30 treesize of output 29 [2018-04-11 21:13:30,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:30,659 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 29 treesize of output 28 [2018-04-11 21:13:30,659 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:30,674 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 26 treesize of output 25 [2018-04-11 21:13:30,675 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:30,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:13:30,689 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2018-04-11 21:13:31,367 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 32 treesize of output 31 [2018-04-11 21:13:31,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:31,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:31,390 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 31 treesize of output 25 [2018-04-11 21:13:31,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:31,410 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 34 treesize of output 33 [2018-04-11 21:13:31,411 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:31,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:31,435 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 33 treesize of output 27 [2018-04-11 21:13:31,436 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:31,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-11 21:13:31,454 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:67, output treesize:53 [2018-04-11 21:13:34,112 WARN L151 SmtUtils]: Spent 2424ms on a formula simplification. DAG size of input: 147 DAG size of output 142 [2018-04-11 21:13:34,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:34,116 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:34,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 83 [2018-04-11 21:13:34,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:34,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:34,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 54 [2018-04-11 21:13:34,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:34,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:13:35,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:35,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:35,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 85 [2018-04-11 21:13:35,266 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:35,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:35,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:35,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 62 [2018-04-11 21:13:35,269 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:35,298 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:13:35,972 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:35,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:35,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:35,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 61 [2018-04-11 21:13:35,974 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:36,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:36,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:36,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:36,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:36,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 61 [2018-04-11 21:13:36,588 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:37,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:37,087 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 75 [2018-04-11 21:13:37,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:37,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:37,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:37,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 52 [2018-04-11 21:13:37,096 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:37,140 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:13:37,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:37,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:37,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:37,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:37,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 63 [2018-04-11 21:13:37,886 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:38,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:38,360 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 71 [2018-04-11 21:13:38,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:38,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:38,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 42 [2018-04-11 21:13:38,367 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:38,388 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:13:38,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:38,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:38,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:38,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 59 [2018-04-11 21:13:38,901 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:39,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 24 dim-0 vars, 8 dim-1 vars, End of recursive call: 24 dim-0 vars, and 4 xjuncts. [2018-04-11 21:13:39,319 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 32 variables, input treesize:293, output treesize:213 [2018-04-11 21:13:59,233 WARN L148 SmtUtils]: Spent 19861ms on a formula simplification that was a NOOP. DAG size: 126 [2018-04-11 21:13:59,253 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 54 treesize of output 51 [2018-04-11 21:13:59,255 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-11 21:13:59,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:59,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:13:59,752 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 58 treesize of output 55 [2018-04-11 21:13:59,755 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-11 21:13:59,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:59,768 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:14:00,180 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 60 treesize of output 57 [2018-04-11 21:14:00,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-04-11 21:14:00,182 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:14:00,194 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:14:00,611 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 60 treesize of output 57 [2018-04-11 21:14:00,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-04-11 21:14:00,614 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:14:00,634 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:14:00,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 28 dim-0 vars, 4 dim-2 vars, End of recursive call: 24 dim-0 vars, and 4 xjuncts. [2018-04-11 21:14:00,974 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 32 variables, input treesize:233, output treesize:213 [2018-04-11 21:14:20,203 WARN L148 SmtUtils]: Spent 16401ms on a formula simplification that was a NOOP. DAG size: 124 [2018-04-11 21:14:38,610 WARN L148 SmtUtils]: Spent 16270ms on a formula simplification that was a NOOP. DAG size: 123 [2018-04-11 21:14:49,195 WARN L148 SmtUtils]: Spent 10509ms on a formula simplification that was a NOOP. DAG size: 128 [2018-04-11 21:15:08,634 WARN L148 SmtUtils]: Spent 19254ms on a formula simplification that was a NOOP. DAG size: 127 [2018-04-11 21:15:08,642 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 75 treesize of output 69 [2018-04-11 21:15:08,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 23 treesize of output 14 [2018-04-11 21:15:08,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:15:08,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:15:09,204 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 65 treesize of output 61 [2018-04-11 21:15:09,206 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 21:15:09,207 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:15:09,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:15:09,719 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 60 treesize of output 56 [2018-04-11 21:15:09,721 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 21:15:09,721 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:15:09,733 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:15:10,258 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 75 treesize of output 69 [2018-04-11 21:15:10,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 25 treesize of output 16 [2018-04-11 21:15:10,280 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:15:10,306 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:15:10,736 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 60 treesize of output 56 [2018-04-11 21:15:10,739 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 21:15:10,739 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 21:15:10,759 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:15:11,203 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 69 treesize of output 65 [2018-04-11 21:15:11,205 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 19 treesize of output 11 [2018-04-11 21:15:11,205 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 21:15:11,225 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:15:11,716 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 58 treesize of output 54 [2018-04-11 21:15:11,718 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 21:15:11,718 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 21:15:11,729 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:15:12,022 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 54 treesize of output 50 [2018-04-11 21:15:12,024 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 17 treesize of output 9 [2018-04-11 21:15:12,024 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 21:15:12,032 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:15:12,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 28 dim-0 vars, 8 dim-2 vars, End of recursive call: 24 dim-0 vars, and 4 xjuncts. [2018-04-11 21:15:12,403 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 36 variables, input treesize:285, output treesize:189 [2018-04-11 21:15:24,565 WARN L148 SmtUtils]: Spent 12098ms on a formula simplification that was a NOOP. DAG size: 120 [2018-04-11 21:15:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 2 proven. 99 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-04-11 21:15:24,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:15:24,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-11 21:15:24,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 21:15:24,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 21:15:24,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=675, Unknown=8, NotChecked=0, Total=812 [2018-04-11 21:15:24,652 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand 29 states. [2018-04-11 21:15:30,871 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 56 DAG size of output 54 [2018-04-11 21:15:41,294 WARN L151 SmtUtils]: Spent 214ms on a formula simplification. DAG size of input: 66 DAG size of output 64 [2018-04-11 21:16:01,926 WARN L151 SmtUtils]: Spent 7008ms on a formula simplification. DAG size of input: 83 DAG size of output 79 [2018-04-11 21:16:44,632 WARN L151 SmtUtils]: Spent 36144ms on a formula simplification. DAG size of input: 97 DAG size of output 93 [2018-04-11 21:17:21,667 WARN L151 SmtUtils]: Spent 18393ms on a formula simplification. DAG size of input: 76 DAG size of output 74 [2018-04-11 21:17:35,566 WARN L151 SmtUtils]: Spent 7479ms on a formula simplification. DAG size of input: 76 DAG size of output 76 [2018-04-11 21:17:55,281 WARN L151 SmtUtils]: Spent 2144ms on a formula simplification. DAG size of input: 81 DAG size of output 79 [2018-04-11 21:19:19,910 WARN L151 SmtUtils]: Spent 45725ms on a formula simplification. DAG size of input: 157 DAG size of output 157 Received shutdown request... [2018-04-11 21:19:25,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 21:19:25,951 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 21:19:25,955 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 21:19:25,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 09:19:25 BoogieIcfgContainer [2018-04-11 21:19:25,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 21:19:25,956 INFO L168 Benchmark]: Toolchain (without parser) took 879832.64 ms. Allocated memory was 319.8 MB in the beginning and 556.8 MB in the end (delta: 237.0 MB). Free memory was 260.5 MB in the beginning and 226.5 MB in the end (delta: 34.0 MB). Peak memory consumption was 271.0 MB. Max. memory is 5.3 GB. [2018-04-11 21:19:25,957 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 319.8 MB. Free memory is still 289.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 21:19:25,957 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.16 ms. Allocated memory is still 319.8 MB. Free memory was 260.5 MB in the beginning and 224.8 MB in the end (delta: 35.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 5.3 GB. [2018-04-11 21:19:25,957 INFO L168 Benchmark]: Boogie Preprocessor took 52.88 ms. Allocated memory is still 319.8 MB. Free memory was 224.8 MB in the beginning and 222.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 21:19:25,957 INFO L168 Benchmark]: RCFGBuilder took 507.66 ms. Allocated memory was 319.8 MB in the beginning and 394.8 MB in the end (delta: 75.0 MB). Free memory was 222.2 MB in the beginning and 302.5 MB in the end (delta: -80.3 MB). Peak memory consumption was 33.8 MB. Max. memory is 5.3 GB. [2018-04-11 21:19:25,957 INFO L168 Benchmark]: TraceAbstraction took 878982.24 ms. Allocated memory was 394.8 MB in the beginning and 556.8 MB in the end (delta: 162.0 MB). Free memory was 302.5 MB in the beginning and 226.5 MB in the end (delta: 76.0 MB). Peak memory consumption was 238.0 MB. Max. memory is 5.3 GB. [2018-04-11 21:19:25,958 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 319.8 MB. Free memory is still 289.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 287.16 ms. Allocated memory is still 319.8 MB. Free memory was 260.5 MB in the beginning and 224.8 MB in the end (delta: 35.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 52.88 ms. Allocated memory is still 319.8 MB. Free memory was 224.8 MB in the beginning and 222.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 507.66 ms. Allocated memory was 319.8 MB in the beginning and 394.8 MB in the end (delta: 75.0 MB). Free memory was 222.2 MB in the beginning and 302.5 MB in the end (delta: -80.3 MB). Peak memory consumption was 33.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 878982.24 ms. Allocated memory was 394.8 MB in the beginning and 556.8 MB in the end (delta: 162.0 MB). Free memory was 302.5 MB in the beginning and 226.5 MB in the end (delta: 76.0 MB). Peak memory consumption was 238.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 762]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 762). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 761]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 761). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 758]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 758). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 761]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 761). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 758]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 758). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 762]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 762). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 759]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 759). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 761]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 761). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 761]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 761). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 759]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 759). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 787]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 787). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 787]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 787). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 742]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 742]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 782]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 782]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 782]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 782]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 783]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 783). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 783]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 783). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 767]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 767). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 769]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 769). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 768]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 768). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 769]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 769). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 767]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 767). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 768]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 768). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 768]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 768). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 768]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 768). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 793]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 795]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 792]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 794]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 794]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 794]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 792]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 785]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 792]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 793]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 794]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 797]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 797). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 792]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 793]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 795]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 793]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 797]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 797). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 26 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (69 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 132 locations, 45 error locations. TIMEOUT Result, 878.9s OverallTime, 24 OverallIterations, 14 TraceHistogramMax, 652.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2123 SDtfs, 2258 SDslu, 8834 SDs, 0 SdLazy, 11689 SolverSat, 429 SolverUnsat, 421 SolverUnknown, 0 SolverNotchecked, 215.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1461 GetRequests, 1036 SyntacticMatches, 18 SemanticMatches, 407 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 1767 ImplicationChecksByTransitivity, 630.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred 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, 23 MinimizatonAttempts, 532 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 224.0s InterpolantComputationTime, 1323 NumberOfCodeBlocks, 1300 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1299 ConstructedInterpolants, 361 QuantifiedInterpolants, 1840034 SizeOfPredicates, 194 NumberOfNonLiveVariables, 6476 ConjunctsInSsa, 615 ConjunctsInUnsatCore, 24 InterpolantComputations, 11 PerfectInterpolantSequences, 1179/1533 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0219_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_21-19-25-964.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0219_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_21-19-25-964.csv Completed graceful shutdown