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-0235_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 21:03:14,773 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 21:03:14,775 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 21:03:14,788 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 21:03:14,788 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 21:03:14,789 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 21:03:14,790 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 21:03:14,792 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 21:03:14,793 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 21:03:14,794 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 21:03:14,794 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 21:03:14,795 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 21:03:14,795 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 21:03:14,796 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 21:03:14,797 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 21:03:14,799 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 21:03:14,800 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 21:03:14,802 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 21:03:14,803 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 21:03:14,804 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 21:03:14,805 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 21:03:14,805 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 21:03:14,806 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 21:03:14,806 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 21:03:14,807 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 21:03:14,808 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 21:03:14,808 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 21:03:14,809 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 21:03:14,809 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 21:03:14,809 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 21:03:14,810 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 21:03:14,810 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:03:14,831 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 21:03:14,831 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 21:03:14,832 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 21:03:14,832 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 21:03:14,832 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 21:03:14,833 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 21:03:14,833 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 21:03:14,833 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 21:03:14,833 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 21:03:14,833 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 21:03:14,833 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 21:03:14,833 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 21:03:14,833 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 21:03:14,834 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 21:03:14,834 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 21:03:14,834 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 21:03:14,834 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 21:03:14,834 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 21:03:14,834 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 21:03:14,835 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 21:03:14,835 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 21:03:14,835 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 21:03:14,835 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 21:03:14,835 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:03:14,866 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 21:03:14,876 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 21:03:14,879 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 21:03:14,881 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 21:03:14,881 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 21:03:14,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0235_false-valid-deref.i [2018-04-11 21:03:15,176 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG96b44e745 [2018-04-11 21:03:15,328 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 21:03:15,329 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 21:03:15,329 INFO L168 CDTParser]: Scanning test-0235_false-valid-deref.i [2018-04-11 21:03:15,337 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 21:03:15,337 INFO L215 ultiparseSymbolTable]: [2018-04-11 21:03:15,337 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 21:03:15,338 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_ftest______false_valid_deref_i__l2_destroy ('l2_destroy') in test-0235_false-valid-deref.i [2018-04-11 21:03:15,338 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_ftest______false_valid_deref_i__l1_destroy ('l1_destroy') in test-0235_false-valid-deref.i [2018-04-11 21:03:15,338 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_ftest______false_valid_deref_i__l3_destroy ('l3_destroy') in test-0235_false-valid-deref.i [2018-04-11 21:03:15,338 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_ftest______false_valid_deref_i__l0_destroy ('l0_destroy') in test-0235_false-valid-deref.i [2018-04-11 21:03:15,338 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_ftest______false_valid_deref_i__l4_destroy ('l4_destroy') in test-0235_false-valid-deref.i [2018-04-11 21:03:15,338 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_ftest______false_valid_deref_i__zalloc_or_die ('zalloc_or_die') in test-0235_false-valid-deref.i [2018-04-11 21:03:15,338 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_ftest______false_valid_deref_i__calloc_model ('calloc_model') in test-0235_false-valid-deref.i [2018-04-11 21:03:15,338 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_ftest______false_valid_deref_i__l4_insert ('l4_insert') in test-0235_false-valid-deref.i [2018-04-11 21:03:15,338 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_ftest______false_valid_deref_i__l2_insert ('l2_insert') in test-0235_false-valid-deref.i [2018-04-11 21:03:15,338 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_ftest______false_valid_deref_i__l1_insert ('l1_insert') in test-0235_false-valid-deref.i [2018-04-11 21:03:15,338 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_ftest______false_valid_deref_i__l0_insert ('l0_insert') in test-0235_false-valid-deref.i [2018-04-11 21:03:15,338 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-0235_false-valid-deref.i [2018-04-11 21:03:15,338 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_ftest______false_valid_deref_i__l3_insert ('l3_insert') in test-0235_false-valid-deref.i [2018-04-11 21:03:15,338 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 21:03:15,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__pthread_rwlock_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__fd_set in test-0235_false-valid-deref.i [2018-04-11 21:03:15,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____id_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__uid_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__lldiv_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____qaddr_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____rlim64_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____fsblkcnt_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__int16_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__pthread_key_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____u_char in test-0235_false-valid-deref.i [2018-04-11 21:03:15,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____dev_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____caddr_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____off64_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____suseconds_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__u_quad_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____locale_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____rlim_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__sigset_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____pthread_list_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__pthread_barrierattr_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__u_char in test-0235_false-valid-deref.i [2018-04-11 21:03:15,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__blkcnt_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__caddr_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__time_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__div_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____intptr_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__size_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____mode_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__blksize_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____u_long in test-0235_false-valid-deref.i [2018-04-11 21:03:15,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____int16_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____uint32_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____socklen_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__int32_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____ssize_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____quad_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____ino64_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____nlink_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____u_quad_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__pthread_rwlockattr_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____blkcnt64_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____off_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__fd_mask in test-0235_false-valid-deref.i [2018-04-11 21:03:15,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__pthread_barrier_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__fsfilcnt_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__u_int32_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__u_int in test-0235_false-valid-deref.i [2018-04-11 21:03:15,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__key_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____fsblkcnt64_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__timer_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__clockid_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____timer_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____pid_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____int32_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__pthread_mutexattr_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____gid_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__fsblkcnt_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__wchar_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__uint in test-0235_false-valid-deref.i [2018-04-11 21:03:15,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__nlink_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__pthread_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__u_int8_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____u_int in test-0235_false-valid-deref.i [2018-04-11 21:03:15,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__loff_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____fd_mask in test-0235_false-valid-deref.i [2018-04-11 21:03:15,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____uint8_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__pthread_attr_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____sig_atomic_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____uid_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____key_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____int64_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____useconds_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____uint64_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____blkcnt_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__pthread_cond_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____sigset_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__u_int16_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__ssize_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__quad_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____clockid_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____ino_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__off_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__pthread_once_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__pthread_spinlock_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__id_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__dev_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__clock_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____uint16_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__daddr_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____fsid_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__int8_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__u_int64_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__u_short in test-0235_false-valid-deref.i [2018-04-11 21:03:15,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____time_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__gid_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__ushort in test-0235_false-valid-deref.i [2018-04-11 21:03:15,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__ulong in test-0235_false-valid-deref.i [2018-04-11 21:03:15,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__register_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__ldiv_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____fsfilcnt64_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__u_long in test-0235_false-valid-deref.i [2018-04-11 21:03:15,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__pthread_mutex_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__ino_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__locale_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____swblk_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__pid_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__fsid_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____u_short in test-0235_false-valid-deref.i [2018-04-11 21:03:15,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__int64_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__mode_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__suseconds_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____int8_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____fsfilcnt_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____loff_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____daddr_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____blksize_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____clock_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i____WAIT_STATUS in test-0235_false-valid-deref.i [2018-04-11 21:03:15,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______false_valid_deref_i__pthread_condattr_t in test-0235_false-valid-deref.i [2018-04-11 21:03:15,362 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG96b44e745 [2018-04-11 21:03:15,366 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 21:03:15,367 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 21:03:15,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 21:03:15,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 21:03:15,372 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 21:03:15,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 09:03:15" (1/1) ... [2018-04-11 21:03:15,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b7b71d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:03:15, skipping insertion in model container [2018-04-11 21:03:15,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 09:03:15" (1/1) ... [2018-04-11 21:03:15,385 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 21:03:15,409 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 21:03:15,541 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 21:03:15,584 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 21:03:15,590 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 170 non ball SCCs. Number of states in SCCs 170. [2018-04-11 21:03:15,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:03:15 WrapperNode [2018-04-11 21:03:15,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 21:03:15,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 21:03:15,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 21:03:15,650 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 21:03:15,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:03:15" (1/1) ... [2018-04-11 21:03:15,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:03:15" (1/1) ... [2018-04-11 21:03:15,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:03:15" (1/1) ... [2018-04-11 21:03:15,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:03:15" (1/1) ... [2018-04-11 21:03:15,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:03:15" (1/1) ... [2018-04-11 21:03:15,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:03:15" (1/1) ... [2018-04-11 21:03:15,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:03:15" (1/1) ... [2018-04-11 21:03:15,701 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 21:03:15,702 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 21:03:15,702 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 21:03:15,702 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 21:03:15,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:03:15" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 21:03:15,824 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 21:03:15,824 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 21:03:15,824 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_ftest______false_valid_deref_i__calloc_model [2018-04-11 21:03:15,824 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_ftest______false_valid_deref_i__zalloc_or_die [2018-04-11 21:03:15,824 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_ftest______false_valid_deref_i__l4_insert [2018-04-11 21:03:15,824 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_ftest______false_valid_deref_i__l3_insert [2018-04-11 21:03:15,825 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_ftest______false_valid_deref_i__l2_insert [2018-04-11 21:03:15,825 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_ftest______false_valid_deref_i__l1_insert [2018-04-11 21:03:15,825 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_ftest______false_valid_deref_i__l0_insert [2018-04-11 21:03:15,825 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_ftest______false_valid_deref_i__l4_destroy [2018-04-11 21:03:15,825 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_ftest______false_valid_deref_i__l3_destroy [2018-04-11 21:03:15,825 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_ftest______false_valid_deref_i__l2_destroy [2018-04-11 21:03:15,825 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_ftest______false_valid_deref_i__l1_destroy [2018-04-11 21:03:15,825 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_ftest______false_valid_deref_i__l0_destroy [2018-04-11 21:03:15,825 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 21:03:15,826 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-04-11 21:03:15,826 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 21:03:15,826 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 21:03:15,826 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 21:03:15,826 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 21:03:15,826 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 21:03:15,826 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 21:03:15,826 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 21:03:15,827 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 21:03:15,827 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 21:03:15,827 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 21:03:15,827 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 21:03:15,827 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 21:03:15,827 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 21:03:15,827 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 21:03:15,827 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 21:03:15,827 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 21:03:15,827 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 21:03:15,828 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 21:03:15,828 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 21:03:15,828 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 21:03:15,828 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 21:03:15,828 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 21:03:15,828 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 21:03:15,828 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 21:03:15,828 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 21:03:15,828 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 21:03:15,828 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 21:03:15,829 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 21:03:15,829 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 21:03:15,829 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 21:03:15,829 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 21:03:15,829 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 21:03:15,829 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 21:03:15,829 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 21:03:15,829 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 21:03:15,829 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 21:03:15,829 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 21:03:15,830 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 21:03:15,830 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 21:03:15,830 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 21:03:15,830 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 21:03:15,830 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 21:03:15,830 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 21:03:15,830 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 21:03:15,830 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 21:03:15,830 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 21:03:15,830 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 21:03:15,831 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 21:03:15,831 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 21:03:15,831 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 21:03:15,831 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 21:03:15,831 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 21:03:15,831 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 21:03:15,831 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 21:03:15,831 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 21:03:15,831 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 21:03:15,831 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 21:03:15,832 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 21:03:15,832 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 21:03:15,832 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 21:03:15,832 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 21:03:15,832 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 21:03:15,832 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 21:03:15,832 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 21:03:15,832 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 21:03:15,832 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 21:03:15,832 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 21:03:15,833 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 21:03:15,833 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 21:03:15,833 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 21:03:15,833 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 21:03:15,833 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 21:03:15,833 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 21:03:15,833 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 21:03:15,833 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 21:03:15,833 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 21:03:15,833 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 21:03:15,833 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 21:03:15,834 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 21:03:15,834 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 21:03:15,834 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 21:03:15,834 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 21:03:15,834 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 21:03:15,834 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 21:03:15,834 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 21:03:15,834 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 21:03:15,834 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 21:03:15,834 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 21:03:15,835 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 21:03:15,835 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 21:03:15,835 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 21:03:15,835 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 21:03:15,835 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 21:03:15,835 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 21:03:15,835 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 21:03:15,835 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 21:03:15,835 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 21:03:15,835 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 21:03:15,836 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 21:03:15,836 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 21:03:15,836 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 21:03:15,836 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 21:03:15,836 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-11 21:03:15,836 INFO L128 BoogieDeclarations]: Found specification of procedure memmove [2018-04-11 21:03:15,836 INFO L128 BoogieDeclarations]: Found specification of procedure memccpy [2018-04-11 21:03:15,836 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-04-11 21:03:15,836 INFO L128 BoogieDeclarations]: Found specification of procedure memcmp [2018-04-11 21:03:15,836 INFO L128 BoogieDeclarations]: Found specification of procedure memchr [2018-04-11 21:03:15,836 INFO L128 BoogieDeclarations]: Found specification of procedure strcpy [2018-04-11 21:03:15,836 INFO L128 BoogieDeclarations]: Found specification of procedure strncpy [2018-04-11 21:03:15,837 INFO L128 BoogieDeclarations]: Found specification of procedure strcat [2018-04-11 21:03:15,837 INFO L128 BoogieDeclarations]: Found specification of procedure strncat [2018-04-11 21:03:15,837 INFO L128 BoogieDeclarations]: Found specification of procedure strcmp [2018-04-11 21:03:15,837 INFO L128 BoogieDeclarations]: Found specification of procedure strncmp [2018-04-11 21:03:15,837 INFO L128 BoogieDeclarations]: Found specification of procedure strcoll [2018-04-11 21:03:15,837 INFO L128 BoogieDeclarations]: Found specification of procedure strxfrm [2018-04-11 21:03:15,837 INFO L128 BoogieDeclarations]: Found specification of procedure strcoll_l [2018-04-11 21:03:15,837 INFO L128 BoogieDeclarations]: Found specification of procedure strxfrm_l [2018-04-11 21:03:15,837 INFO L128 BoogieDeclarations]: Found specification of procedure strdup [2018-04-11 21:03:15,837 INFO L128 BoogieDeclarations]: Found specification of procedure strndup [2018-04-11 21:03:15,837 INFO L128 BoogieDeclarations]: Found specification of procedure strchr [2018-04-11 21:03:15,838 INFO L128 BoogieDeclarations]: Found specification of procedure strrchr [2018-04-11 21:03:15,838 INFO L128 BoogieDeclarations]: Found specification of procedure strcspn [2018-04-11 21:03:15,838 INFO L128 BoogieDeclarations]: Found specification of procedure strspn [2018-04-11 21:03:15,838 INFO L128 BoogieDeclarations]: Found specification of procedure strpbrk [2018-04-11 21:03:15,838 INFO L128 BoogieDeclarations]: Found specification of procedure strstr [2018-04-11 21:03:15,838 INFO L128 BoogieDeclarations]: Found specification of procedure strtok [2018-04-11 21:03:15,838 INFO L128 BoogieDeclarations]: Found specification of procedure __strtok_r [2018-04-11 21:03:15,838 INFO L128 BoogieDeclarations]: Found specification of procedure strtok_r [2018-04-11 21:03:15,838 INFO L128 BoogieDeclarations]: Found specification of procedure strlen [2018-04-11 21:03:15,838 INFO L128 BoogieDeclarations]: Found specification of procedure strnlen [2018-04-11 21:03:15,838 INFO L128 BoogieDeclarations]: Found specification of procedure strerror [2018-04-11 21:03:15,839 INFO L128 BoogieDeclarations]: Found specification of procedure strerror_r [2018-04-11 21:03:15,839 INFO L128 BoogieDeclarations]: Found specification of procedure strerror_l [2018-04-11 21:03:15,839 INFO L128 BoogieDeclarations]: Found specification of procedure __bzero [2018-04-11 21:03:15,839 INFO L128 BoogieDeclarations]: Found specification of procedure bcopy [2018-04-11 21:03:15,839 INFO L128 BoogieDeclarations]: Found specification of procedure bzero [2018-04-11 21:03:15,839 INFO L128 BoogieDeclarations]: Found specification of procedure bcmp [2018-04-11 21:03:15,839 INFO L128 BoogieDeclarations]: Found specification of procedure index [2018-04-11 21:03:15,839 INFO L128 BoogieDeclarations]: Found specification of procedure rindex [2018-04-11 21:03:15,839 INFO L128 BoogieDeclarations]: Found specification of procedure ffs [2018-04-11 21:03:15,839 INFO L128 BoogieDeclarations]: Found specification of procedure strcasecmp [2018-04-11 21:03:15,839 INFO L128 BoogieDeclarations]: Found specification of procedure strncasecmp [2018-04-11 21:03:15,840 INFO L128 BoogieDeclarations]: Found specification of procedure strsep [2018-04-11 21:03:15,840 INFO L128 BoogieDeclarations]: Found specification of procedure strsignal [2018-04-11 21:03:15,840 INFO L128 BoogieDeclarations]: Found specification of procedure __stpcpy [2018-04-11 21:03:15,840 INFO L128 BoogieDeclarations]: Found specification of procedure stpcpy [2018-04-11 21:03:15,840 INFO L128 BoogieDeclarations]: Found specification of procedure __stpncpy [2018-04-11 21:03:15,840 INFO L128 BoogieDeclarations]: Found specification of procedure stpncpy [2018-04-11 21:03:15,840 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_ftest______false_valid_deref_i__calloc_model [2018-04-11 21:03:15,840 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 21:03:15,840 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-04-11 21:03:15,840 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 21:03:15,840 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_ftest______false_valid_deref_i__zalloc_or_die [2018-04-11 21:03:15,840 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_ftest______false_valid_deref_i__l4_insert [2018-04-11 21:03:15,841 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 21:03:15,841 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 21:03:15,841 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_ftest______false_valid_deref_i__l3_insert [2018-04-11 21:03:15,841 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_ftest______false_valid_deref_i__l2_insert [2018-04-11 21:03:15,841 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_ftest______false_valid_deref_i__l1_insert [2018-04-11 21:03:15,841 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_ftest______false_valid_deref_i__l0_insert [2018-04-11 21:03:15,841 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_ftest______false_valid_deref_i__l4_destroy [2018-04-11 21:03:15,841 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 21:03:15,841 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_ftest______false_valid_deref_i__l3_destroy [2018-04-11 21:03:15,841 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_ftest______false_valid_deref_i__l2_destroy [2018-04-11 21:03:15,841 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_ftest______false_valid_deref_i__l1_destroy [2018-04-11 21:03:15,841 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_ftest______false_valid_deref_i__l0_destroy [2018-04-11 21:03:15,842 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 21:03:15,842 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 21:03:15,842 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 21:03:16,105 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-11 21:03:16,449 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 21:03:16,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 09:03:16 BoogieIcfgContainer [2018-04-11 21:03:16,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 21:03:16,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 21:03:16,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 21:03:16,453 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 21:03:16,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 09:03:15" (1/3) ... [2018-04-11 21:03:16,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ac9138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 09:03:16, skipping insertion in model container [2018-04-11 21:03:16,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:03:15" (2/3) ... [2018-04-11 21:03:16,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ac9138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 09:03:16, skipping insertion in model container [2018-04-11 21:03:16,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 09:03:16" (3/3) ... [2018-04-11 21:03:16,456 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0235_false-valid-deref.i [2018-04-11 21:03:16,464 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 21:03:16,469 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 85 error locations. [2018-04-11 21:03:16,498 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 21:03:16,498 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 21:03:16,499 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 21:03:16,499 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 21:03:16,499 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 21:03:16,499 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 21:03:16,499 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 21:03:16,499 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 21:03:16,499 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 21:03:16,500 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 21:03:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states. [2018-04-11 21:03:16,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-04-11 21:03:16,515 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:03:16,516 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-04-11 21:03:16,516 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_ftest______false_valid_deref_i__l0_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr2RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr6RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr7RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr2AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr3AssertViolationMEMORY_FREE]=== [2018-04-11 21:03:16,519 INFO L82 PathProgramCache]: Analyzing trace with hash 15452624, now seen corresponding path program 1 times [2018-04-11 21:03:16,519 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:03:16,520 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:03:16,548 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:03:16,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:03:16,548 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:03:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:03:16,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:03:16,614 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:03:16,615 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:03:16,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 21:03:16,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 21:03:16,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 21:03:16,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 21:03:16,627 INFO L87 Difference]: Start difference. First operand 287 states. Second operand 3 states. [2018-04-11 21:03:16,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:03:16,867 INFO L93 Difference]: Finished difference Result 418 states and 474 transitions. [2018-04-11 21:03:16,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 21:03:16,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-04-11 21:03:16,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:03:16,877 INFO L225 Difference]: With dead ends: 418 [2018-04-11 21:03:16,877 INFO L226 Difference]: Without dead ends: 415 [2018-04-11 21:03:16,878 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:03:16,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-04-11 21:03:16,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 357. [2018-04-11 21:03:16,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-04-11 21:03:16,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 438 transitions. [2018-04-11 21:03:16,927 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 438 transitions. Word has length 4 [2018-04-11 21:03:16,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:03:16,927 INFO L459 AbstractCegarLoop]: Abstraction has 357 states and 438 transitions. [2018-04-11 21:03:16,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 21:03:16,927 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 438 transitions. [2018-04-11 21:03:16,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-04-11 21:03:16,928 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:03:16,928 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-04-11 21:03:16,928 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_ftest______false_valid_deref_i__l0_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr2RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr6RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr7RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr2AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr3AssertViolationMEMORY_FREE]=== [2018-04-11 21:03:16,928 INFO L82 PathProgramCache]: Analyzing trace with hash 15452625, now seen corresponding path program 1 times [2018-04-11 21:03:16,928 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:03:16,928 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:03:16,929 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:03:16,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:03:16,929 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:03:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:03:16,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:03:16,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:03:16,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:03:16,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 21:03:16,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 21:03:16,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 21:03:16,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 21:03:16,964 INFO L87 Difference]: Start difference. First operand 357 states and 438 transitions. Second operand 3 states. [2018-04-11 21:03:17,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:03:17,041 INFO L93 Difference]: Finished difference Result 364 states and 448 transitions. [2018-04-11 21:03:17,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 21:03:17,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-04-11 21:03:17,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:03:17,043 INFO L225 Difference]: With dead ends: 364 [2018-04-11 21:03:17,043 INFO L226 Difference]: Without dead ends: 364 [2018-04-11 21:03:17,043 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:03:17,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-04-11 21:03:17,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 356. [2018-04-11 21:03:17,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-04-11 21:03:17,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 437 transitions. [2018-04-11 21:03:17,058 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 437 transitions. Word has length 4 [2018-04-11 21:03:17,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:03:17,058 INFO L459 AbstractCegarLoop]: Abstraction has 356 states and 437 transitions. [2018-04-11 21:03:17,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 21:03:17,058 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 437 transitions. [2018-04-11 21:03:17,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 21:03:17,059 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:03:17,059 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:03:17,059 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_ftest______false_valid_deref_i__l0_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr2RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr6RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr7RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr2AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr3AssertViolationMEMORY_FREE]=== [2018-04-11 21:03:17,059 INFO L82 PathProgramCache]: Analyzing trace with hash -727691914, now seen corresponding path program 1 times [2018-04-11 21:03:17,059 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:03:17,060 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:03:17,060 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:03:17,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:03:17,061 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:03:17,076 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:03:17,076 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:03:17,076 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-04-11 21:03:17,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:03:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:03:17,107 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:03:17,133 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:03:17,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:03:17,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:03:17,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 21:03:17,155 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:03:17,173 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:03:17,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:03:17,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:03:17,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:03:17,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:03:17,174 INFO L87 Difference]: Start difference. First operand 356 states and 437 transitions. Second operand 4 states. [2018-04-11 21:03:17,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:03:17,290 INFO L93 Difference]: Finished difference Result 355 states and 436 transitions. [2018-04-11 21:03:17,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 21:03:17,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-11 21:03:17,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:03:17,292 INFO L225 Difference]: With dead ends: 355 [2018-04-11 21:03:17,292 INFO L226 Difference]: Without dead ends: 355 [2018-04-11 21:03:17,292 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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:03:17,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-04-11 21:03:17,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2018-04-11 21:03:17,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-04-11 21:03:17,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 436 transitions. [2018-04-11 21:03:17,304 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 436 transitions. Word has length 17 [2018-04-11 21:03:17,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:03:17,304 INFO L459 AbstractCegarLoop]: Abstraction has 355 states and 436 transitions. [2018-04-11 21:03:17,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:03:17,304 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 436 transitions. [2018-04-11 21:03:17,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 21:03:17,305 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:03:17,305 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:03:17,305 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_ftest______false_valid_deref_i__l0_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr2RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr6RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr7RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr2AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr3AssertViolationMEMORY_FREE]=== [2018-04-11 21:03:17,305 INFO L82 PathProgramCache]: Analyzing trace with hash -727691913, now seen corresponding path program 1 times [2018-04-11 21:03:17,305 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:03:17,305 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:03:17,306 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:03:17,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:03:17,306 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:03:17,317 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:03:17,317 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:03:17,317 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:03:17,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:03:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:03:17,339 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:03:17,352 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:03:17,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:03:17,369 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:03:17,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:03:17,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:03:17,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-04-11 21:03:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:03:17,431 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:03:17,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:03:17,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:03:17,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:03:17,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:03:17,432 INFO L87 Difference]: Start difference. First operand 355 states and 436 transitions. Second operand 4 states. [2018-04-11 21:03:17,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:03:17,636 INFO L93 Difference]: Finished difference Result 354 states and 435 transitions. [2018-04-11 21:03:17,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 21:03:17,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-11 21:03:17,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:03:17,638 INFO L225 Difference]: With dead ends: 354 [2018-04-11 21:03:17,639 INFO L226 Difference]: Without dead ends: 354 [2018-04-11 21:03:17,639 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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:03:17,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-04-11 21:03:17,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2018-04-11 21:03:17,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-04-11 21:03:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 435 transitions. [2018-04-11 21:03:17,650 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 435 transitions. Word has length 17 [2018-04-11 21:03:17,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:03:17,650 INFO L459 AbstractCegarLoop]: Abstraction has 354 states and 435 transitions. [2018-04-11 21:03:17,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:03:17,650 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 435 transitions. [2018-04-11 21:03:17,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-04-11 21:03:17,654 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:03:17,654 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:17,654 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_ftest______false_valid_deref_i__l0_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr2RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr6RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr7RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr2AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr3AssertViolationMEMORY_FREE]=== [2018-04-11 21:03:17,655 INFO L82 PathProgramCache]: Analyzing trace with hash -770120344, now seen corresponding path program 1 times [2018-04-11 21:03:17,655 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:03:17,655 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:03:17,656 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:03:17,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:03:17,656 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:03:17,673 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:03:17,673 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:03:17,673 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:03:17,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:03:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:03:17,787 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:03:17,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 6 treesize of output 5 [2018-04-11 21:03:17,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:03:17,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:03:17,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 21:03:17,892 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| 1)) (= 0 (select |c_old(#valid)| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base|)))) is different from true [2018-04-11 21:03:17,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:03:17,896 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:03:17,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:03:17,898 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:03:17,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-04-11 21:03:17,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:03:17,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:03:17,931 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:03:17,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:03:17,937 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:03:17,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-11 21:03:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 132 proven. 7 refuted. 0 times theorem prover too weak. 129 trivial. 2 not checked. [2018-04-11 21:03:18,015 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:03:18,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 21:03:18,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 21:03:18,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 21:03:18,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=146, Unknown=2, NotChecked=24, Total=210 [2018-04-11 21:03:18,016 INFO L87 Difference]: Start difference. First operand 354 states and 435 transitions. Second operand 15 states. [2018-04-11 21:03:19,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:03:19,042 INFO L93 Difference]: Finished difference Result 550 states and 673 transitions. [2018-04-11 21:03:19,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 21:03:19,043 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-04-11 21:03:19,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:03:19,046 INFO L225 Difference]: With dead ends: 550 [2018-04-11 21:03:19,046 INFO L226 Difference]: Without dead ends: 550 [2018-04-11 21:03:19,047 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 128 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=418, Unknown=2, NotChecked=42, Total=552 [2018-04-11 21:03:19,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-04-11 21:03:19,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 397. [2018-04-11 21:03:19,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-04-11 21:03:19,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 510 transitions. [2018-04-11 21:03:19,059 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 510 transitions. Word has length 142 [2018-04-11 21:03:19,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:03:19,059 INFO L459 AbstractCegarLoop]: Abstraction has 397 states and 510 transitions. [2018-04-11 21:03:19,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 21:03:19,059 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 510 transitions. [2018-04-11 21:03:19,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-04-11 21:03:19,061 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:03:19,061 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:19,061 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_ftest______false_valid_deref_i__l0_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr2RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr6RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr7RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr2AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr3AssertViolationMEMORY_FREE]=== [2018-04-11 21:03:19,061 INFO L82 PathProgramCache]: Analyzing trace with hash -770120343, now seen corresponding path program 1 times [2018-04-11 21:03:19,061 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:03:19,061 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:03:19,062 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:03:19,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:03:19,062 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:03:19,074 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:03:19,075 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:03:19,075 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:03:19,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:03:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:03:19,203 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:03:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-04-11 21:03:19,318 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:03:19,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 21:03:19,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 21:03:19,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 21:03:19,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-11 21:03:19,319 INFO L87 Difference]: Start difference. First operand 397 states and 510 transitions. Second operand 8 states. [2018-04-11 21:03:20,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:03:20,010 INFO L93 Difference]: Finished difference Result 407 states and 520 transitions. [2018-04-11 21:03:20,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 21:03:20,012 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2018-04-11 21:03:20,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:03:20,013 INFO L225 Difference]: With dead ends: 407 [2018-04-11 21:03:20,013 INFO L226 Difference]: Without dead ends: 398 [2018-04-11 21:03:20,013 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-11 21:03:20,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-04-11 21:03:20,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2018-04-11 21:03:20,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-04-11 21:03:20,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 511 transitions. [2018-04-11 21:03:20,020 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 511 transitions. Word has length 142 [2018-04-11 21:03:20,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:03:20,021 INFO L459 AbstractCegarLoop]: Abstraction has 398 states and 511 transitions. [2018-04-11 21:03:20,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 21:03:20,021 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 511 transitions. [2018-04-11 21:03:20,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-04-11 21:03:20,022 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:03:20,022 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:20,023 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_ftest______false_valid_deref_i__l0_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr2RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr6RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr7RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr2AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr3AssertViolationMEMORY_FREE]=== [2018-04-11 21:03:20,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1438075199, now seen corresponding path program 1 times [2018-04-11 21:03:20,023 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:03:20,023 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:03:20,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:03:20,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:03:20,024 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:03:20,034 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:03:20,034 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:03:20,034 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:03:20,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:03:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:03:20,236 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:03:20,362 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 105 proven. 1 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-04-11 21:03:20,391 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:03:20,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 21:03:20,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 21:03:20,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 21:03:20,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:03:20,392 INFO L87 Difference]: Start difference. First operand 398 states and 511 transitions. Second operand 9 states. [2018-04-11 21:03:20,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:03:20,531 INFO L93 Difference]: Finished difference Result 408 states and 521 transitions. [2018-04-11 21:03:20,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 21:03:20,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-04-11 21:03:20,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:03:20,536 INFO L225 Difference]: With dead ends: 408 [2018-04-11 21:03:20,537 INFO L226 Difference]: Without dead ends: 399 [2018-04-11 21:03:20,537 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-04-11 21:03:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-04-11 21:03:20,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-04-11 21:03:20,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-04-11 21:03:20,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 512 transitions. [2018-04-11 21:03:20,548 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 512 transitions. Word has length 148 [2018-04-11 21:03:20,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:03:20,548 INFO L459 AbstractCegarLoop]: Abstraction has 399 states and 512 transitions. [2018-04-11 21:03:20,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 21:03:20,548 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 512 transitions. [2018-04-11 21:03:20,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-04-11 21:03:20,549 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:03:20,550 INFO L355 BasicCegarLoop]: trace histogram [12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:20,550 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_ftest______false_valid_deref_i__l0_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr2RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr6RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr7RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr2AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr3AssertViolationMEMORY_FREE]=== [2018-04-11 21:03:20,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1579748311, now seen corresponding path program 2 times [2018-04-11 21:03:20,550 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:03:20,550 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:03:20,551 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:03:20,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:03:20,551 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:03:20,562 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:03:20,563 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:03:20,563 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:03:20,570 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 21:03:22,087 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 21:03:22,087 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 21:03:22,094 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:03:28,163 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:03:28,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:03:28,169 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:03:28,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:03:28,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 29 treesize of output 28 [2018-04-11 21:03:28,190 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:03:28,205 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:03:28,205 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:03:28,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:03:28,218 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2018-04-11 21:03:46,032 WARN L151 SmtUtils]: Spent 1026ms on a formula simplification. DAG size of input: 127 DAG size of output 21 [2018-04-11 21:03:56,525 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 23 treesize of output 18 [2018-04-11 21:03:56,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:03:56,548 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:03:56,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:03:56,566 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:03:56,566 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:03:56,582 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 24 treesize of output 19 [2018-04-11 21:03:56,582 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:03:56,597 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:03:56,597 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-04-11 21:03:58,605 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_20 Int) (|__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| Int) (v_prenex_19 Int)) (let ((.cse0 (mod (* v_prenex_19 v_prenex_20) 4294967296))) (and (= (select |c_#length| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base|) .cse0) (<= .cse0 2147483647)))) (exists ((|v___U_MULTI_ftest______false_valid_deref_i__calloc_model_#in~nmemb_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v___U_MULTI_ftest______false_valid_deref_i__calloc_model_#in~size_BEFORE_CALL_3| Int)) (let ((.cse1 (mod (* |v___U_MULTI_ftest______false_valid_deref_i__calloc_model_#in~nmemb_BEFORE_CALL_5| |v___U_MULTI_ftest______false_valid_deref_i__calloc_model_#in~size_BEFORE_CALL_3|) 4294967296))) (and (= .cse1 (+ (select |c_#length| v_prenex_18) 4294967296)) (< 2147483647 .cse1))))) is different from true [2018-04-11 21:04:02,680 WARN L148 SmtUtils]: Spent 2011ms on a formula simplification that was a NOOP. DAG size: 30 [2018-04-11 21:04:08,736 WARN L148 SmtUtils]: Spent 4014ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-11 21:04:16,995 WARN L151 SmtUtils]: Spent 6216ms on a formula simplification. DAG size of input: 35 DAG size of output 33 [2018-04-11 21:04:20,205 WARN L151 SmtUtils]: Spent 1056ms on a formula simplification. DAG size of input: 87 DAG size of output 23 [2018-04-11 21:04:20,731 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 187 proven. 89 refuted. 3 times theorem prover too weak. 127 trivial. 2 not checked. [2018-04-11 21:04:20,750 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:04:20,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-11 21:04:20,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 21:04:20,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 21:04:20,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=862, Unknown=31, NotChecked=60, Total=1056 [2018-04-11 21:04:20,751 INFO L87 Difference]: Start difference. First operand 399 states and 512 transitions. Second operand 33 states. [2018-04-11 21:04:24,005 WARN L148 SmtUtils]: Spent 867ms on a formula simplification that was a NOOP. DAG size: 25 [2018-04-11 21:04:31,025 WARN L151 SmtUtils]: Spent 4134ms on a formula simplification. DAG size of input: 56 DAG size of output 56 [2018-04-11 21:04:36,662 WARN L151 SmtUtils]: Spent 4201ms on a formula simplification. DAG size of input: 66 DAG size of output 66 [2018-04-11 21:05:14,783 WARN L151 SmtUtils]: Spent 9155ms on a formula simplification. DAG size of input: 80 DAG size of output 47 [2018-04-11 21:05:36,211 WARN L151 SmtUtils]: Spent 21362ms on a formula simplification. DAG size of input: 87 DAG size of output 54 [2018-04-11 21:07:10,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:07:10,202 INFO L93 Difference]: Finished difference Result 465 states and 562 transitions. [2018-04-11 21:07:10,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 21:07:10,202 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 154 [2018-04-11 21:07:10,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:07:10,203 INFO L225 Difference]: With dead ends: 465 [2018-04-11 21:07:10,203 INFO L226 Difference]: Without dead ends: 456 [2018-04-11 21:07:10,204 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 121.9s TimeCoverageRelationStatistics Valid=218, Invalid=1805, Unknown=51, NotChecked=88, Total=2162 [2018-04-11 21:07:10,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-04-11 21:07:10,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 400. [2018-04-11 21:07:10,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-04-11 21:07:10,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 513 transitions. [2018-04-11 21:07:10,213 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 513 transitions. Word has length 154 [2018-04-11 21:07:10,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:07:10,214 INFO L459 AbstractCegarLoop]: Abstraction has 400 states and 513 transitions. [2018-04-11 21:07:10,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 21:07:10,214 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 513 transitions. [2018-04-11 21:07:10,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-04-11 21:07:10,215 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:07:10,216 INFO L355 BasicCegarLoop]: trace histogram [18, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:10,216 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_ftest______false_valid_deref_i__l0_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr2RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr6RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr7RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr2AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr3AssertViolationMEMORY_FREE]=== [2018-04-11 21:07:10,216 INFO L82 PathProgramCache]: Analyzing trace with hash 704140161, now seen corresponding path program 3 times [2018-04-11 21:07:10,216 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:07:10,216 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:07:10,217 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:07:10,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 21:07:10,217 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:07:10,228 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:07:10,228 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:07:10,229 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:07:10,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 21:07:10,363 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 21:07:10,364 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 21:07:10,369 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:07:10,379 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:07:10,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:07:10,381 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:07:10,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:07:10,400 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:07:10,400 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:07:10,419 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:07:10,419 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:07:10,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:07:10,437 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-04-11 21:07:13,760 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:07:13,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:07:13,783 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:07:13,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:07:13,803 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:07:13,803 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:07:13,818 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:07:13,819 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:07:13,833 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:07:13,834 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-04-11 21:07:17,922 WARN L148 SmtUtils]: Spent 2016ms on a formula simplification that was a NOOP. DAG size: 27 [2018-04-11 21:07:18,708 WARN L148 SmtUtils]: Spent 751ms on a formula simplification that was a NOOP. DAG size: 32 [2018-04-11 21:07:22,762 WARN L148 SmtUtils]: Spent 4024ms on a formula simplification that was a NOOP. DAG size: 32 [2018-04-11 21:07:22,774 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|v___U_MULTI_ftest______false_valid_deref_i__calloc_model_#in~nmemb_BEFORE_CALL_7| Int) (__U_MULTI_ftest______false_valid_deref_i__calloc_model_~size Int) (v___U_MULTI_ftest______false_valid_deref_i__calloc_model_~ptr~0.base_BEFORE_CALL_4 Int)) (let ((.cse4 (mod (* |v___U_MULTI_ftest______false_valid_deref_i__calloc_model_#in~nmemb_BEFORE_CALL_7| __U_MULTI_ftest______false_valid_deref_i__calloc_model_~size) 4294967296))) (and (= (+ (select |c_#length| v___U_MULTI_ftest______false_valid_deref_i__calloc_model_~ptr~0.base_BEFORE_CALL_4) 4294967296) .cse4) (< 2147483647 .cse4))))) (.cse1 (exists ((v_prenex_48 Int) (__U_MULTI_ftest______false_valid_deref_i__calloc_model_~ptr~0.base Int)) (and (= 0 (select |c_old(#valid)| __U_MULTI_ftest______false_valid_deref_i__calloc_model_~ptr~0.base)) (= |c_#length| (store |c_old(#length)| __U_MULTI_ftest______false_valid_deref_i__calloc_model_~ptr~0.base (mod (* v_prenex_48 |c___U_MULTI_ftest______false_valid_deref_i__calloc_model_#in~nmemb|) 4294967296))) (<= (mod (* |c___U_MULTI_ftest______false_valid_deref_i__calloc_model_#in~nmemb| v_prenex_48) 4294967296) 2147483647)))) (.cse3 (exists ((v_prenex_44 Int) (v_prenex_41 Int) (v_prenex_42 Int)) (and (= (select |c_#length| v_prenex_44) (mod (* v_prenex_41 v_prenex_42) 4294967296)) (<= (mod (* v_prenex_42 v_prenex_41) 4294967296) 2147483647)))) (.cse2 (exists ((v_prenex_47 Int) (v_prenex_46 Int)) (and (= 0 (select |c_old(#valid)| v_prenex_46)) (< 2147483647 (mod (* |c___U_MULTI_ftest______false_valid_deref_i__calloc_model_#in~nmemb| v_prenex_47) 4294967296)) (= (store |c_old(#length)| v_prenex_46 (+ (mod (* v_prenex_47 |c___U_MULTI_ftest______false_valid_deref_i__calloc_model_#in~nmemb|) 4294967296) (- 4294967296))) |c_#length|))))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse1 .cse3) (and .cse3 .cse2))) is different from true [2018-04-11 21:07:34,003 WARN L151 SmtUtils]: Spent 4529ms on a formula simplification. DAG size of input: 113 DAG size of output 36 [2018-04-11 21:07:34,009 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_47 Int) (v_prenex_46 Int)) (let ((.cse0 (mod v_prenex_47 4294967296))) (and (= |c_#length| (store |c_old(#length)| v_prenex_46 (+ .cse0 (- 4294967296)))) (< 2147483647 .cse0) (= 0 (select |c_old(#valid)| v_prenex_46))))) (exists ((v_prenex_52 Int) (v_prenex_53 Int)) (let ((.cse1 (mod v_prenex_52 4294967296))) (and (= |c_#length| (store |c_old(#length)| v_prenex_53 .cse1)) (= 0 (select |c_old(#valid)| v_prenex_53)) (<= .cse1 2147483647))))) is different from true [2018-04-11 21:07:34,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:07:34,047 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:07:34,048 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 34 treesize of output 47 [2018-04-11 21:07:34,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:07:34,063 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:07:34,064 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:07:34,064 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 33 treesize of output 27 [2018-04-11 21:07:34,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:07:34,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:07:34,079 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 32 treesize of output 35 [2018-04-11 21:07:34,080 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:07:34,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:07:34,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:07:34,095 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 31 treesize of output 25 [2018-04-11 21:07:34,095 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:07:34,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 21:07:34,110 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:49 [2018-04-11 21:07:36,188 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 260 proven. 32 refuted. 2 times theorem prover too weak. 232 trivial. 5 not checked. [2018-04-11 21:07:36,207 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:07:36,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 21:07:36,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 21:07:36,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 21:07:36,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=560, Unknown=11, NotChecked=98, Total=756 [2018-04-11 21:07:36,208 INFO L87 Difference]: Start difference. First operand 400 states and 513 transitions. Second operand 28 states. [2018-04-11 21:07:41,029 WARN L151 SmtUtils]: Spent 224ms on a formula simplification. DAG size of input: 81 DAG size of output 53 [2018-04-11 21:07:43,972 WARN L151 SmtUtils]: Spent 764ms on a formula simplification. DAG size of input: 80 DAG size of output 78 [2018-04-11 21:07:46,348 WARN L151 SmtUtils]: Spent 2138ms on a formula simplification. DAG size of input: 74 DAG size of output 40 [2018-04-11 21:08:01,418 WARN L151 SmtUtils]: Spent 12494ms on a formula simplification. DAG size of input: 116 DAG size of output 65 [2018-04-11 21:08:16,603 WARN L151 SmtUtils]: Spent 15044ms on a formula simplification. DAG size of input: 84 DAG size of output 72 [2018-04-11 21:08:18,746 WARN L151 SmtUtils]: Spent 2037ms on a formula simplification. DAG size of input: 71 DAG size of output 45 [2018-04-11 21:08:34,574 WARN L148 SmtUtils]: Spent 2974ms on a formula simplification that was a NOOP. DAG size: 61 [2018-04-11 21:08:42,702 WARN L148 SmtUtils]: Spent 2649ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-11 21:11:02,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:11:02,447 INFO L93 Difference]: Finished difference Result 863 states and 1068 transitions. [2018-04-11 21:11:02,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 21:11:02,451 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 160 [2018-04-11 21:11:02,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:11:02,456 INFO L225 Difference]: With dead ends: 863 [2018-04-11 21:11:02,457 INFO L226 Difference]: Without dead ends: 863 [2018-04-11 21:11:02,457 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 72.9s TimeCoverageRelationStatistics Valid=227, Invalid=1653, Unknown=20, NotChecked=170, Total=2070 [2018-04-11 21:11:02,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2018-04-11 21:11:02,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 647. [2018-04-11 21:11:02,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-04-11 21:11:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 929 transitions. [2018-04-11 21:11:02,477 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 929 transitions. Word has length 160 [2018-04-11 21:11:02,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:11:02,477 INFO L459 AbstractCegarLoop]: Abstraction has 647 states and 929 transitions. [2018-04-11 21:11:02,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 21:11:02,478 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 929 transitions. [2018-04-11 21:11:02,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-04-11 21:11:02,480 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:11:02,480 INFO L355 BasicCegarLoop]: trace histogram [18, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:02,480 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_ftest______false_valid_deref_i__l0_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr2RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr6RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr7RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr2AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr3AssertViolationMEMORY_FREE]=== [2018-04-11 21:11:02,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1926127359, now seen corresponding path program 1 times [2018-04-11 21:11:02,480 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:11:02,480 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:11:02,481 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:11:02,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 21:11:02,481 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:11:02,493 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:11:02,493 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:11:02,493 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:11:02,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:11:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:11:02,604 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:11:02,613 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:11:02,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:11:02,635 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:11:02,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:11:02,649 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:11:02,649 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:11:02,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-04-11 21:11:02,650 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:11:02,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:11:02,664 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-04-11 21:11:03,342 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((__U_MULTI_ftest______false_valid_deref_i__calloc_model_~size Int) (__U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb Int) (|__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse0 (mod (* __U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb __U_MULTI_ftest______false_valid_deref_i__calloc_model_~size) 4294967296))) (and (= 0 (select |c_old(#valid)| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base|)) (< 2147483647 .cse0) (= (store |c_old(#length)| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| (+ .cse0 (- 4294967296))) |c_#length|)))) (exists ((v_prenex_74 Int) (v_prenex_73 Int) (v_prenex_75 Int)) (let ((.cse1 (mod (* v_prenex_74 v_prenex_73) 4294967296))) (and (<= .cse1 2147483647) (= 0 (select |c_old(#valid)| v_prenex_75)) (= |c_#length| (store |c_old(#length)| v_prenex_75 .cse1)))))) is different from true [2018-04-11 21:11:03,345 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:11:03,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:11:03,362 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:11:03,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:11:03,378 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:11:03,379 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:11:03,392 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:11:03,393 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:11:03,407 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:11:03,407 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-04-11 21:11:03,452 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_74 Int) (v_prenex_73 Int) (v_prenex_75 Int)) (let ((.cse0 (mod (* v_prenex_74 v_prenex_73) 4294967296))) (and (<= .cse0 2147483647) (= .cse0 (select |c_#length| v_prenex_75))))) (exists ((__U_MULTI_ftest______false_valid_deref_i__calloc_model_~size Int) (__U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb Int) (|__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse1 (mod (* __U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb __U_MULTI_ftest______false_valid_deref_i__calloc_model_~size) 4294967296))) (and (< 2147483647 .cse1) (= (+ (select |c_#length| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base|) 4294967296) .cse1))))) is different from true [2018-04-11 21:11:03,463 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((v_prenex_79 Int) (v_prenex_81 Int) (v_prenex_82 Int)) (let ((.cse6 (mod (* v_prenex_79 v_prenex_81) 4294967296))) (and (<= .cse6 2147483647) (= 0 (select |c_old(#valid)| v_prenex_82)) (= (store |c_old(#length)| v_prenex_82 .cse6) |c_#length|))))) (.cse2 (exists ((v_prenex_74 Int) (v_prenex_73 Int) (v_prenex_75 Int)) (let ((.cse5 (mod (* v_prenex_74 v_prenex_73) 4294967296))) (and (<= .cse5 2147483647) (= .cse5 (select |c_#length| v_prenex_75)))))) (.cse3 (exists ((v_prenex_78 Int) (v_prenex_80 Int) (v_prenex_83 Int)) (and (= (store |c_old(#length)| v_prenex_83 (+ (mod (* v_prenex_78 v_prenex_80) 4294967296) (- 4294967296))) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_83)) (< 2147483647 (mod (* v_prenex_80 v_prenex_78) 4294967296))))) (.cse0 (exists ((__U_MULTI_ftest______false_valid_deref_i__calloc_model_~size Int) (__U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb Int) (|__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse4 (mod (* __U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb __U_MULTI_ftest______false_valid_deref_i__calloc_model_~size) 4294967296))) (and (< 2147483647 .cse4) (= (+ (select |c_#length| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base|) 4294967296) .cse4)))))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse3 .cse2) (and .cse3 .cse0))) is different from true [2018-04-11 21:11:03,486 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_74 Int) (v_prenex_73 Int) (v_prenex_75 Int)) (let ((.cse0 (mod (* v_prenex_74 v_prenex_73) 4294967296))) (and (<= .cse0 2147483647) (= .cse0 (select |c_#length| v_prenex_75))))) (exists ((v_prenex_85 Int) (v_prenex_84 Int) (v_prenex_86 Int)) (and (<= (mod (* v_prenex_84 v_prenex_85) 4294967296) 2147483647) (= 0 (select |c_old(#valid)| v_prenex_86)) (= |c_#length| (store |c_old(#length)| v_prenex_86 (mod (* v_prenex_85 v_prenex_84) 4294967296)))))) (and (exists ((v_prenex_78 Int) (v_prenex_80 Int) (v_prenex_83 Int)) (and (= (store |c_old(#length)| v_prenex_83 (+ (mod (* v_prenex_78 v_prenex_80) 4294967296) (- 4294967296))) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_83)) (< 2147483647 (mod (* v_prenex_80 v_prenex_78) 4294967296)))) (exists ((v_prenex_89 Int) (v_prenex_88 Int) (v_prenex_87 Int)) (let ((.cse1 (mod (* v_prenex_87 v_prenex_88) 4294967296))) (and (= .cse1 (select |c_#length| v_prenex_89)) (<= .cse1 2147483647))))) (and (exists ((__U_MULTI_ftest______false_valid_deref_i__calloc_model_~size Int) (__U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb Int) (|__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse2 (mod (* __U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb __U_MULTI_ftest______false_valid_deref_i__calloc_model_~size) 4294967296))) (and (< 2147483647 .cse2) (= (+ (select |c_#length| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base|) 4294967296) .cse2)))) (exists ((v_prenex_79 Int) (v_prenex_81 Int) (v_prenex_82 Int)) (let ((.cse3 (mod (* v_prenex_79 v_prenex_81) 4294967296))) (and (<= .cse3 2147483647) (= 0 (select |c_old(#valid)| v_prenex_82)) (= (store |c_old(#length)| v_prenex_82 .cse3) |c_#length|))))) (and (exists ((v_prenex_90 Int) (v_prenex_95 Int) (v_prenex_92 Int)) (let ((.cse4 (mod (* v_prenex_95 v_prenex_90) 4294967296))) (and (= (+ (select |c_#length| v_prenex_92) 4294967296) .cse4) (< 2147483647 .cse4)))) (exists ((v_prenex_91 Int) (v_prenex_94 Int) (v_prenex_93 Int)) (let ((.cse5 (mod (* v_prenex_93 v_prenex_91) 4294967296))) (and (< 2147483647 .cse5) (= |c_#length| (store |c_old(#length)| v_prenex_94 (+ .cse5 (- 4294967296)))) (= 0 (select |c_old(#valid)| v_prenex_94))))))) is different from true [2018-04-11 21:11:03,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:11:03,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:11:03,519 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 71 treesize of output 65 [2018-04-11 21:11:03,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:11:22,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:11:22,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:11:22,296 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 62 treesize of output 75 [2018-04-11 21:11:22,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:11:38,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:11:38,142 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 60 treesize of output 63 [2018-04-11 21:11:38,142 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:11:51,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:11:51,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:11:51,774 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 62 treesize of output 77 [2018-04-11 21:11:51,774 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:12:05,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:12:05,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:12:05,753 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 61 treesize of output 55 [2018-04-11 21:12:05,754 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:12:16,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:12:16,660 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 66 treesize of output 69 [2018-04-11 21:12:16,660 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:12:28,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:12:28,873 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 62 treesize of output 65 [2018-04-11 21:12:28,873 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 21:12:40,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:12:40,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:12:40,488 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 61 treesize of output 55 [2018-04-11 21:12:40,489 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:12:49,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:12:49,580 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 58 treesize of output 69 [2018-04-11 21:12:49,580 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:00,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:00,172 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:00,172 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 59 treesize of output 53 [2018-04-11 21:13:00,173 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:10,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:10,028 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 64 treesize of output 67 [2018-04-11 21:13:10,028 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:17,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:17,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:17,765 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 65 treesize of output 59 [2018-04-11 21:13:17,765 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:26,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:26,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:26,674 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 61 treesize of output 55 [2018-04-11 21:13:26,674 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:34,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:34,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:34,747 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 64 treesize of output 58 [2018-04-11 21:13:34,747 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:42,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:42,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:42,752 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 63 treesize of output 57 [2018-04-11 21:13:42,752 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 21:13:51,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:13:51,797 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 58 treesize of output 67 [2018-04-11 21:13:51,810 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 21:14:00,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 64 dim-0 vars, 16 dim-1 vars, End of recursive call: 64 dim-0 vars, and 8 xjuncts. [2018-04-11 21:14:00,455 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 80 variables, input treesize:561, output treesize:433 [2018-04-11 21:14:02,477 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_106 Int) (v_prenex_107 Int)) (let ((.cse0 (mod (* v_prenex_106 v_prenex_107) 4294967296))) (and (< 2147483647 .cse0) (= .cse0 (+ (select |c_#length| c___U_MULTI_ftest______false_valid_deref_i__l4_insert_~item~0.base) 4294967296))))) (exists ((v_prenex_74 Int) (v_prenex_73 Int) (v_prenex_75 Int)) (let ((.cse1 (mod (* v_prenex_74 v_prenex_73) 4294967296))) (and (<= .cse1 2147483647) (= .cse1 (select |c_#length| v_prenex_75))))) (exists ((v_prenex_85 Int) (v_prenex_84 Int) (v_prenex_86 Int)) (and (= (select |c_#length| v_prenex_86) (mod (* v_prenex_85 v_prenex_84) 4294967296)) (<= (mod (* v_prenex_84 v_prenex_85) 4294967296) 2147483647)))) (and (exists ((v_prenex_116 Int) (v_prenex_117 Int) (v_prenex_115 Int)) (and (<= (mod (* v_prenex_116 v_prenex_115) 4294967296) 2147483647) (= (mod (* v_prenex_115 v_prenex_116) 4294967296) (select |c_#length| v_prenex_117)) (not (= v_prenex_117 c___U_MULTI_ftest______false_valid_deref_i__l4_insert_~item~0.base)))) (exists ((v_prenex_114 Int) (v_prenex_119 Int)) (let ((.cse2 (mod (* v_prenex_119 v_prenex_114) 4294967296))) (and (<= .cse2 3) (= .cse2 (select |c_#length| c___U_MULTI_ftest______false_valid_deref_i__l4_insert_~item~0.base))))) (exists ((v_prenex_121 Int) (v_prenex_122 Int) (v_prenex_120 Int)) (let ((.cse3 (mod (* v_prenex_120 v_prenex_121) 4294967296))) (and (<= .cse3 2147483647) (= .cse3 (select |c_#length| v_prenex_122)))))) (and (exists ((v_prenex_79 Int) (v_prenex_81 Int) (v_prenex_82 Int)) (let ((.cse4 (mod (* v_prenex_79 v_prenex_81) 4294967296))) (and (<= .cse4 2147483647) (not (= v_prenex_82 c___U_MULTI_ftest______false_valid_deref_i__l4_insert_~item~0.base)) (= (select |c_#length| v_prenex_82) .cse4)))) (exists ((v_prenex_96 Int) (v_prenex_97 Int) (|__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse5 (mod (* v_prenex_97 v_prenex_96) 4294967296))) (and (= (+ (select |c_#length| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base|) 4294967296) .cse5) (< 2147483647 .cse5)))) (exists ((v_prenex_112 Int) (v_prenex_110 Int)) (let ((.cse6 (mod (* v_prenex_112 v_prenex_110) 4294967296))) (and (<= .cse6 3) (= .cse6 (select |c_#length| c___U_MULTI_ftest______false_valid_deref_i__l4_insert_~item~0.base)))))) (and (exists ((v_prenex_145 Int) (v_prenex_143 Int) (v_prenex_142 Int)) (let ((.cse7 (mod (* v_prenex_145 v_prenex_142) 4294967296))) (and (<= .cse7 2147483647) (= .cse7 (select |c_#length| v_prenex_143))))) (exists ((v_prenex_139 Int) (v_prenex_140 Int)) (let ((.cse8 (mod (* v_prenex_139 v_prenex_140) 4294967296))) (and (= (+ (select |c_#length| c___U_MULTI_ftest______false_valid_deref_i__l4_insert_~item~0.base) 4294967296) .cse8) (< 2147483647 .cse8)))) (exists ((v_prenex_138 Int) (v_prenex_146 Int) (v_prenex_144 Int)) (let ((.cse9 (mod (* v_prenex_144 v_prenex_138) 4294967296))) (and (= (+ (select |c_#length| v_prenex_146) 4294967296) .cse9) (< 2147483647 .cse9))))) (and (exists ((v_prenex_102 Int) (v_prenex_100 Int) (v_prenex_98 Int)) (let ((.cse10 (mod (* v_prenex_100 v_prenex_98) 4294967296))) (and (= (+ (select |c_#length| v_prenex_102) 4294967296) .cse10) (< 2147483647 .cse10)))) (exists ((__U_MULTI_ftest______false_valid_deref_i__calloc_model_~size Int) (__U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb Int)) (let ((.cse11 (mod (* __U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb __U_MULTI_ftest______false_valid_deref_i__calloc_model_~size) 4294967296))) (and (<= .cse11 3) (= .cse11 (select |c_#length| c___U_MULTI_ftest______false_valid_deref_i__l4_insert_~item~0.base))))) (exists ((v_prenex_105 Int) (v_prenex_103 Int) (v_prenex_104 Int)) (let ((.cse12 (mod (* v_prenex_105 v_prenex_103) 4294967296))) (and (= .cse12 (+ (select |c_#length| v_prenex_104) 4294967296)) (< 2147483647 .cse12))))) (and (exists ((v_prenex_67 Int) (v_prenex_65 Int)) (let ((.cse13 (mod (* v_prenex_67 v_prenex_65) 4294967296))) (and (= .cse13 (+ (select |c_#length| c___U_MULTI_ftest______false_valid_deref_i__l4_insert_~item~0.base) 4294967296)) (< 2147483647 .cse13)))) (exists ((v_prenex_91 Int) (v_prenex_94 Int) (v_prenex_93 Int)) (let ((.cse14 (mod (* v_prenex_93 v_prenex_91) 4294967296))) (and (< 2147483647 .cse14) (not (= v_prenex_94 c___U_MULTI_ftest______false_valid_deref_i__l4_insert_~item~0.base)) (= .cse14 (+ (select |c_#length| v_prenex_94) 4294967296))))) (exists ((v_prenex_90 Int) (v_prenex_95 Int) (v_prenex_92 Int)) (let ((.cse15 (mod (* v_prenex_95 v_prenex_90) 4294967296))) (and (= (+ (select |c_#length| v_prenex_92) 4294967296) .cse15) (< 2147483647 .cse15))))) (and (exists ((v_prenex_89 Int) (v_prenex_88 Int) (v_prenex_87 Int)) (let ((.cse16 (mod (* v_prenex_87 v_prenex_88) 4294967296))) (and (= .cse16 (select |c_#length| v_prenex_89)) (<= .cse16 2147483647)))) (exists ((v_prenex_78 Int) (v_prenex_80 Int) (v_prenex_83 Int)) (and (= (mod (* v_prenex_78 v_prenex_80) 4294967296) (+ (select |c_#length| v_prenex_83) 4294967296)) (not (= v_prenex_83 c___U_MULTI_ftest______false_valid_deref_i__l4_insert_~item~0.base)) (< 2147483647 (mod (* v_prenex_80 v_prenex_78) 4294967296)))) (exists ((v_prenex_125 Int) (v_prenex_124 Int)) (let ((.cse17 (mod (* v_prenex_124 v_prenex_125) 4294967296))) (and (= .cse17 (+ (select |c_#length| c___U_MULTI_ftest______false_valid_deref_i__l4_insert_~item~0.base) 4294967296)) (< 2147483647 .cse17))))) (and (exists ((v_prenex_128 Int) (v_prenex_135 Int)) (let ((.cse18 (mod (* v_prenex_135 v_prenex_128) 4294967296))) (and (= (select |c_#length| c___U_MULTI_ftest______false_valid_deref_i__l4_insert_~item~0.base) .cse18) (<= .cse18 3)))) (exists ((v_prenex_136 Int) (v_prenex_134 Int) (v_prenex_133 Int)) (and (= (mod (* v_prenex_136 v_prenex_133) 4294967296) (+ (select |c_#length| v_prenex_134) 4294967296)) (< 2147483647 (mod (* v_prenex_133 v_prenex_136) 4294967296)))) (exists ((v_prenex_132 Int) (v_prenex_130 Int) (v_prenex_131 Int)) (let ((.cse19 (mod (* v_prenex_132 v_prenex_131) 4294967296))) (and (= .cse19 (select |c_#length| v_prenex_130)) (<= .cse19 2147483647)))))) is different from true [2018-04-11 21:14:02,553 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 252 proven. 6 refuted. 0 times theorem prover too weak. 244 trivial. 29 not checked. [2018-04-11 21:14:02,570 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:14:02,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 21:14:02,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 21:14:02,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 21:14:02,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=258, Unknown=5, NotChecked=180, Total=506 [2018-04-11 21:14:02,571 INFO L87 Difference]: Start difference. First operand 647 states and 929 transitions. Second operand 23 states. [2018-04-11 21:14:02,753 WARN L1033 $PredicateComparison]: unable to prove that (and (let ((.cse1 (= 1 (select |c_#valid| |c___U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base|))) (.cse2 (select |c_#length| |c___U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base|)) (.cse0 (mod (* c___U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb c___U_MULTI_ftest______false_valid_deref_i__calloc_model_~size) 4294967296))) (or (and (< 2147483647 .cse0) .cse1 (= (+ .cse2 4294967296) .cse0)) (and (<= .cse0 2147483647) .cse1 (= .cse2 .cse0)))) (or (exists ((__U_MULTI_ftest______false_valid_deref_i__calloc_model_~size Int) (__U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb Int) (|__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse3 (mod (* __U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb __U_MULTI_ftest______false_valid_deref_i__calloc_model_~size) 4294967296))) (and (= 0 (select |c_old(#valid)| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base|)) (< 2147483647 .cse3) (= (store |c_old(#length)| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| (+ .cse3 (- 4294967296))) |c_#length|)))) (exists ((v_prenex_74 Int) (v_prenex_73 Int) (v_prenex_75 Int)) (let ((.cse4 (mod (* v_prenex_74 v_prenex_73) 4294967296))) (and (<= .cse4 2147483647) (= 0 (select |c_old(#valid)| v_prenex_75)) (= |c_#length| (store |c_old(#length)| v_prenex_75 .cse4))))))) is different from true [2018-04-11 21:14:02,759 WARN L1033 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (* c___U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb c___U_MULTI_ftest______false_valid_deref_i__calloc_model_~size) 4294967296)) (.cse1 (select |c_#length| c___U_MULTI_ftest______false_valid_deref_i__calloc_model_~ptr~0.base)) (.cse2 (= (select |c_#valid| c___U_MULTI_ftest______false_valid_deref_i__calloc_model_~ptr~0.base) 1))) (or (and (<= .cse0 2147483647) (= .cse0 .cse1) .cse2) (and (< 2147483647 .cse0) (= .cse0 (+ .cse1 4294967296)) .cse2))) (or (exists ((__U_MULTI_ftest______false_valid_deref_i__calloc_model_~size Int) (__U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb Int) (|__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse3 (mod (* __U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb __U_MULTI_ftest______false_valid_deref_i__calloc_model_~size) 4294967296))) (and (= 0 (select |c_old(#valid)| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base|)) (< 2147483647 .cse3) (= (store |c_old(#length)| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| (+ .cse3 (- 4294967296))) |c_#length|)))) (exists ((v_prenex_74 Int) (v_prenex_73 Int) (v_prenex_75 Int)) (let ((.cse4 (mod (* v_prenex_74 v_prenex_73) 4294967296))) (and (<= .cse4 2147483647) (= 0 (select |c_old(#valid)| v_prenex_75)) (= |c_#length| (store |c_old(#length)| v_prenex_75 .cse4))))))) is different from true [2018-04-11 21:14:02,804 WARN L1033 $PredicateComparison]: unable to prove that (and (or (exists ((v___U_MULTI_ftest______false_valid_deref_i__calloc_model_~size_BEFORE_CALL_6 Int) (v___U_MULTI_ftest______false_valid_deref_i__calloc_model_~ptr~0.base_BEFORE_CALL_5 Int) (v___U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb_BEFORE_CALL_7 Int)) (let ((.cse0 (mod (* v___U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb_BEFORE_CALL_7 v___U_MULTI_ftest______false_valid_deref_i__calloc_model_~size_BEFORE_CALL_6) 4294967296))) (and (= 1 (select |c_#valid| v___U_MULTI_ftest______false_valid_deref_i__calloc_model_~ptr~0.base_BEFORE_CALL_5)) (<= .cse0 2147483647) (= .cse0 (select |c_#length| v___U_MULTI_ftest______false_valid_deref_i__calloc_model_~ptr~0.base_BEFORE_CALL_5))))) (exists ((v_prenex_63 Int) (v_prenex_62 Int) (v_prenex_64 Int)) (let ((.cse1 (mod (* v_prenex_64 v_prenex_62) 4294967296))) (and (= 1 (select |c_#valid| v_prenex_63)) (= .cse1 (+ (select |c_#length| v_prenex_63) 4294967296)) (< 2147483647 .cse1))))) (or (exists ((v_prenex_74 Int) (v_prenex_73 Int) (v_prenex_75 Int)) (let ((.cse2 (mod (* v_prenex_74 v_prenex_73) 4294967296))) (and (<= .cse2 2147483647) (= .cse2 (select |c_#length| v_prenex_75))))) (exists ((__U_MULTI_ftest______false_valid_deref_i__calloc_model_~size Int) (__U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb Int) (|__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse3 (mod (* __U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb __U_MULTI_ftest______false_valid_deref_i__calloc_model_~size) 4294967296))) (and (< 2147483647 .cse3) (= (+ (select |c_#length| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base|) 4294967296) .cse3)))))) is different from true [2018-04-11 21:14:03,655 WARN L151 SmtUtils]: Spent 796ms on a formula simplification. DAG size of input: 62 DAG size of output 40 [2018-04-11 21:14:07,702 WARN L151 SmtUtils]: Spent 4002ms on a formula simplification. DAG size of input: 63 DAG size of output 41 [2018-04-11 21:14:11,949 WARN L151 SmtUtils]: Spent 4074ms on a formula simplification. DAG size of input: 68 DAG size of output 43 [2018-04-11 21:14:26,524 WARN L151 SmtUtils]: Spent 14403ms on a formula simplification. DAG size of input: 87 DAG size of output 66 [2018-04-11 21:14:57,327 WARN L151 SmtUtils]: Spent 30234ms on a formula simplification. DAG size of input: 149 DAG size of output 80 [2018-04-11 21:15:25,611 WARN L151 SmtUtils]: Spent 27866ms on a formula simplification. DAG size of input: 135 DAG size of output 66 [2018-04-11 21:15:38,510 WARN L151 SmtUtils]: Spent 12583ms on a formula simplification. DAG size of input: 135 DAG size of output 66 [2018-04-11 21:16:27,267 WARN L151 SmtUtils]: Spent 48182ms on a formula simplification. DAG size of input: 149 DAG size of output 80 [2018-04-11 21:16:31,726 WARN L1033 $PredicateComparison]: unable to prove that (and (or (exists ((v___U_MULTI_ftest______false_valid_deref_i__calloc_model_~size_BEFORE_CALL_6 Int) (v___U_MULTI_ftest______false_valid_deref_i__calloc_model_~ptr~0.base_BEFORE_CALL_5 Int) (v___U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb_BEFORE_CALL_7 Int)) (let ((.cse0 (mod (* v___U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb_BEFORE_CALL_7 v___U_MULTI_ftest______false_valid_deref_i__calloc_model_~size_BEFORE_CALL_6) 4294967296))) (and (= 1 (select |c_#valid| v___U_MULTI_ftest______false_valid_deref_i__calloc_model_~ptr~0.base_BEFORE_CALL_5)) (<= .cse0 2147483647) (= .cse0 (select |c_#length| v___U_MULTI_ftest______false_valid_deref_i__calloc_model_~ptr~0.base_BEFORE_CALL_5))))) (exists ((v_prenex_63 Int) (v_prenex_62 Int) (v_prenex_64 Int)) (let ((.cse1 (mod (* v_prenex_64 v_prenex_62) 4294967296))) (and (= 1 (select |c_#valid| v_prenex_63)) (= .cse1 (+ (select |c_#length| v_prenex_63) 4294967296)) (< 2147483647 .cse1))))) (or (and (exists ((v_prenex_106 Int) (v_prenex_107 Int)) (let ((.cse2 (mod (* v_prenex_106 v_prenex_107) 4294967296))) (and (< 2147483647 .cse2) (= .cse2 (+ (select |c_#length| c___U_MULTI_ftest______false_valid_deref_i__l4_insert_~item~0.base) 4294967296))))) (exists ((v_prenex_74 Int) (v_prenex_73 Int) (v_prenex_75 Int)) (let ((.cse3 (mod (* v_prenex_74 v_prenex_73) 4294967296))) (and (<= .cse3 2147483647) (= .cse3 (select |c_#length| v_prenex_75))))) (exists ((v_prenex_85 Int) (v_prenex_84 Int) (v_prenex_86 Int)) (and (= (select |c_#length| v_prenex_86) (mod (* v_prenex_85 v_prenex_84) 4294967296)) (<= (mod (* v_prenex_84 v_prenex_85) 4294967296) 2147483647)))) (and (exists ((v_prenex_116 Int) (v_prenex_117 Int) (v_prenex_115 Int)) (and (<= (mod (* v_prenex_116 v_prenex_115) 4294967296) 2147483647) (= (mod (* v_prenex_115 v_prenex_116) 4294967296) (select |c_#length| v_prenex_117)) (not (= v_prenex_117 c___U_MULTI_ftest______false_valid_deref_i__l4_insert_~item~0.base)))) (exists ((v_prenex_114 Int) (v_prenex_119 Int)) (let ((.cse4 (mod (* v_prenex_119 v_prenex_114) 4294967296))) (and (<= .cse4 3) (= .cse4 (select |c_#length| c___U_MULTI_ftest______false_valid_deref_i__l4_insert_~item~0.base))))) (exists ((v_prenex_121 Int) (v_prenex_122 Int) (v_prenex_120 Int)) (let ((.cse5 (mod (* v_prenex_120 v_prenex_121) 4294967296))) (and (<= .cse5 2147483647) (= .cse5 (select |c_#length| v_prenex_122)))))) (and (exists ((v_prenex_79 Int) (v_prenex_81 Int) (v_prenex_82 Int)) (let ((.cse6 (mod (* v_prenex_79 v_prenex_81) 4294967296))) (and (<= .cse6 2147483647) (not (= v_prenex_82 c___U_MULTI_ftest______false_valid_deref_i__l4_insert_~item~0.base)) (= (select |c_#length| v_prenex_82) .cse6)))) (exists ((v_prenex_96 Int) (v_prenex_97 Int) (|__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse7 (mod (* v_prenex_97 v_prenex_96) 4294967296))) (and (= (+ (select |c_#length| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base|) 4294967296) .cse7) (< 2147483647 .cse7)))) (exists ((v_prenex_112 Int) (v_prenex_110 Int)) (let ((.cse8 (mod (* v_prenex_112 v_prenex_110) 4294967296))) (and (<= .cse8 3) (= .cse8 (select |c_#length| c___U_MULTI_ftest______false_valid_deref_i__l4_insert_~item~0.base)))))) (and (exists ((v_prenex_145 Int) (v_prenex_143 Int) (v_prenex_142 Int)) (let ((.cse9 (mod (* v_prenex_145 v_prenex_142) 4294967296))) (and (<= .cse9 2147483647) (= .cse9 (select |c_#length| v_prenex_143))))) (exists ((v_prenex_139 Int) (v_prenex_140 Int)) (let ((.cse10 (mod (* v_prenex_139 v_prenex_140) 4294967296))) (and (= (+ (select |c_#length| c___U_MULTI_ftest______false_valid_deref_i__l4_insert_~item~0.base) 4294967296) .cse10) (< 2147483647 .cse10)))) (exists ((v_prenex_138 Int) (v_prenex_146 Int) (v_prenex_144 Int)) (let ((.cse11 (mod (* v_prenex_144 v_prenex_138) 4294967296))) (and (= (+ (select |c_#length| v_prenex_146) 4294967296) .cse11) (< 2147483647 .cse11))))) (and (exists ((v_prenex_102 Int) (v_prenex_100 Int) (v_prenex_98 Int)) (let ((.cse12 (mod (* v_prenex_100 v_prenex_98) 4294967296))) (and (= (+ (select |c_#length| v_prenex_102) 4294967296) .cse12) (< 2147483647 .cse12)))) (exists ((__U_MULTI_ftest______false_valid_deref_i__calloc_model_~size Int) (__U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb Int)) (let ((.cse13 (mod (* __U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb __U_MULTI_ftest______false_valid_deref_i__calloc_model_~size) 4294967296))) (and (<= .cse13 3) (= .cse13 (select |c_#length| c___U_MULTI_ftest______false_valid_deref_i__l4_insert_~item~0.base))))) (exists ((v_prenex_105 Int) (v_prenex_103 Int) (v_prenex_104 Int)) (let ((.cse14 (mod (* v_prenex_105 v_prenex_103) 4294967296))) (and (= .cse14 (+ (select |c_#length| v_prenex_104) 4294967296)) (< 2147483647 .cse14))))) (and (exists ((v_prenex_67 Int) (v_prenex_65 Int)) (let ((.cse15 (mod (* v_prenex_67 v_prenex_65) 4294967296))) (and (= .cse15 (+ (select |c_#length| c___U_MULTI_ftest______false_valid_deref_i__l4_insert_~item~0.base) 4294967296)) (< 2147483647 .cse15)))) (exists ((v_prenex_91 Int) (v_prenex_94 Int) (v_prenex_93 Int)) (let ((.cse16 (mod (* v_prenex_93 v_prenex_91) 4294967296))) (and (< 2147483647 .cse16) (not (= v_prenex_94 c___U_MULTI_ftest______false_valid_deref_i__l4_insert_~item~0.base)) (= .cse16 (+ (select |c_#length| v_prenex_94) 4294967296))))) (exists ((v_prenex_90 Int) (v_prenex_95 Int) (v_prenex_92 Int)) (let ((.cse17 (mod (* v_prenex_95 v_prenex_90) 4294967296))) (and (= (+ (select |c_#length| v_prenex_92) 4294967296) .cse17) (< 2147483647 .cse17))))) (and (exists ((v_prenex_89 Int) (v_prenex_88 Int) (v_prenex_87 Int)) (let ((.cse18 (mod (* v_prenex_87 v_prenex_88) 4294967296))) (and (= .cse18 (select |c_#length| v_prenex_89)) (<= .cse18 2147483647)))) (exists ((v_prenex_78 Int) (v_prenex_80 Int) (v_prenex_83 Int)) (and (= (mod (* v_prenex_78 v_prenex_80) 4294967296) (+ (select |c_#length| v_prenex_83) 4294967296)) (not (= v_prenex_83 c___U_MULTI_ftest______false_valid_deref_i__l4_insert_~item~0.base)) (< 2147483647 (mod (* v_prenex_80 v_prenex_78) 4294967296)))) (exists ((v_prenex_125 Int) (v_prenex_124 Int)) (let ((.cse19 (mod (* v_prenex_124 v_prenex_125) 4294967296))) (and (= .cse19 (+ (select |c_#length| c___U_MULTI_ftest______false_valid_deref_i__l4_insert_~item~0.base) 4294967296)) (< 2147483647 .cse19))))) (and (exists ((v_prenex_128 Int) (v_prenex_135 Int)) (let ((.cse20 (mod (* v_prenex_135 v_prenex_128) 4294967296))) (and (= (select |c_#length| c___U_MULTI_ftest______false_valid_deref_i__l4_insert_~item~0.base) .cse20) (<= .cse20 3)))) (exists ((v_prenex_136 Int) (v_prenex_134 Int) (v_prenex_133 Int)) (and (= (mod (* v_prenex_136 v_prenex_133) 4294967296) (+ (select |c_#length| v_prenex_134) 4294967296)) (< 2147483647 (mod (* v_prenex_133 v_prenex_136) 4294967296)))) (exists ((v_prenex_132 Int) (v_prenex_130 Int) (v_prenex_131 Int)) (let ((.cse21 (mod (* v_prenex_132 v_prenex_131) 4294967296))) (and (= .cse21 (select |c_#length| v_prenex_130)) (<= .cse21 2147483647))))))) is different from true [2018-04-11 21:16:35,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:16:35,294 INFO L93 Difference]: Finished difference Result 1050 states and 1438 transitions. [2018-04-11 21:16:35,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 21:16:35,294 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 162 [2018-04-11 21:16:35,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:16:35,297 INFO L225 Difference]: With dead ends: 1050 [2018-04-11 21:16:35,297 INFO L226 Difference]: Without dead ends: 1046 [2018-04-11 21:16:35,297 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 148.9s TimeCoverageRelationStatistics Valid=131, Invalid=651, Unknown=10, NotChecked=540, Total=1332 [2018-04-11 21:16:35,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2018-04-11 21:16:35,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 843. [2018-04-11 21:16:35,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2018-04-11 21:16:35,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1258 transitions. [2018-04-11 21:16:35,315 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1258 transitions. Word has length 162 [2018-04-11 21:16:35,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:16:35,315 INFO L459 AbstractCegarLoop]: Abstraction has 843 states and 1258 transitions. [2018-04-11 21:16:35,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 21:16:35,316 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1258 transitions. [2018-04-11 21:16:35,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-04-11 21:16:35,317 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:16:35,317 INFO L355 BasicCegarLoop]: trace histogram [23, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:35,317 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_ftest______false_valid_deref_i__l0_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr2RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr6RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr7RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr2AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr3AssertViolationMEMORY_FREE]=== [2018-04-11 21:16:35,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1666776126, now seen corresponding path program 2 times [2018-04-11 21:16:35,318 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:16:35,318 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:16:35,318 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:16:35,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:16:35,318 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:16:35,326 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:16:35,326 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:16:35,326 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:16:35,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 21:16:35,399 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 21:16:35,399 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 21:16:35,404 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:16:35,407 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:16:35,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:16:35,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:16:35,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 21:16:35,468 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| 1)) (= 0 (select |c_old(#valid)| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base|)))) is different from true [2018-04-11 21:16:35,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:16:35,471 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:16:35,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:16:35,474 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:16:35,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-04-11 21:16:35,481 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v___U_MULTI_ftest______false_valid_deref_i__calloc_model_~ptr~0.base_BEFORE_CALL_6 Int)) (= 1 (select |c_#valid| v___U_MULTI_ftest______false_valid_deref_i__calloc_model_~ptr~0.base_BEFORE_CALL_6))) (exists ((|__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| 1)) (= 0 (select |c_old(#valid)| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base|))))) is different from true [2018-04-11 21:16:35,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:16:35,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:16:35,506 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:16:35,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:16:35,513 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:16:35,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-04-11 21:16:35,537 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| Int)) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| 1))) is different from true [2018-04-11 21:16:35,539 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:16:35,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:16:35,541 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:16:35,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:5 [2018-04-11 21:16:35,548 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v___U_MULTI_ftest______false_valid_deref_i__calloc_model_~ptr~0.base_BEFORE_CALL_6 Int)) (= 1 (select |c_#valid| v___U_MULTI_ftest______false_valid_deref_i__calloc_model_~ptr~0.base_BEFORE_CALL_6))) (exists ((|__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| Int)) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| 1)))) is different from true [2018-04-11 21:16:35,555 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:16:35,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:16:35,562 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:16:35,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:25 [2018-04-11 21:16:35,606 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 27 not checked. [2018-04-11 21:16:35,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:16:35,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 21:16:35,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 21:16:35,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 21:16:35,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=175, Unknown=4, NotChecked=116, Total=342 [2018-04-11 21:16:35,625 INFO L87 Difference]: Start difference. First operand 843 states and 1258 transitions. Second operand 19 states. [2018-04-11 21:16:36,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:16:36,336 INFO L93 Difference]: Finished difference Result 1043 states and 1540 transitions. [2018-04-11 21:16:36,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 21:16:36,336 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 167 [2018-04-11 21:16:36,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:16:36,339 INFO L225 Difference]: With dead ends: 1043 [2018-04-11 21:16:36,339 INFO L226 Difference]: Without dead ends: 1043 [2018-04-11 21:16:36,340 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 146 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=509, Unknown=4, NotChecked=196, Total=812 [2018-04-11 21:16:36,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2018-04-11 21:16:36,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 840. [2018-04-11 21:16:36,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2018-04-11 21:16:36,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1252 transitions. [2018-04-11 21:16:36,359 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1252 transitions. Word has length 167 [2018-04-11 21:16:36,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:16:36,360 INFO L459 AbstractCegarLoop]: Abstraction has 840 states and 1252 transitions. [2018-04-11 21:16:36,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 21:16:36,360 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1252 transitions. [2018-04-11 21:16:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-04-11 21:16:36,361 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:16:36,362 INFO L355 BasicCegarLoop]: trace histogram [19, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:36,362 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_ftest______false_valid_deref_i__l0_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l0_destroyErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr16EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l2_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l1_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_insertErr2RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr4AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr5AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l3_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__calloc_modelErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__calloc_modelErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr6RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_insertErr7RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l2_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l1_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr2RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr3RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l0_insertErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr1RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr7AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr0RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr2AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr6AssertViolationMEMORY_FREE, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr4RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr5RequiresViolation, __U_MULTI_ftest______false_valid_deref_i__l4_destroyErr3AssertViolationMEMORY_FREE]=== [2018-04-11 21:16:36,362 INFO L82 PathProgramCache]: Analyzing trace with hash 438626805, now seen corresponding path program 1 times [2018-04-11 21:16:36,362 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:16:36,362 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:16:36,363 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:16:36,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 21:16:36,363 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:16:36,372 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-11 21:16:36,372 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-04-11 21:16:36,372 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:16:36,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:16:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:16:36,459 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:16:36,463 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:16:36,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:16:36,481 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:16:36,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:16:36,497 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:16:36,497 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:16:36,498 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:16:36,499 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:16:36,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:16:36,513 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2018-04-11 21:16:37,088 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((__U_MULTI_ftest______false_valid_deref_i__calloc_model_~size Int) (__U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb Int) (|__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse0 (mod (* __U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb __U_MULTI_ftest______false_valid_deref_i__calloc_model_~size) 4294967296))) (and (= 0 (select |c_old(#valid)| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base|)) (< 2147483647 .cse0) (= (store |c_old(#length)| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| (+ .cse0 (- 4294967296))) |c_#length|)))) (exists ((v_prenex_174 Int) (v_prenex_175 Int) (v_prenex_173 Int)) (let ((.cse1 (mod (* v_prenex_174 v_prenex_173) 4294967296))) (and (= (store |c_old(#length)| v_prenex_175 .cse1) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_175)) (<= .cse1 2147483647))))) is different from true [2018-04-11 21:16:37,091 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 23 treesize of output 18 [2018-04-11 21:16:37,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:16:37,104 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:16:37,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:16:37,119 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:16:37,120 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:16:37,135 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 24 treesize of output 19 [2018-04-11 21:16:37,135 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:16:37,148 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:16:37,148 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-04-11 21:16:37,192 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_174 Int) (v_prenex_175 Int) (v_prenex_173 Int)) (let ((.cse0 (mod (* v_prenex_174 v_prenex_173) 4294967296))) (and (= (select |c_#length| v_prenex_175) .cse0) (<= .cse0 2147483647)))) (exists ((__U_MULTI_ftest______false_valid_deref_i__calloc_model_~size Int) (__U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb Int) (|__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse1 (mod (* __U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb __U_MULTI_ftest______false_valid_deref_i__calloc_model_~size) 4294967296))) (and (< 2147483647 .cse1) (= (+ (select |c_#length| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base|) 4294967296) .cse1))))) is different from true [2018-04-11 21:16:37,754 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_prenex_178 Int) (v_prenex_183 Int) (v_prenex_181 Int)) (and (= 0 (select |c_old(#valid)| v_prenex_183)) (= |c_#length| (store |c_old(#length)| v_prenex_183 (+ (mod (* v_prenex_178 v_prenex_181) 4294967296) (- 4294967296)))) (< 2147483647 (mod (* v_prenex_181 v_prenex_178) 4294967296))))) (.cse1 (exists ((__U_MULTI_ftest______false_valid_deref_i__calloc_model_~size Int) (__U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb Int) (|__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse6 (mod (* __U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb __U_MULTI_ftest______false_valid_deref_i__calloc_model_~size) 4294967296))) (and (< 2147483647 .cse6) (= (+ (select |c_#length| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base|) 4294967296) .cse6))))) (.cse2 (exists ((v_prenex_174 Int) (v_prenex_175 Int) (v_prenex_173 Int)) (let ((.cse5 (mod (* v_prenex_174 v_prenex_173) 4294967296))) (and (= (select |c_#length| v_prenex_175) .cse5) (<= .cse5 2147483647))))) (.cse3 (exists ((v_prenex_179 Int) (v_prenex_182 Int) (v_prenex_180 Int)) (let ((.cse4 (mod (* v_prenex_179 v_prenex_182) 4294967296))) (and (<= .cse4 2147483647) (= 0 (select |c_old(#valid)| v_prenex_180)) (= (store |c_old(#length)| v_prenex_180 .cse4) |c_#length|)))))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse1 .cse3) (and .cse2 .cse3))) is different from true [2018-04-11 21:16:37,764 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_174 Int) (v_prenex_175 Int) (v_prenex_173 Int)) (let ((.cse0 (mod (* v_prenex_174 v_prenex_173) 4294967296))) (and (= (select |c_#length| v_prenex_175) .cse0) (<= .cse0 2147483647)))) (exists ((v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_184 Int)) (let ((.cse1 (mod (* v_prenex_186 v_prenex_184) 4294967296))) (and (= (store |c_old(#length)| v_prenex_185 (+ .cse1 (- 4294967296))) |c_#length|) (< 2147483647 .cse1) (= 0 (select |c_old(#valid)| v_prenex_185)))))) (and (exists ((v_prenex_178 Int) (v_prenex_183 Int) (v_prenex_181 Int)) (and (= 0 (select |c_old(#valid)| v_prenex_183)) (= |c_#length| (store |c_old(#length)| v_prenex_183 (+ (mod (* v_prenex_178 v_prenex_181) 4294967296) (- 4294967296)))) (< 2147483647 (mod (* v_prenex_181 v_prenex_178) 4294967296)))) (exists ((__U_MULTI_ftest______false_valid_deref_i__calloc_model_~size Int) (__U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb Int) (|__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse2 (mod (* __U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb __U_MULTI_ftest______false_valid_deref_i__calloc_model_~size) 4294967296))) (and (< 2147483647 .cse2) (= (+ (select |c_#length| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base|) 4294967296) .cse2))))) (and (exists ((v_prenex_189 Int) (v_prenex_187 Int) (v_prenex_188 Int)) (let ((.cse3 (mod (* v_prenex_189 v_prenex_187) 4294967296))) (and (= (+ (select |c_#length| v_prenex_188) 4294967296) .cse3) (< 2147483647 .cse3)))) (exists ((v_prenex_179 Int) (v_prenex_182 Int) (v_prenex_180 Int)) (let ((.cse4 (mod (* v_prenex_179 v_prenex_182) 4294967296))) (and (<= .cse4 2147483647) (= 0 (select |c_old(#valid)| v_prenex_180)) (= (store |c_old(#length)| v_prenex_180 .cse4) |c_#length|))))) (and (exists ((v_prenex_194 Int) (v_prenex_195 Int) (v_prenex_190 Int)) (and (= (store |c_old(#length)| v_prenex_195 (mod (* v_prenex_194 v_prenex_190) 4294967296)) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_195)) (<= (mod (* v_prenex_190 v_prenex_194) 4294967296) 2147483647))) (exists ((v_prenex_192 Int) (v_prenex_193 Int) (v_prenex_191 Int)) (let ((.cse5 (mod (* v_prenex_191 v_prenex_193) 4294967296))) (and (= (select |c_#length| v_prenex_192) .cse5) (<= .cse5 2147483647)))))) is different from true [2018-04-11 21:16:37,812 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_192 Int) (v_prenex_193 Int) (v_prenex_191 Int)) (let ((.cse0 (mod (* v_prenex_191 v_prenex_193) 4294967296))) (and (= (select |c_#length| v_prenex_192) .cse0) (<= .cse0 2147483647)))) (exists ((v_prenex_194 Int) (v_prenex_195 Int) (v_prenex_190 Int)) (and (= (store |c_old(#length)| v_prenex_195 (mod (* v_prenex_194 v_prenex_190) 4294967296)) |c_#length|) (= (select |c_old(#valid)| v_prenex_195) 0) (<= (mod (* v_prenex_190 v_prenex_194) 4294967296) 2147483647)))) (and (exists ((v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_184 Int)) (let ((.cse1 (mod (* v_prenex_186 v_prenex_184) 4294967296))) (and (= (store |c_old(#length)| v_prenex_185 (+ .cse1 (- 4294967296))) |c_#length|) (< 2147483647 .cse1) (= (select |c_old(#valid)| v_prenex_185) 0)))) (exists ((v_prenex_174 Int) (v_prenex_175 Int) (v_prenex_173 Int)) (let ((.cse2 (mod (* v_prenex_174 v_prenex_173) 4294967296))) (and (= (select |c_#length| v_prenex_175) .cse2) (<= .cse2 2147483647))))) (and (exists ((v_prenex_178 Int) (v_prenex_183 Int) (v_prenex_181 Int)) (and (= (select |c_old(#valid)| v_prenex_183) 0) (= |c_#length| (store |c_old(#length)| v_prenex_183 (+ (mod (* v_prenex_178 v_prenex_181) 4294967296) (- 4294967296)))) (< 2147483647 (mod (* v_prenex_181 v_prenex_178) 4294967296)))) (exists ((__U_MULTI_ftest______false_valid_deref_i__calloc_model_~size Int) (__U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb Int) (|__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base| Int)) (let ((.cse3 (mod (* __U_MULTI_ftest______false_valid_deref_i__calloc_model_~nmemb __U_MULTI_ftest______false_valid_deref_i__calloc_model_~size) 4294967296))) (and (< 2147483647 .cse3) (= (+ (select |c_#length| |__U_MULTI_ftest______false_valid_deref_i__calloc_model_#t~malloc0.base|) 4294967296) .cse3))))) (and (exists ((v_prenex_179 Int) (v_prenex_182 Int) (v_prenex_180 Int)) (let ((.cse4 (mod (* v_prenex_179 v_prenex_182) 4294967296))) (and (<= .cse4 2147483647) (= (store |c_old(#length)| v_prenex_180 .cse4) |c_#length|) (= (select |c_old(#valid)| v_prenex_180) 0)))) (exists ((v_prenex_189 Int) (v_prenex_187 Int) (v_prenex_188 Int)) (let ((.cse5 (mod (* v_prenex_189 v_prenex_187) 4294967296))) (and (= (+ (select |c_#length| v_prenex_188) 4294967296) .cse5) (< 2147483647 .cse5)))))) is different from true [2018-04-11 21:16:37,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:16:37,856 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 74 treesize of output 77 [2018-04-11 21:16:37,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:16:53,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:16:53,098 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 65 treesize of output 68 [2018-04-11 21:16:53,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:17:04,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:17:04,514 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 69 treesize of output 72 [2018-04-11 21:17:04,514 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:17:21,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:17:21,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:17:21,025 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 64 treesize of output 58 [2018-04-11 21:17:21,026 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:17:38,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:17:38,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:17:38,365 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 65 treesize of output 80 [2018-04-11 21:17:38,365 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. Received shutdown request... [2018-04-11 21:17:53,186 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 21:17:53,186 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 21:17:53,189 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 21:17:53,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 09:17:53 BoogieIcfgContainer [2018-04-11 21:17:53,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 21:17:53,190 INFO L168 Benchmark]: Toolchain (without parser) took 877824.10 ms. Allocated memory was 316.1 MB in the beginning and 664.3 MB in the end (delta: 348.1 MB). Free memory was 258.6 MB in the beginning and 398.4 MB in the end (delta: -139.8 MB). Peak memory consumption was 208.3 MB. Max. memory is 5.3 GB. [2018-04-11 21:17:53,191 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 316.1 MB. Free memory is still 286.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 21:17:53,191 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.72 ms. Allocated memory is still 316.1 MB. Free memory was 258.6 MB in the beginning and 211.8 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 5.3 GB. [2018-04-11 21:17:53,191 INFO L168 Benchmark]: Boogie Preprocessor took 52.13 ms. Allocated memory is still 316.1 MB. Free memory was 211.8 MB in the beginning and 208.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 5.3 GB. [2018-04-11 21:17:53,191 INFO L168 Benchmark]: RCFGBuilder took 748.06 ms. Allocated memory was 316.1 MB in the beginning and 384.8 MB in the end (delta: 68.7 MB). Free memory was 208.3 MB in the beginning and 264.4 MB in the end (delta: -56.1 MB). Peak memory consumption was 36.2 MB. Max. memory is 5.3 GB. [2018-04-11 21:17:53,191 INFO L168 Benchmark]: TraceAbstraction took 876739.06 ms. Allocated memory was 384.8 MB in the beginning and 664.3 MB in the end (delta: 279.4 MB). Free memory was 264.4 MB in the beginning and 398.4 MB in the end (delta: -134.0 MB). Peak memory consumption was 145.5 MB. Max. memory is 5.3 GB. [2018-04-11 21:17:53,192 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.12 ms. Allocated memory is still 316.1 MB. Free memory is still 286.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 281.72 ms. Allocated memory is still 316.1 MB. Free memory was 258.6 MB in the beginning and 211.8 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 52.13 ms. Allocated memory is still 316.1 MB. Free memory was 211.8 MB in the beginning and 208.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 5.3 GB. * RCFGBuilder took 748.06 ms. Allocated memory was 316.1 MB in the beginning and 384.8 MB in the end (delta: 68.7 MB). Free memory was 208.3 MB in the beginning and 264.4 MB in the end (delta: -56.1 MB). Peak memory consumption was 36.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 876739.06 ms. Allocated memory was 384.8 MB in the beginning and 664.3 MB in the end (delta: 279.4 MB). Free memory was 264.4 MB in the beginning and 398.4 MB in the end (delta: -134.0 MB). Peak memory consumption was 145.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 868]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 867]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 870]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 867]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 870]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 868]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 883]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 887]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 887). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 881]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 885]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 881]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 875]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 875). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 882]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 884]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 886]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 885]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 886]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 888]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 888). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 882]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 883]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 887]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 887). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 884]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 888]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 888). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 843]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 844]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 843]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 844]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 846]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 846]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 855]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 858]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 855]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 856]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 858]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 856]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 785]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 786]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 786]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 785]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 785]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 785]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 877]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 877]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 832]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 834]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 834]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 832]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 831]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 831). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 831]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 831). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 742]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 742]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 776]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 776]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 776]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 775]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 776]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 777]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 775]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 777]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 794]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 794]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 794]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 795]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 794]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 795]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 803]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 803]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 803]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 803]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 804]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 804]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 812]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 813]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 812]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 813]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 812]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 812]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 819]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 822]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 819]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 819]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 822]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 820]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 820]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 819]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was analyzing trace of length 164 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 287 locations, 85 error locations. TIMEOUT Result, 876.6s OverallTime, 12 OverallIterations, 23 TraceHistogramMax, 531.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2826 SDtfs, 2881 SDslu, 13126 SDs, 0 SdLazy, 17512 SolverSat, 523 SolverUnsat, 314 SolverUnknown, 0 SolverNotchecked, 272.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1187 GetRequests, 978 SyntacticMatches, 9 SemanticMatches, 200 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 344.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=843occurred in iteration=10, 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 897 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 265.2s InterpolantComputationTime, 1117 NumberOfCodeBlocks, 1035 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1106 ConstructedInterpolants, 166 QuantifiedInterpolants, 1368498 SizeOfPredicates, 75 NumberOfNonLiveVariables, 5102 ConjunctsInSsa, 336 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 2787/2992 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-0235_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_21-17-53-198.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0235_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_21-17-53-198.csv Completed graceful shutdown