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-ext2/optional_data_creation_test04_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 11:01:53,492 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 11:01:53,493 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 11:01:53,504 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 11:01:53,504 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 11:01:53,505 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 11:01:53,506 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 11:01:53,508 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 11:01:53,509 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 11:01:53,510 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 11:01:53,511 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 11:01:53,511 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 11:01:53,512 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 11:01:53,512 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 11:01:53,513 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 11:01:53,515 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 11:01:53,516 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 11:01:53,517 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 11:01:53,518 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 11:01:53,519 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 11:01:53,521 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 11:01:53,521 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 11:01:53,521 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 11:01:53,522 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 11:01:53,523 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 11:01:53,524 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 11:01:53,524 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 11:01:53,524 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 11:01:53,525 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 11:01:53,525 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 11:01:53,526 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 11:01:53,526 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 11:01:53,546 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 11:01:53,547 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 11:01:53,548 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 11:01:53,548 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 11:01:53,548 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 11:01:53,548 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 11:01:53,548 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 11:01:53,548 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 11:01:53,549 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 11:01:53,549 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 11:01:53,549 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 11:01:53,549 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 11:01:53,549 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 11:01:53,549 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 11:01:53,549 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 11:01:53,550 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 11:01:53,550 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 11:01:53,550 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 11:01:53,550 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 11:01:53,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 11:01:53,550 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 11:01:53,551 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 11:01:53,551 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 11:01:53,551 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 11:01:53,580 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 11:01:53,591 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 11:01:53,594 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 11:01:53,596 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 11:01:53,597 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 11:01:53,597 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,052 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGdbbb810ea [2018-04-11 11:01:54,184 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 11:01:54,184 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 11:01:54,184 INFO L168 CDTParser]: Scanning optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,191 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 11:01:54,191 INFO L215 ultiparseSymbolTable]: [2018-04-11 11:01:54,192 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 11:01:54,192 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append ('append') in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,192 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeData ('freeData') in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,192 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____bswap_64 ('__bswap_64') in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,192 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,192 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____bswap_32 ('__bswap_32') in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,192 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_data ('create_data') in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,192 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 11:01:54,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____int8_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__register_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____uint64_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____fsword_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_once_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__off_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_attr_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____nlink_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____socklen_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____sig_atomic_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__timer_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____ssize_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__fsfilcnt_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____mode_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__nlink_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__uint in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__int32_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____intptr_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pid_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____blkcnt64_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__gid_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__dev_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__u_short in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____uid_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__ssize_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__id_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__mode_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__fsid_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__int64_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____key_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____blkcnt_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_mutex_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____clock_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____u_int in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____useconds_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__time_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____u_short in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____loff_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__suseconds_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____syscall_slong_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____blksize_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__int8_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__daddr_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____qaddr_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____uint16_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____fsfilcnt64_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____int64_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_condattr_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__ldiv_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__ino_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__ushort in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____rlim64_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____time_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____uint8_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__u_quad_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__u_int64_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__loff_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____daddr_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____fsfilcnt_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_barrierattr_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__sigset_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__blkcnt_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__ulong in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__u_char in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____u_long in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____int16_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__u_int32_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____dev_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____fsblkcnt_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__Data in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____off_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_key_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_rwlock_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__clock_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____fsid_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__blksize_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__u_long in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____uint32_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____caddr_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__fd_set in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_rwlockattr_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____ino_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____ino64_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____sigset_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__quad_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__caddr_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____rlim_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_cond_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_spinlock_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__u_int in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__u_int16_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____int32_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__fd_mask in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__div_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__size_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__u_int8_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__uid_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__key_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____pthread_slist_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____clockid_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__clockid_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____fd_mask in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__int16_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__lldiv_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____quad_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____gid_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__wchar_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____u_char in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____u_quad_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____syscall_ulong_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____id_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_barrier_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__pthread_mutexattr_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__fsblkcnt_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____timer_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____off64_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____suseconds_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____fsblkcnt64_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____pid_t in optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,217 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGdbbb810ea [2018-04-11 11:01:54,221 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 11:01:54,223 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 11:01:54,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 11:01:54,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 11:01:54,227 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 11:01:54,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 11:01:54" (1/1) ... [2018-04-11 11:01:54,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@627d6a3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:01:54, skipping insertion in model container [2018-04-11 11:01:54,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 11:01:54" (1/1) ... [2018-04-11 11:01:54,241 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 11:01:54,264 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 11:01:54,392 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 11:01:54,431 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 11:01:54,438 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 120 non ball SCCs. Number of states in SCCs 120. [2018-04-11 11:01:54,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:01:54 WrapperNode [2018-04-11 11:01:54,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 11:01:54,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 11:01:54,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 11:01:54,482 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 11:01:54,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:01:54" (1/1) ... [2018-04-11 11:01:54,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:01:54" (1/1) ... [2018-04-11 11:01:54,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:01:54" (1/1) ... [2018-04-11 11:01:54,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:01:54" (1/1) ... [2018-04-11 11:01:54,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:01:54" (1/1) ... [2018-04-11 11:01:54,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:01:54" (1/1) ... [2018-04-11 11:01:54,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:01:54" (1/1) ... [2018-04-11 11:01:54,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 11:01:54,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 11:01:54,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 11:01:54,528 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 11:01:54,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:01:54" (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 11:01:54,607 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 11:01:54,607 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 11:01:54,607 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____bswap_32 [2018-04-11 11:01:54,607 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____bswap_64 [2018-04-11 11:01:54,607 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_data [2018-04-11 11:01:54,607 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeData [2018-04-11 11:01:54,608 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append [2018-04-11 11:01:54,608 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 11:01:54,608 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 11:01:54,608 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 11:01:54,608 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 11:01:54,608 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 11:01:54,608 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 11:01:54,608 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 11:01:54,608 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 11:01:54,608 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 11:01:54,608 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 11:01:54,608 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 11:01:54,608 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 11:01:54,608 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 11:01:54,608 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 11:01:54,608 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 11:01:54,609 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 11:01:54,609 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 11:01:54,609 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 11:01:54,609 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____bswap_32 [2018-04-11 11:01:54,609 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i____bswap_64 [2018-04-11 11:01:54,609 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 11:01:54,609 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 11:01:54,609 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 11:01:54,609 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 11:01:54,609 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 11:01:54,609 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 11:01:54,609 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 11:01:54,609 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 11:01:54,609 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 11:01:54,609 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 11:01:54,609 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 11:01:54,609 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 11:01:54,609 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 11:01:54,610 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 11:01:54,610 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 11:01:54,610 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 11:01:54,610 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 11:01:54,610 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 11:01:54,610 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 11:01:54,610 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 11:01:54,610 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 11:01:54,610 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 11:01:54,610 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 11:01:54,610 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 11:01:54,610 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 11:01:54,610 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 11:01:54,610 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 11:01:54,610 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 11:01:54,610 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 11:01:54,610 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 11:01:54,610 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 11:01:54,610 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 11:01:54,611 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 11:01:54,611 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 11:01:54,611 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 11:01:54,611 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 11:01:54,611 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 11:01:54,611 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 11:01:54,611 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 11:01:54,611 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 11:01:54,611 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 11:01:54,611 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 11:01:54,611 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-11 11:01:54,611 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 11:01:54,611 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 11:01:54,611 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-11 11:01:54,611 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 11:01:54,611 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 11:01:54,611 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-11 11:01:54,612 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 11:01:54,612 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 11:01:54,612 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 11:01:54,613 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 11:01:54,614 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 11:01:54,614 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 11:01:54,614 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 11:01:54,614 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 11:01:54,614 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 11:01:54,614 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 11:01:54,614 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 11:01:54,614 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 11:01:54,614 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 11:01:54,614 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 11:01:54,614 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 11:01:54,614 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 11:01:54,614 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 11:01:54,614 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 11:01:54,615 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 11:01:54,615 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 11:01:54,615 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 11:01:54,615 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 11:01:54,615 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 11:01:54,615 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 11:01:54,615 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 11:01:54,615 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 11:01:54,615 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 11:01:54,615 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 11:01:54,616 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 11:01:54,616 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 11:01:54,616 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 11:01:54,616 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 11:01:54,616 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 11:01:54,616 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 11:01:54,616 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 11:01:54,616 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 11:01:54,616 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 11:01:54,616 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 11:01:54,616 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 11:01:54,616 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_data [2018-04-11 11:01:54,617 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 11:01:54,617 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 11:01:54,617 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 11:01:54,617 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 11:01:54,617 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeData [2018-04-11 11:01:54,617 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 11:01:54,617 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append [2018-04-11 11:01:54,617 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 11:01:54,617 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 11:01:54,617 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 11:01:54,618 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 11:01:54,618 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 11:01:54,967 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 11:01:54,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 11:01:54 BoogieIcfgContainer [2018-04-11 11:01:54,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 11:01:54,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 11:01:54,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 11:01:54,970 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 11:01:54,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 11:01:54" (1/3) ... [2018-04-11 11:01:54,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ed65b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 11:01:54, skipping insertion in model container [2018-04-11 11:01:54,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:01:54" (2/3) ... [2018-04-11 11:01:54,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ed65b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 11:01:54, skipping insertion in model container [2018-04-11 11:01:54,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 11:01:54" (3/3) ... [2018-04-11 11:01:54,972 INFO L107 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04_false-valid-memtrack.i [2018-04-11 11:01:54,979 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 11:01:54,984 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-04-11 11:01:55,014 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 11:01:55,014 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 11:01:55,014 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 11:01:55,014 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 11:01:55,014 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 11:01:55,014 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 11:01:55,014 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 11:01:55,014 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 11:01:55,014 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 11:01:55,015 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 11:01:55,025 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-04-11 11:01:55,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-04-11 11:01:55,033 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:01:55,034 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:01:55,034 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:01:55,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1118692906, now seen corresponding path program 1 times [2018-04-11 11:01:55,039 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:01:55,040 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:01:55,076 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:55,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:01:55,076 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:01:55,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:01:55,131 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 11:01:55,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:01:55,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 11:01:55,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 11:01:55,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 11:01:55,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 11:01:55,143 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2018-04-11 11:01:55,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:01:55,264 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2018-04-11 11:01:55,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 11:01:55,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-04-11 11:01:55,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:01:55,275 INFO L225 Difference]: With dead ends: 129 [2018-04-11 11:01:55,275 INFO L226 Difference]: Without dead ends: 126 [2018-04-11 11:01:55,277 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 11:01:55,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-11 11:01:55,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2018-04-11 11:01:55,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 11:01:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2018-04-11 11:01:55,310 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 7 [2018-04-11 11:01:55,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:01:55,311 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2018-04-11 11:01:55,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 11:01:55,311 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2018-04-11 11:01:55,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-04-11 11:01:55,311 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:01:55,311 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:01:55,311 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:01:55,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1118692905, now seen corresponding path program 1 times [2018-04-11 11:01:55,312 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:01:55,312 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:01:55,313 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:55,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:01:55,313 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:01:55,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:01:55,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:01:55,356 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:01:55,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 11:01:55,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 11:01:55,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 11:01:55,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 11:01:55,358 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 3 states. [2018-04-11 11:01:55,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:01:55,413 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-04-11 11:01:55,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 11:01:55,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-04-11 11:01:55,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:01:55,415 INFO L225 Difference]: With dead ends: 124 [2018-04-11 11:01:55,415 INFO L226 Difference]: Without dead ends: 124 [2018-04-11 11:01:55,415 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 11:01:55,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-11 11:01:55,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-04-11 11:01:55,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-11 11:01:55,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-04-11 11:01:55,423 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 7 [2018-04-11 11:01:55,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:01:55,423 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-04-11 11:01:55,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 11:01:55,424 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-04-11 11:01:55,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 11:01:55,424 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:01:55,424 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:01:55,424 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:01:55,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1889111161, now seen corresponding path program 1 times [2018-04-11 11:01:55,425 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:01:55,425 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:01:55,425 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:55,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:01:55,426 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:01:55,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:01:55,488 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 11:01:55,488 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:01:55,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 11:01:55,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 11:01:55,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 11:01:55,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:01:55,489 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 5 states. [2018-04-11 11:01:55,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:01:55,652 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2018-04-11 11:01:55,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 11:01:55,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 11:01:55,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:01:55,653 INFO L225 Difference]: With dead ends: 135 [2018-04-11 11:01:55,653 INFO L226 Difference]: Without dead ends: 135 [2018-04-11 11:01:55,653 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 11:01:55,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-11 11:01:55,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2018-04-11 11:01:55,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 11:01:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-04-11 11:01:55,660 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 14 [2018-04-11 11:01:55,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:01:55,660 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-04-11 11:01:55,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 11:01:55,660 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-04-11 11:01:55,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 11:01:55,661 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:01:55,661 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:01:55,661 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:01:55,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1889111162, now seen corresponding path program 1 times [2018-04-11 11:01:55,661 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:01:55,661 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:01:55,662 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:55,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:01:55,662 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:01:55,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:01:55,743 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 11:01:55,744 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:01:55,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 11:01:55,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 11:01:55,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 11:01:55,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-11 11:01:55,745 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 7 states. [2018-04-11 11:01:55,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:01:55,905 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-04-11 11:01:55,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 11:01:55,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-04-11 11:01:55,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:01:55,906 INFO L225 Difference]: With dead ends: 133 [2018-04-11 11:01:55,906 INFO L226 Difference]: Without dead ends: 133 [2018-04-11 11:01:55,906 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-04-11 11:01:55,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-11 11:01:55,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2018-04-11 11:01:55,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 11:01:55,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-04-11 11:01:55,910 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 14 [2018-04-11 11:01:55,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:01:55,910 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-04-11 11:01:55,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 11:01:55,910 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-04-11 11:01:55,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 11:01:55,910 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:01:55,910 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:01:55,910 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:01:55,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1567096148, now seen corresponding path program 1 times [2018-04-11 11:01:55,910 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:01:55,911 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:01:55,911 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:55,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:01:55,911 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:01:55,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:01:55,934 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 11:01:55,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:01:55,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 11:01:55,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 11:01:55,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 11:01:55,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 11:01:55,935 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 4 states. [2018-04-11 11:01:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:01:56,001 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2018-04-11 11:01:56,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 11:01:56,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-11 11:01:56,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:01:56,002 INFO L225 Difference]: With dead ends: 127 [2018-04-11 11:01:56,002 INFO L226 Difference]: Without dead ends: 127 [2018-04-11 11:01:56,002 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:01:56,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-11 11:01:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-04-11 11:01:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-11 11:01:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2018-04-11 11:01:56,007 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 15 [2018-04-11 11:01:56,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:01:56,008 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2018-04-11 11:01:56,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 11:01:56,008 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2018-04-11 11:01:56,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 11:01:56,008 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:01:56,008 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:01:56,008 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:01:56,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1567096147, now seen corresponding path program 1 times [2018-04-11 11:01:56,009 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:01:56,009 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:01:56,010 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:56,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:01:56,010 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:01:56,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:01:56,048 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 11:01:56,048 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:01:56,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 11:01:56,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 11:01:56,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 11:01:56,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 11:01:56,049 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand 4 states. [2018-04-11 11:01:56,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:01:56,107 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-04-11 11:01:56,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 11:01:56,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-11 11:01:56,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:01:56,108 INFO L225 Difference]: With dead ends: 126 [2018-04-11 11:01:56,108 INFO L226 Difference]: Without dead ends: 126 [2018-04-11 11:01:56,108 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:01:56,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-11 11:01:56,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-04-11 11:01:56,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-11 11:01:56,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-04-11 11:01:56,112 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 15 [2018-04-11 11:01:56,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:01:56,112 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-04-11 11:01:56,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 11:01:56,112 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-04-11 11:01:56,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 11:01:56,112 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:01:56,112 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:01:56,112 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:01:56,113 INFO L82 PathProgramCache]: Analyzing trace with hash -262877075, now seen corresponding path program 1 times [2018-04-11 11:01:56,113 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:01:56,113 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:01:56,113 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:56,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:01:56,113 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:01:56,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:01:56,146 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 11:01:56,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:01:56,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 11:01:56,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 11:01:56,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 11:01:56,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:01:56,147 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 5 states. [2018-04-11 11:01:56,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:01:56,265 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2018-04-11 11:01:56,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 11:01:56,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-04-11 11:01:56,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:01:56,266 INFO L225 Difference]: With dead ends: 143 [2018-04-11 11:01:56,266 INFO L226 Difference]: Without dead ends: 143 [2018-04-11 11:01:56,267 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 11:01:56,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-04-11 11:01:56,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 129. [2018-04-11 11:01:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 11:01:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2018-04-11 11:01:56,270 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 22 [2018-04-11 11:01:56,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:01:56,270 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2018-04-11 11:01:56,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 11:01:56,270 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2018-04-11 11:01:56,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 11:01:56,270 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:01:56,270 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:01:56,275 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:01:56,275 INFO L82 PathProgramCache]: Analyzing trace with hash -262877074, now seen corresponding path program 1 times [2018-04-11 11:01:56,275 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:01:56,275 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:01:56,276 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:56,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:01:56,276 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:01:56,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:01:56,313 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 11:01:56,314 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:01:56,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 11:01:56,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 11:01:56,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 11:01:56,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:01:56,314 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand 5 states. [2018-04-11 11:01:56,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:01:56,407 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-04-11 11:01:56,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 11:01:56,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-04-11 11:01:56,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:01:56,409 INFO L225 Difference]: With dead ends: 135 [2018-04-11 11:01:56,409 INFO L226 Difference]: Without dead ends: 135 [2018-04-11 11:01:56,409 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 11:01:56,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-11 11:01:56,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 129. [2018-04-11 11:01:56,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 11:01:56,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2018-04-11 11:01:56,413 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 22 [2018-04-11 11:01:56,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:01:56,413 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2018-04-11 11:01:56,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 11:01:56,414 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2018-04-11 11:01:56,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 11:01:56,414 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:01:56,414 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:01:56,414 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:01:56,415 INFO L82 PathProgramCache]: Analyzing trace with hash 440344442, now seen corresponding path program 1 times [2018-04-11 11:01:56,415 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:01:56,415 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:01:56,415 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:56,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:01:56,416 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:01:56,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:01:56,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:01:56,457 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:01:56,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 11:01:56,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 11:01:56,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 11:01:56,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 11:01:56,458 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 4 states. [2018-04-11 11:01:56,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:01:56,542 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2018-04-11 11:01:56,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 11:01:56,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-04-11 11:01:56,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:01:56,544 INFO L225 Difference]: With dead ends: 134 [2018-04-11 11:01:56,544 INFO L226 Difference]: Without dead ends: 134 [2018-04-11 11:01:56,544 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:01:56,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-11 11:01:56,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2018-04-11 11:01:56,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-11 11:01:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2018-04-11 11:01:56,547 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 23 [2018-04-11 11:01:56,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:01:56,547 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2018-04-11 11:01:56,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 11:01:56,548 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2018-04-11 11:01:56,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 11:01:56,548 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:01:56,548 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:01:56,548 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:01:56,548 INFO L82 PathProgramCache]: Analyzing trace with hash 440344441, now seen corresponding path program 1 times [2018-04-11 11:01:56,548 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:01:56,548 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:01:56,549 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:56,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:01:56,549 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:01:56,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:01:56,571 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 11:01:56,571 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:01:56,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 11:01:56,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 11:01:56,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 11:01:56,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 11:01:56,571 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand 4 states. [2018-04-11 11:01:56,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:01:56,621 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-04-11 11:01:56,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 11:01:56,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-04-11 11:01:56,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:01:56,622 INFO L225 Difference]: With dead ends: 126 [2018-04-11 11:01:56,622 INFO L226 Difference]: Without dead ends: 126 [2018-04-11 11:01:56,622 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:01:56,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-11 11:01:56,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-04-11 11:01:56,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-11 11:01:56,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-04-11 11:01:56,625 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 23 [2018-04-11 11:01:56,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:01:56,625 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-04-11 11:01:56,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 11:01:56,626 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-04-11 11:01:56,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 11:01:56,626 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:01:56,626 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:01:56,626 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:01:56,626 INFO L82 PathProgramCache]: Analyzing trace with hash 778201806, now seen corresponding path program 1 times [2018-04-11 11:01:56,627 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:01:56,627 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:01:56,627 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:56,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:01:56,627 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:01:56,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:01:56,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:01:56,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:01:56,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 11:01:56,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 11:01:56,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 11:01:56,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 11:01:56,655 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 4 states. [2018-04-11 11:01:56,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:01:56,742 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2018-04-11 11:01:56,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 11:01:56,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-04-11 11:01:56,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:01:56,743 INFO L225 Difference]: With dead ends: 136 [2018-04-11 11:01:56,743 INFO L226 Difference]: Without dead ends: 136 [2018-04-11 11:01:56,743 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 11:01:56,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-11 11:01:56,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2018-04-11 11:01:56,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 11:01:56,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-04-11 11:01:56,749 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 24 [2018-04-11 11:01:56,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:01:56,750 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-04-11 11:01:56,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 11:01:56,750 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-04-11 11:01:56,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 11:01:56,750 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:01:56,751 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:01:56,751 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:01:56,751 INFO L82 PathProgramCache]: Analyzing trace with hash 778201807, now seen corresponding path program 1 times [2018-04-11 11:01:56,751 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:01:56,751 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:01:56,752 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:56,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:01:56,752 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:01:56,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:01:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:01:56,825 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:01:56,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 11:01:56,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 11:01:56,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 11:01:56,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 11:01:56,826 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 7 states. [2018-04-11 11:01:57,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:01:57,009 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-04-11 11:01:57,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 11:01:57,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-04-11 11:01:57,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:01:57,010 INFO L225 Difference]: With dead ends: 128 [2018-04-11 11:01:57,010 INFO L226 Difference]: Without dead ends: 128 [2018-04-11 11:01:57,011 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-04-11 11:01:57,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-11 11:01:57,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-04-11 11:01:57,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 11:01:57,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-04-11 11:01:57,013 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 24 [2018-04-11 11:01:57,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:01:57,014 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-04-11 11:01:57,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 11:01:57,014 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-04-11 11:01:57,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 11:01:57,016 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:01:57,016 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:01:57,017 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:01:57,017 INFO L82 PathProgramCache]: Analyzing trace with hash 765747116, now seen corresponding path program 1 times [2018-04-11 11:01:57,017 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:01:57,017 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:01:57,018 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:57,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:01:57,018 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:01:57,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:01:57,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:01:57,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:01:57,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 11:01:57,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 11:01:57,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 11:01:57,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:01:57,096 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 5 states. [2018-04-11 11:01:57,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:01:57,222 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-04-11 11:01:57,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 11:01:57,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-04-11 11:01:57,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:01:57,227 INFO L225 Difference]: With dead ends: 125 [2018-04-11 11:01:57,227 INFO L226 Difference]: Without dead ends: 125 [2018-04-11 11:01:57,228 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 11:01:57,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-11 11:01:57,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-04-11 11:01:57,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 11:01:57,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-04-11 11:01:57,230 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 24 [2018-04-11 11:01:57,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:01:57,230 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-04-11 11:01:57,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 11:01:57,231 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-04-11 11:01:57,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 11:01:57,231 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:01:57,231 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:01:57,232 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:01:57,232 INFO L82 PathProgramCache]: Analyzing trace with hash -103829771, now seen corresponding path program 1 times [2018-04-11 11:01:57,232 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:01:57,232 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:01:57,233 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:57,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:01:57,233 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:01:57,242 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:01:57,326 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 11:01:57,326 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:01:57,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 11:01:57,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 11:01:57,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 11:01:57,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-04-11 11:01:57,327 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 8 states. [2018-04-11 11:01:57,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:01:57,634 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2018-04-11 11:01:57,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 11:01:57,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-04-11 11:01:57,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:01:57,635 INFO L225 Difference]: With dead ends: 139 [2018-04-11 11:01:57,635 INFO L226 Difference]: Without dead ends: 139 [2018-04-11 11:01:57,636 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-04-11 11:01:57,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-04-11 11:01:57,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 129. [2018-04-11 11:01:57,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 11:01:57,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2018-04-11 11:01:57,638 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 29 [2018-04-11 11:01:57,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:01:57,638 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2018-04-11 11:01:57,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 11:01:57,639 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2018-04-11 11:01:57,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 11:01:57,639 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:01:57,639 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:01:57,639 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:01:57,640 INFO L82 PathProgramCache]: Analyzing trace with hash -103829770, now seen corresponding path program 1 times [2018-04-11 11:01:57,640 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:01:57,640 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:01:57,640 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:57,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:01:57,641 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:01:57,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:01:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:01:57,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:01:57,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 11:01:57,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 11:01:57,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 11:01:57,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-11 11:01:57,710 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand 7 states. [2018-04-11 11:01:57,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:01:57,954 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2018-04-11 11:01:57,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 11:01:57,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-04-11 11:01:57,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:01:57,955 INFO L225 Difference]: With dead ends: 137 [2018-04-11 11:01:57,955 INFO L226 Difference]: Without dead ends: 137 [2018-04-11 11:01:57,955 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-04-11 11:01:57,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-11 11:01:57,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 129. [2018-04-11 11:01:57,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 11:01:57,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2018-04-11 11:01:57,959 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 29 [2018-04-11 11:01:57,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:01:57,959 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2018-04-11 11:01:57,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 11:01:57,959 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2018-04-11 11:01:57,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 11:01:57,960 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:01:57,960 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:01:57,960 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:01:57,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1741287252, now seen corresponding path program 1 times [2018-04-11 11:01:57,960 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:01:57,960 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:01:57,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:57,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:01:57,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:01:57,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:01:57,984 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 11:01:57,984 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:01:57,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 11:01:57,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 11:01:57,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 11:01:57,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:01:57,985 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 5 states. [2018-04-11 11:01:58,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:01:58,056 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2018-04-11 11:01:58,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 11:01:58,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-04-11 11:01:58,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:01:58,057 INFO L225 Difference]: With dead ends: 127 [2018-04-11 11:01:58,057 INFO L226 Difference]: Without dead ends: 127 [2018-04-11 11:01:58,058 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 11:01:58,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-11 11:01:58,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-04-11 11:01:58,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-11 11:01:58,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2018-04-11 11:01:58,061 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 30 [2018-04-11 11:01:58,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:01:58,061 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2018-04-11 11:01:58,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 11:01:58,061 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-04-11 11:01:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 11:01:58,061 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:01:58,061 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:01:58,062 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:01:58,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1741287253, now seen corresponding path program 1 times [2018-04-11 11:01:58,062 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:01:58,062 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:01:58,062 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:58,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:01:58,062 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:01:58,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:01:58,136 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 11:01:58,136 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:01:58,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 11:01:58,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 11:01:58,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 11:01:58,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 11:01:58,136 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 6 states. [2018-04-11 11:01:58,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:01:58,248 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2018-04-11 11:01:58,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 11:01:58,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-04-11 11:01:58,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:01:58,249 INFO L225 Difference]: With dead ends: 132 [2018-04-11 11:01:58,249 INFO L226 Difference]: Without dead ends: 132 [2018-04-11 11:01:58,249 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-11 11:01:58,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-11 11:01:58,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2018-04-11 11:01:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-11 11:01:58,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2018-04-11 11:01:58,253 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 30 [2018-04-11 11:01:58,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:01:58,253 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2018-04-11 11:01:58,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 11:01:58,253 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2018-04-11 11:01:58,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 11:01:58,253 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:01:58,253 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:01:58,254 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:01:58,254 INFO L82 PathProgramCache]: Analyzing trace with hash -565817711, now seen corresponding path program 1 times [2018-04-11 11:01:58,254 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:01:58,254 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:01:58,255 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:58,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:01:58,255 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:01:58,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:01:58,288 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 11:01:58,288 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:01:58,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 11:01:58,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 11:01:58,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 11:01:58,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:01:58,289 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand 5 states. [2018-04-11 11:01:58,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:01:58,389 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-04-11 11:01:58,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 11:01:58,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-04-11 11:01:58,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:01:58,390 INFO L225 Difference]: With dead ends: 124 [2018-04-11 11:01:58,391 INFO L226 Difference]: Without dead ends: 124 [2018-04-11 11:01:58,391 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 11:01:58,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-11 11:01:58,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-04-11 11:01:58,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-11 11:01:58,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-04-11 11:01:58,394 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 30 [2018-04-11 11:01:58,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:01:58,394 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-04-11 11:01:58,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 11:01:58,394 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-04-11 11:01:58,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 11:01:58,395 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:01:58,395 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:01:58,395 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:01:58,395 INFO L82 PathProgramCache]: Analyzing trace with hash -565817710, now seen corresponding path program 1 times [2018-04-11 11:01:58,395 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:01:58,395 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:01:58,396 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:58,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:01:58,396 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:01:58,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:01:58,479 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 11:01:58,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:01:58,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 11:01:58,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 11:01:58,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 11:01:58,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 11:01:58,481 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 6 states. [2018-04-11 11:01:58,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:01:58,595 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-04-11 11:01:58,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 11:01:58,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-04-11 11:01:58,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:01:58,595 INFO L225 Difference]: With dead ends: 131 [2018-04-11 11:01:58,595 INFO L226 Difference]: Without dead ends: 131 [2018-04-11 11:01:58,595 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-11 11:01:58,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-04-11 11:01:58,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2018-04-11 11:01:58,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 11:01:58,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2018-04-11 11:01:58,597 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 30 [2018-04-11 11:01:58,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:01:58,597 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2018-04-11 11:01:58,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 11:01:58,597 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2018-04-11 11:01:58,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 11:01:58,598 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:01:58,598 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:01:58,598 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:01:58,598 INFO L82 PathProgramCache]: Analyzing trace with hash -996161706, now seen corresponding path program 1 times [2018-04-11 11:01:58,598 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:01:58,598 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:01:58,599 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:58,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:01:58,599 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:01:58,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:01:58,667 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 11:01:58,667 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:01:58,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 11:01:58,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 11:01:58,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 11:01:58,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-04-11 11:01:58,668 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 9 states. [2018-04-11 11:01:58,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:01:58,874 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2018-04-11 11:01:58,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 11:01:58,874 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-04-11 11:01:58,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:01:58,875 INFO L225 Difference]: With dead ends: 141 [2018-04-11 11:01:58,875 INFO L226 Difference]: Without dead ends: 141 [2018-04-11 11:01:58,875 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-04-11 11:01:58,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-11 11:01:58,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 131. [2018-04-11 11:01:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-11 11:01:58,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2018-04-11 11:01:58,877 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 31 [2018-04-11 11:01:58,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:01:58,877 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2018-04-11 11:01:58,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 11:01:58,877 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2018-04-11 11:01:58,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 11:01:58,877 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:01:58,878 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:01:58,878 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:01:58,878 INFO L82 PathProgramCache]: Analyzing trace with hash -996161705, now seen corresponding path program 1 times [2018-04-11 11:01:58,878 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:01:58,878 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:01:58,878 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:58,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:01:58,878 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:01:58,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:01:58,988 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 11:01:58,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:01:58,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 11:01:58,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 11:01:58,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 11:01:58,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-11 11:01:58,989 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand 10 states. [2018-04-11 11:01:59,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:01:59,339 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2018-04-11 11:01:59,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 11:01:59,339 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-04-11 11:01:59,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:01:59,340 INFO L225 Difference]: With dead ends: 140 [2018-04-11 11:01:59,340 INFO L226 Difference]: Without dead ends: 140 [2018-04-11 11:01:59,341 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-04-11 11:01:59,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-04-11 11:01:59,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 126. [2018-04-11 11:01:59,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-11 11:01:59,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-04-11 11:01:59,344 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 31 [2018-04-11 11:01:59,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:01:59,344 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-04-11 11:01:59,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 11:01:59,344 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-04-11 11:01:59,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 11:01:59,344 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:01:59,344 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:01:59,344 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:01:59,344 INFO L82 PathProgramCache]: Analyzing trace with hash 73575908, now seen corresponding path program 1 times [2018-04-11 11:01:59,344 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:01:59,345 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:01:59,345 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:59,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:01:59,345 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:01:59,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:01:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:01:59,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:01:59,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 11:01:59,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 11:01:59,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 11:01:59,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 11:01:59,381 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 7 states. [2018-04-11 11:01:59,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:01:59,535 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2018-04-11 11:01:59,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 11:01:59,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-04-11 11:01:59,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:01:59,569 INFO L225 Difference]: With dead ends: 141 [2018-04-11 11:01:59,569 INFO L226 Difference]: Without dead ends: 141 [2018-04-11 11:01:59,569 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-11 11:01:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-11 11:01:59,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 131. [2018-04-11 11:01:59,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-11 11:01:59,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2018-04-11 11:01:59,572 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 33 [2018-04-11 11:01:59,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:01:59,572 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2018-04-11 11:01:59,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 11:01:59,572 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2018-04-11 11:01:59,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 11:01:59,572 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:01:59,573 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:01:59,573 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:01:59,573 INFO L82 PathProgramCache]: Analyzing trace with hash 73575909, now seen corresponding path program 1 times [2018-04-11 11:01:59,573 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:01:59,573 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:01:59,573 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:59,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:01:59,573 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:01:59,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:01:59,676 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 11:01:59,676 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:01:59,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 11:01:59,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 11:01:59,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 11:01:59,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 11:01:59,677 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand 9 states. [2018-04-11 11:01:59,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:01:59,987 INFO L93 Difference]: Finished difference Result 178 states and 195 transitions. [2018-04-11 11:01:59,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 11:01:59,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-04-11 11:01:59,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:01:59,988 INFO L225 Difference]: With dead ends: 178 [2018-04-11 11:01:59,988 INFO L226 Difference]: Without dead ends: 178 [2018-04-11 11:01:59,988 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-04-11 11:01:59,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-11 11:01:59,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 149. [2018-04-11 11:01:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-11 11:01:59,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 164 transitions. [2018-04-11 11:01:59,992 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 164 transitions. Word has length 33 [2018-04-11 11:01:59,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:01:59,992 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 164 transitions. [2018-04-11 11:01:59,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 11:01:59,992 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 164 transitions. [2018-04-11 11:01:59,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 11:01:59,993 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:01:59,993 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:01:59,993 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:01:59,993 INFO L82 PathProgramCache]: Analyzing trace with hash -550148662, now seen corresponding path program 1 times [2018-04-11 11:01:59,993 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:01:59,993 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:01:59,994 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:01:59,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:01:59,994 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:02:00,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:02:00,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 11:02:00,121 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:02:00,121 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:02:00,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:02:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:02:00,153 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:02:00,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:02:00,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 11:02:00,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:00,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:02:00,288 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:02:00,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 11:02:00,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:00,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:02:00,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-04-11 11:02:00,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:02:00,338 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:02:00,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2018-04-11 11:02:00,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 11:02:00,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 11:02:00,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-04-11 11:02:00,339 INFO L87 Difference]: Start difference. First operand 149 states and 164 transitions. Second operand 20 states. [2018-04-11 11:02:01,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:02:01,030 INFO L93 Difference]: Finished difference Result 206 states and 229 transitions. [2018-04-11 11:02:01,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 11:02:01,031 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2018-04-11 11:02:01,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:02:01,031 INFO L225 Difference]: With dead ends: 206 [2018-04-11 11:02:01,031 INFO L226 Difference]: Without dead ends: 206 [2018-04-11 11:02:01,032 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2018-04-11 11:02:01,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-04-11 11:02:01,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 137. [2018-04-11 11:02:01,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-11 11:02:01,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2018-04-11 11:02:01,036 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 147 transitions. Word has length 34 [2018-04-11 11:02:01,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:02:01,036 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 147 transitions. [2018-04-11 11:02:01,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 11:02:01,036 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2018-04-11 11:02:01,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 11:02:01,037 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:02:01,037 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:02:01,037 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:02:01,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1986047201, now seen corresponding path program 1 times [2018-04-11 11:02:01,037 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:02:01,037 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:02:01,038 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:01,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:02:01,038 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:02:01,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:02:01,102 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 11:02:01,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:02:01,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 11:02:01,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 11:02:01,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 11:02:01,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 11:02:01,103 INFO L87 Difference]: Start difference. First operand 137 states and 147 transitions. Second operand 8 states. [2018-04-11 11:02:01,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:02:01,252 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2018-04-11 11:02:01,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 11:02:01,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-04-11 11:02:01,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:02:01,253 INFO L225 Difference]: With dead ends: 164 [2018-04-11 11:02:01,253 INFO L226 Difference]: Without dead ends: 164 [2018-04-11 11:02:01,253 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-04-11 11:02:01,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-11 11:02:01,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 137. [2018-04-11 11:02:01,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-11 11:02:01,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 145 transitions. [2018-04-11 11:02:01,257 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 145 transitions. Word has length 35 [2018-04-11 11:02:01,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:02:01,258 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 145 transitions. [2018-04-11 11:02:01,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 11:02:01,258 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 145 transitions. [2018-04-11 11:02:01,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 11:02:01,258 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:02:01,258 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:02:01,258 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:02:01,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1466613884, now seen corresponding path program 1 times [2018-04-11 11:02:01,259 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:02:01,259 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:02:01,259 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:01,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:02:01,260 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:02:01,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:02:01,387 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 11:02:01,387 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:02:01,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 11:02:01,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 11:02:01,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 11:02:01,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-11 11:02:01,388 INFO L87 Difference]: Start difference. First operand 137 states and 145 transitions. Second operand 10 states. [2018-04-11 11:02:01,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:02:01,633 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2018-04-11 11:02:01,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 11:02:01,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-04-11 11:02:01,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:02:01,634 INFO L225 Difference]: With dead ends: 162 [2018-04-11 11:02:01,634 INFO L226 Difference]: Without dead ends: 162 [2018-04-11 11:02:01,635 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-04-11 11:02:01,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-11 11:02:01,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 140. [2018-04-11 11:02:01,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-04-11 11:02:01,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2018-04-11 11:02:01,638 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 36 [2018-04-11 11:02:01,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:02:01,638 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2018-04-11 11:02:01,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 11:02:01,638 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2018-04-11 11:02:01,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 11:02:01,639 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:02:01,639 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:02:01,639 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:02:01,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1466613883, now seen corresponding path program 1 times [2018-04-11 11:02:01,639 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:02:01,640 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:02:01,640 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:01,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:02:01,640 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:02:01,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:02:01,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:02:01,672 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:02:01,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 11:02:01,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 11:02:01,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 11:02:01,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:02:01,673 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand 5 states. [2018-04-11 11:02:01,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:02:01,813 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-04-11 11:02:01,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 11:02:01,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-04-11 11:02:01,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:02:01,813 INFO L225 Difference]: With dead ends: 139 [2018-04-11 11:02:01,814 INFO L226 Difference]: Without dead ends: 139 [2018-04-11 11:02:01,814 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 11:02:01,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-04-11 11:02:01,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-04-11 11:02:01,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-04-11 11:02:01,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 147 transitions. [2018-04-11 11:02:01,816 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 147 transitions. Word has length 36 [2018-04-11 11:02:01,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:02:01,816 INFO L459 AbstractCegarLoop]: Abstraction has 139 states and 147 transitions. [2018-04-11 11:02:01,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 11:02:01,816 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2018-04-11 11:02:01,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 11:02:01,816 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:02:01,816 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:02:01,816 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:02:01,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1151086149, now seen corresponding path program 1 times [2018-04-11 11:02:01,816 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:02:01,816 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:02:01,817 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:01,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:02:01,817 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:02:01,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:02:02,131 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:02:02,131 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:02:02,131 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:02:02,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:02:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:02:02,165 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:02:02,170 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 11:02:02,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:02,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:02,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 11:02:02,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 11:02:02,194 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 10 treesize of output 9 [2018-04-11 11:02:02,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:02,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:02,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 11:02:02,226 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 10 treesize of output 9 [2018-04-11 11:02:02,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:02,229 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:02,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:02,233 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:21 [2018-04-11 11:02:02,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 11:02:02,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-04-11 11:02:02,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:02,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:02,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-04-11 11:02:02,345 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 26 treesize of output 11 [2018-04-11 11:02:02,345 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:02,352 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:02,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:02,356 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:19 [2018-04-11 11:02:02,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:02:02,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:02:02,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-04-11 11:02:02,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 11:02:02,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 11:02:02,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-04-11 11:02:02,393 INFO L87 Difference]: Start difference. First operand 139 states and 147 transitions. Second operand 16 states. [2018-04-11 11:02:02,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:02:02,714 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2018-04-11 11:02:02,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 11:02:02,714 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-04-11 11:02:02,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:02:02,715 INFO L225 Difference]: With dead ends: 149 [2018-04-11 11:02:02,715 INFO L226 Difference]: Without dead ends: 149 [2018-04-11 11:02:02,715 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2018-04-11 11:02:02,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-04-11 11:02:02,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-04-11 11:02:02,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-11 11:02:02,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2018-04-11 11:02:02,718 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 37 [2018-04-11 11:02:02,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:02:02,718 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2018-04-11 11:02:02,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 11:02:02,718 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2018-04-11 11:02:02,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 11:02:02,718 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:02:02,719 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:02:02,719 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:02:02,719 INFO L82 PathProgramCache]: Analyzing trace with hash 722626987, now seen corresponding path program 1 times [2018-04-11 11:02:02,719 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:02:02,719 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:02:02,720 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:02,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:02:02,720 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:02:02,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:02:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:02:02,970 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:02:02,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-04-11 11:02:02,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 11:02:02,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 11:02:02,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-04-11 11:02:02,971 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand 17 states. [2018-04-11 11:02:03,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:02:03,725 INFO L93 Difference]: Finished difference Result 188 states and 201 transitions. [2018-04-11 11:02:03,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 11:02:03,725 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-04-11 11:02:03,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:02:03,726 INFO L225 Difference]: With dead ends: 188 [2018-04-11 11:02:03,726 INFO L226 Difference]: Without dead ends: 188 [2018-04-11 11:02:03,727 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=988, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 11:02:03,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-11 11:02:03,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 166. [2018-04-11 11:02:03,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-11 11:02:03,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 177 transitions. [2018-04-11 11:02:03,730 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 177 transitions. Word has length 40 [2018-04-11 11:02:03,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:02:03,730 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 177 transitions. [2018-04-11 11:02:03,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 11:02:03,730 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 177 transitions. [2018-04-11 11:02:03,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 11:02:03,731 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:02:03,731 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:02:03,731 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:02:03,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1316022877, now seen corresponding path program 1 times [2018-04-11 11:02:03,731 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:02:03,731 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:02:03,732 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:03,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:02:03,732 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:02:03,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:02:03,898 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 11:02:03,898 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:02:03,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-11 11:02:03,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 11:02:03,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 11:02:03,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-04-11 11:02:03,898 INFO L87 Difference]: Start difference. First operand 166 states and 177 transitions. Second operand 13 states. [2018-04-11 11:02:04,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:02:04,365 INFO L93 Difference]: Finished difference Result 205 states and 223 transitions. [2018-04-11 11:02:04,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 11:02:04,365 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-04-11 11:02:04,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:02:04,366 INFO L225 Difference]: With dead ends: 205 [2018-04-11 11:02:04,366 INFO L226 Difference]: Without dead ends: 205 [2018-04-11 11:02:04,366 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2018-04-11 11:02:04,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-11 11:02:04,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 175. [2018-04-11 11:02:04,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-04-11 11:02:04,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 188 transitions. [2018-04-11 11:02:04,370 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 188 transitions. Word has length 40 [2018-04-11 11:02:04,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:02:04,371 INFO L459 AbstractCegarLoop]: Abstraction has 175 states and 188 transitions. [2018-04-11 11:02:04,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 11:02:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 188 transitions. [2018-04-11 11:02:04,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 11:02:04,371 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:02:04,371 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:02:04,372 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:02:04,372 INFO L82 PathProgramCache]: Analyzing trace with hash 586362613, now seen corresponding path program 1 times [2018-04-11 11:02:04,372 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:02:04,372 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:02:04,372 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:04,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:02:04,373 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:02:04,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:02:04,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:02:04,443 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:02:04,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 11:02:04,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 11:02:04,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 11:02:04,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 11:02:04,443 INFO L87 Difference]: Start difference. First operand 175 states and 188 transitions. Second operand 8 states. [2018-04-11 11:02:04,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:02:04,519 INFO L93 Difference]: Finished difference Result 193 states and 207 transitions. [2018-04-11 11:02:04,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 11:02:04,519 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-04-11 11:02:04,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:02:04,520 INFO L225 Difference]: With dead ends: 193 [2018-04-11 11:02:04,521 INFO L226 Difference]: Without dead ends: 193 [2018-04-11 11:02:04,521 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-04-11 11:02:04,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-11 11:02:04,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 184. [2018-04-11 11:02:04,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-04-11 11:02:04,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 201 transitions. [2018-04-11 11:02:04,524 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 201 transitions. Word has length 44 [2018-04-11 11:02:04,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:02:04,524 INFO L459 AbstractCegarLoop]: Abstraction has 184 states and 201 transitions. [2018-04-11 11:02:04,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 11:02:04,524 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 201 transitions. [2018-04-11 11:02:04,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 11:02:04,524 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:02:04,524 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:02:04,525 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:02:04,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1176080644, now seen corresponding path program 1 times [2018-04-11 11:02:04,526 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:02:04,526 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:02:04,526 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:04,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:02:04,526 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:02:04,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:02:04,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:02:04,612 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:02:04,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 11:02:04,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 11:02:04,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 11:02:04,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-11 11:02:04,613 INFO L87 Difference]: Start difference. First operand 184 states and 201 transitions. Second operand 10 states. [2018-04-11 11:02:04,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:02:04,757 INFO L93 Difference]: Finished difference Result 192 states and 206 transitions. [2018-04-11 11:02:04,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 11:02:04,757 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-04-11 11:02:04,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:02:04,757 INFO L225 Difference]: With dead ends: 192 [2018-04-11 11:02:04,758 INFO L226 Difference]: Without dead ends: 192 [2018-04-11 11:02:04,758 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-04-11 11:02:04,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-04-11 11:02:04,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 174. [2018-04-11 11:02:04,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-04-11 11:02:04,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 189 transitions. [2018-04-11 11:02:04,760 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 189 transitions. Word has length 43 [2018-04-11 11:02:04,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:02:04,760 INFO L459 AbstractCegarLoop]: Abstraction has 174 states and 189 transitions. [2018-04-11 11:02:04,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 11:02:04,760 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 189 transitions. [2018-04-11 11:02:04,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 11:02:04,761 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:02:04,761 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:02:04,761 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:02:04,761 INFO L82 PathProgramCache]: Analyzing trace with hash 997371954, now seen corresponding path program 1 times [2018-04-11 11:02:04,761 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:02:04,761 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:02:04,762 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:04,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:02:04,762 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:02:04,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:02:04,797 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 11:02:04,797 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:02:04,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 11:02:04,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 11:02:04,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 11:02:04,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 11:02:04,798 INFO L87 Difference]: Start difference. First operand 174 states and 189 transitions. Second operand 6 states. [2018-04-11 11:02:04,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:02:04,882 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2018-04-11 11:02:04,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 11:02:04,883 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-04-11 11:02:04,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:02:04,883 INFO L225 Difference]: With dead ends: 184 [2018-04-11 11:02:04,883 INFO L226 Difference]: Without dead ends: 184 [2018-04-11 11:02:04,884 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-11 11:02:04,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-11 11:02:04,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 177. [2018-04-11 11:02:04,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-04-11 11:02:04,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 193 transitions. [2018-04-11 11:02:04,887 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 193 transitions. Word has length 45 [2018-04-11 11:02:04,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:02:04,887 INFO L459 AbstractCegarLoop]: Abstraction has 177 states and 193 transitions. [2018-04-11 11:02:04,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 11:02:04,887 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 193 transitions. [2018-04-11 11:02:04,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 11:02:04,887 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:02:04,887 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:02:04,887 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:02:04,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1923762637, now seen corresponding path program 1 times [2018-04-11 11:02:04,888 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:02:04,888 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:02:04,888 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:04,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:02:04,888 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:02:04,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:02:05,105 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 11:02:05,105 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:02:05,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-04-11 11:02:05,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 11:02:05,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 11:02:05,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-04-11 11:02:05,105 INFO L87 Difference]: Start difference. First operand 177 states and 193 transitions. Second operand 18 states. [2018-04-11 11:02:05,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:02:05,708 INFO L93 Difference]: Finished difference Result 229 states and 253 transitions. [2018-04-11 11:02:05,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 11:02:05,708 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-04-11 11:02:05,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:02:05,709 INFO L225 Difference]: With dead ends: 229 [2018-04-11 11:02:05,709 INFO L226 Difference]: Without dead ends: 229 [2018-04-11 11:02:05,709 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=1054, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 11:02:05,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-04-11 11:02:05,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 201. [2018-04-11 11:02:05,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-04-11 11:02:05,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 224 transitions. [2018-04-11 11:02:05,713 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 224 transitions. Word has length 47 [2018-04-11 11:02:05,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:02:05,713 INFO L459 AbstractCegarLoop]: Abstraction has 201 states and 224 transitions. [2018-04-11 11:02:05,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 11:02:05,714 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 224 transitions. [2018-04-11 11:02:05,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 11:02:05,714 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:02:05,714 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:02:05,714 INFO L408 AbstractCegarLoop]: === Iteration 35 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:02:05,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1923762636, now seen corresponding path program 1 times [2018-04-11 11:02:05,715 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:02:05,715 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:02:05,715 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:05,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:02:05,716 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:02:05,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:02:05,965 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 11:02:05,965 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:02:05,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-04-11 11:02:05,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 11:02:05,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 11:02:05,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-04-11 11:02:05,966 INFO L87 Difference]: Start difference. First operand 201 states and 224 transitions. Second operand 19 states. [2018-04-11 11:02:06,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:02:06,687 INFO L93 Difference]: Finished difference Result 250 states and 277 transitions. [2018-04-11 11:02:06,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 11:02:06,688 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-04-11 11:02:06,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:02:06,689 INFO L225 Difference]: With dead ends: 250 [2018-04-11 11:02:06,689 INFO L226 Difference]: Without dead ends: 250 [2018-04-11 11:02:06,689 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=1256, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 11:02:06,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-04-11 11:02:06,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 223. [2018-04-11 11:02:06,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-04-11 11:02:06,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 251 transitions. [2018-04-11 11:02:06,692 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 251 transitions. Word has length 47 [2018-04-11 11:02:06,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:02:06,692 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 251 transitions. [2018-04-11 11:02:06,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 11:02:06,692 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 251 transitions. [2018-04-11 11:02:06,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 11:02:06,693 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:02:06,693 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:02:06,693 INFO L408 AbstractCegarLoop]: === Iteration 36 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:02:06,693 INFO L82 PathProgramCache]: Analyzing trace with hash 124262969, now seen corresponding path program 1 times [2018-04-11 11:02:06,693 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:02:06,693 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:02:06,693 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:06,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:02:06,694 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:02:06,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:02:06,777 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 11:02:06,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:02:06,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 11:02:06,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 11:02:06,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 11:02:06,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-11 11:02:06,778 INFO L87 Difference]: Start difference. First operand 223 states and 251 transitions. Second operand 10 states. [2018-04-11 11:02:06,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:02:06,958 INFO L93 Difference]: Finished difference Result 242 states and 271 transitions. [2018-04-11 11:02:06,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 11:02:06,959 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-04-11 11:02:06,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:02:06,960 INFO L225 Difference]: With dead ends: 242 [2018-04-11 11:02:06,960 INFO L226 Difference]: Without dead ends: 242 [2018-04-11 11:02:06,960 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-04-11 11:02:06,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-11 11:02:06,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 234. [2018-04-11 11:02:06,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-11 11:02:06,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 264 transitions. [2018-04-11 11:02:06,963 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 264 transitions. Word has length 48 [2018-04-11 11:02:06,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:02:06,963 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 264 transitions. [2018-04-11 11:02:06,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 11:02:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 264 transitions. [2018-04-11 11:02:06,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 11:02:06,964 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:02:06,964 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:02:06,964 INFO L408 AbstractCegarLoop]: === Iteration 37 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:02:06,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1230859131, now seen corresponding path program 1 times [2018-04-11 11:02:06,964 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:02:06,964 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:02:06,964 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:06,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:02:06,965 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:02:06,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:02:06,983 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 11:02:06,983 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:02:06,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 11:02:06,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 11:02:06,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 11:02:06,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:02:06,984 INFO L87 Difference]: Start difference. First operand 234 states and 264 transitions. Second operand 5 states. [2018-04-11 11:02:07,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:02:07,038 INFO L93 Difference]: Finished difference Result 240 states and 270 transitions. [2018-04-11 11:02:07,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 11:02:07,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-04-11 11:02:07,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:02:07,039 INFO L225 Difference]: With dead ends: 240 [2018-04-11 11:02:07,039 INFO L226 Difference]: Without dead ends: 240 [2018-04-11 11:02:07,039 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 11:02:07,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-04-11 11:02:07,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 233. [2018-04-11 11:02:07,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-11 11:02:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 262 transitions. [2018-04-11 11:02:07,042 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 262 transitions. Word has length 50 [2018-04-11 11:02:07,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:02:07,042 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 262 transitions. [2018-04-11 11:02:07,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 11:02:07,042 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 262 transitions. [2018-04-11 11:02:07,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 11:02:07,043 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:02:07,043 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:02:07,043 INFO L408 AbstractCegarLoop]: === Iteration 38 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:02:07,043 INFO L82 PathProgramCache]: Analyzing trace with hash -498072556, now seen corresponding path program 1 times [2018-04-11 11:02:07,043 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:02:07,043 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:02:07,044 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:07,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:02:07,044 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:02:07,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:02:07,071 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 11:02:07,072 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:02:07,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 11:02:07,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 11:02:07,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 11:02:07,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:02:07,072 INFO L87 Difference]: Start difference. First operand 233 states and 262 transitions. Second operand 5 states. [2018-04-11 11:02:07,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:02:07,137 INFO L93 Difference]: Finished difference Result 239 states and 268 transitions. [2018-04-11 11:02:07,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 11:02:07,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-04-11 11:02:07,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:02:07,139 INFO L225 Difference]: With dead ends: 239 [2018-04-11 11:02:07,139 INFO L226 Difference]: Without dead ends: 239 [2018-04-11 11:02:07,139 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 11:02:07,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-04-11 11:02:07,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 232. [2018-04-11 11:02:07,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-04-11 11:02:07,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 260 transitions. [2018-04-11 11:02:07,144 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 260 transitions. Word has length 51 [2018-04-11 11:02:07,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:02:07,144 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 260 transitions. [2018-04-11 11:02:07,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 11:02:07,144 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 260 transitions. [2018-04-11 11:02:07,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 11:02:07,145 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:02:07,145 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:02:07,145 INFO L408 AbstractCegarLoop]: === Iteration 39 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:02:07,145 INFO L82 PathProgramCache]: Analyzing trace with hash 459154013, now seen corresponding path program 1 times [2018-04-11 11:02:07,145 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:02:07,145 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:02:07,146 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:07,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:02:07,146 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:02:07,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:02:07,560 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:02:07,560 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:02:07,561 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:02:07,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:02:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:02:07,588 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:02:07,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 11:02:07,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:02:07,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:07,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:07,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 11:02:07,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:02:07,607 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:07,608 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:07,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:07,611 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-04-11 11:02:07,773 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.base Int) (__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.offset Int) (|__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#t~ret14.offset| Int) (|__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#t~ret14.base| Int)) (let ((.cse1 (+ __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.offset 4))) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.base (store (store (select |c_old(#memory_$Pointer$.base)| __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.base) .cse1 (select (select |c_old(#memory_$Pointer$.base)| |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.base|) |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.offset|)) __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.offset |__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#t~ret14.base|)))) (store .cse0 |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.base| (store (select .cse0 |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.base|) |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.offset| __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.base)))) (<= __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.offset 0) (= (let ((.cse2 (store |c_old(#memory_$Pointer$.offset)| __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.base) .cse1 (select (select |c_old(#memory_$Pointer$.offset)| |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.base|) |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.offset|)) __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.offset |__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#t~ret14.offset|)))) (store .cse2 |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.base| (store (select .cse2 |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.base|) |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.offset| __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.offset))) |c_#memory_$Pointer$.offset|) (<= 0 __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.offset)))) is different from true [2018-04-11 11:02:07,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2018-04-11 11:02:07,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:02:07,864 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-04-11 11:02:07,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:02:07,867 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:02:07,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 46 [2018-04-11 11:02:07,869 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:07,877 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:07,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-04-11 11:02:07,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:02:07,891 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:02:07,893 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 21 treesize of output 32 [2018-04-11 11:02:07,893 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:07,898 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:07,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:07,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2018-04-11 11:02:07,916 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-04-11 11:02:07,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:02:07,920 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 20 treesize of output 27 [2018-04-11 11:02:07,921 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:07,926 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:07,942 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:02:07,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 41 [2018-04-11 11:02:07,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2018-04-11 11:02:07,946 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:07,952 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:07,960 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:07,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2018-04-11 11:02:07,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:02:07,998 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-04-11 11:02:08,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:02:08,002 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:02:08,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 46 [2018-04-11 11:02:08,004 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:08,011 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:08,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-04-11 11:02:08,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:02:08,023 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 21 treesize of output 23 [2018-04-11 11:02:08,023 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:08,027 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:08,031 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:08,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2018-04-11 11:02:08,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-04-11 11:02:08,040 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:02:08,042 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 20 treesize of output 27 [2018-04-11 11:02:08,042 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:08,045 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:08,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-04-11 11:02:08,057 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 25 treesize of output 23 [2018-04-11 11:02:08,057 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:08,061 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:08,065 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:08,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-11 11:02:08,085 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 6 variables, input treesize:114, output treesize:231 [2018-04-11 11:02:08,430 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 10 treesize of output 9 [2018-04-11 11:02:08,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:08,442 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 11:02:08,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:98, output treesize:97 [2018-04-11 11:02:08,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:02:08,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:02:08,492 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 15 treesize of output 8 [2018-04-11 11:02:08,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:08,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:02:08,506 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:02:08,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 77 [2018-04-11 11:02:08,515 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 64 treesize of output 58 [2018-04-11 11:02:08,515 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:08,520 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:08,531 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:02:08,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 75 [2018-04-11 11:02:08,534 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:02:08,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 90 [2018-04-11 11:02:08,535 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:08,541 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:08,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:02:08,550 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:118, output treesize:94 [2018-04-11 11:02:08,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 72 [2018-04-11 11:02:08,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 11:02:08,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:08,612 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:02:08,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 33 [2018-04-11 11:02:08,613 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:08,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:08,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-04-11 11:02:08,627 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:02:08,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 11:02:08,628 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:08,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 11:02:08,633 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:08,634 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:08,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:08,639 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:105, output treesize:10 [2018-04-11 11:02:08,675 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:02:08,708 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:02:08,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 36 [2018-04-11 11:02:08,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 11:02:08,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 11:02:08,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1049, Unknown=4, NotChecked=66, Total=1260 [2018-04-11 11:02:08,709 INFO L87 Difference]: Start difference. First operand 232 states and 260 transitions. Second operand 36 states. [2018-04-11 11:02:10,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:02:10,040 INFO L93 Difference]: Finished difference Result 252 states and 283 transitions. [2018-04-11 11:02:10,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 11:02:10,040 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 53 [2018-04-11 11:02:10,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:02:10,041 INFO L225 Difference]: With dead ends: 252 [2018-04-11 11:02:10,041 INFO L226 Difference]: Without dead ends: 252 [2018-04-11 11:02:10,042 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=279, Invalid=2169, Unknown=6, NotChecked=96, Total=2550 [2018-04-11 11:02:10,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-04-11 11:02:10,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 242. [2018-04-11 11:02:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-04-11 11:02:10,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 270 transitions. [2018-04-11 11:02:10,046 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 270 transitions. Word has length 53 [2018-04-11 11:02:10,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:02:10,046 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 270 transitions. [2018-04-11 11:02:10,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 11:02:10,047 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 270 transitions. [2018-04-11 11:02:10,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 11:02:10,047 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:02:10,048 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:02:10,048 INFO L408 AbstractCegarLoop]: === Iteration 40 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:02:10,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1135548646, now seen corresponding path program 1 times [2018-04-11 11:02:10,048 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:02:10,048 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:02:10,049 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:10,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:02:10,049 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:02:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:02:10,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:02:10,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:02:10,226 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:02:10,226 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:02:10,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:02:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:02:10,249 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:02:10,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 11:02:10,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:02:10,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:10,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:10,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:10,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:20 [2018-04-11 11:02:10,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-11 11:02:10,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:10,356 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 11:02:10,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:12 [2018-04-11 11:02:16,371 WARN L148 SmtUtils]: Spent 2002ms on a formula simplification that was a NOOP. DAG size: 12 [2018-04-11 11:02:16,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-04-11 11:02:16,406 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 27 treesize of output 18 [2018-04-11 11:02:16,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:02:16,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:16,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:02:16,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:23 [2018-04-11 11:02:16,474 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#list~0.base| Int) (|main_#t~mem20.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_~#list~0.base| 1))) (and (= 0 (select |c_old(#valid)| |main_~#list~0.base|)) (= (store (store .cse0 |main_#t~mem20.base| 0) |main_~#list~0.base| 0) |c_#valid|) (= 0 (select .cse0 |main_#t~mem20.base|))))) is different from true [2018-04-11 11:02:16,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:02:16,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:02:16,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 19 [2018-04-11 11:02:16,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 11:02:16,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 11:02:16,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=291, Unknown=6, NotChecked=34, Total=380 [2018-04-11 11:02:16,501 INFO L87 Difference]: Start difference. First operand 242 states and 270 transitions. Second operand 20 states. [2018-04-11 11:02:36,749 WARN L148 SmtUtils]: Spent 2005ms on a formula simplification that was a NOOP. DAG size: 18 [2018-04-11 11:03:18,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:03:18,543 INFO L93 Difference]: Finished difference Result 253 states and 282 transitions. [2018-04-11 11:03:18,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 11:03:18,544 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-04-11 11:03:18,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:03:18,544 INFO L225 Difference]: With dead ends: 253 [2018-04-11 11:03:18,544 INFO L226 Difference]: Without dead ends: 226 [2018-04-11 11:03:18,545 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=108, Invalid=643, Unknown=9, NotChecked=52, Total=812 [2018-04-11 11:03:18,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-04-11 11:03:18,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 219. [2018-04-11 11:03:18,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-04-11 11:03:18,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 246 transitions. [2018-04-11 11:03:18,547 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 246 transitions. Word has length 55 [2018-04-11 11:03:18,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:03:18,547 INFO L459 AbstractCegarLoop]: Abstraction has 219 states and 246 transitions. [2018-04-11 11:03:18,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 11:03:18,547 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 246 transitions. [2018-04-11 11:03:18,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-11 11:03:18,548 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:03:18,548 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:18,548 INFO L408 AbstractCegarLoop]: === Iteration 41 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:03:18,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1522120989, now seen corresponding path program 1 times [2018-04-11 11:03:18,548 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:03:18,548 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:03:18,549 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:03:18,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:03:18,549 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:03:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:03:18,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:03:18,840 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 11:03:18,840 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:03:18,840 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:03:18,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:03:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:03:18,878 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:03:18,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 11:03:18,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:03:18,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:18,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:03:18,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:03:18,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 11:03:18,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 11:03:18,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:03:18,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:18,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:03:19,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-04-11 11:03:19,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 11:03:19,013 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:19,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 35 [2018-04-11 11:03:19,029 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:03:19,039 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:03:19,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:03:19,050 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:37, output treesize:57 [2018-04-11 11:03:19,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:03:19,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:03:19,088 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 35 treesize of output 29 [2018-04-11 11:03:19,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:19,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:03:19,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:73, output treesize:29 [2018-04-11 11:03:19,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-04-11 11:03:19,120 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 21 treesize of output 13 [2018-04-11 11:03:19,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:19,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:03:19,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:03:19,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:29 [2018-04-11 11:03:19,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-04-11 11:03:19,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-04-11 11:03:19,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:19,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 11:03:19,185 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:19,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:03:19,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:03:19,187 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:33, output treesize:5 [2018-04-11 11:03:19,213 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:03:19,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:03:19,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 27 [2018-04-11 11:03:19,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 11:03:19,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 11:03:19,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2018-04-11 11:03:19,232 INFO L87 Difference]: Start difference. First operand 219 states and 246 transitions. Second operand 28 states. [2018-04-11 11:03:19,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:03:19,916 INFO L93 Difference]: Finished difference Result 263 states and 295 transitions. [2018-04-11 11:03:19,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 11:03:19,917 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 67 [2018-04-11 11:03:19,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:03:19,917 INFO L225 Difference]: With dead ends: 263 [2018-04-11 11:03:19,917 INFO L226 Difference]: Without dead ends: 263 [2018-04-11 11:03:19,918 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 54 SyntacticMatches, 9 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=2021, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 11:03:19,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-04-11 11:03:19,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 234. [2018-04-11 11:03:19,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-11 11:03:19,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 264 transitions. [2018-04-11 11:03:19,921 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 264 transitions. Word has length 67 [2018-04-11 11:03:19,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:03:19,921 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 264 transitions. [2018-04-11 11:03:19,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 11:03:19,921 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 264 transitions. [2018-04-11 11:03:19,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 11:03:19,922 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:03:19,922 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:03:19,922 INFO L408 AbstractCegarLoop]: === Iteration 42 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:03:19,922 INFO L82 PathProgramCache]: Analyzing trace with hash -562675973, now seen corresponding path program 1 times [2018-04-11 11:03:19,922 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:03:19,922 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:03:19,922 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:03:19,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:03:19,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:03:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:03:19,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:03:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 11:03:20,225 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:03:20,225 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:03:20,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:03:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:03:20,258 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:03:20,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 11:03:20,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:03:20,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:20,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:03:20,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 11:03:20,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:03:20,388 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:20,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:03:20,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:03:20,395 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-11 11:03:20,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-04-11 11:03:20,435 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 11:03:20,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:20,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2018-04-11 11:03:20,456 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 11:03:20,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:03:20,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-04-11 11:03:20,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 11:03:20,496 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:20,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2018-04-11 11:03:20,515 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 11:03:20,555 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:03:20,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 11:03:20,579 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:42, output treesize:139 [2018-04-11 11:03:20,623 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 11:03:20,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:20,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:03:20,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:03:20,633 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 15 treesize of output 8 [2018-04-11 11:03:20,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:20,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:03:20,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:42 [2018-04-11 11:03:20,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-04-11 11:03:20,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-04-11 11:03:20,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:20,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-04-11 11:03:20,750 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:03:20,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:03:20,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 11:03:20,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 11:03:20,763 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:03:20,766 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 11 treesize of output 3 [2018-04-11 11:03:20,766 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:20,767 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:03:20,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:03:20,769 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:69, output treesize:7 [2018-04-11 11:03:20,790 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:03:20,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:03:20,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 27 [2018-04-11 11:03:20,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 11:03:20,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 11:03:20,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=627, Unknown=2, NotChecked=0, Total=702 [2018-04-11 11:03:20,808 INFO L87 Difference]: Start difference. First operand 234 states and 264 transitions. Second operand 27 states. [2018-04-11 11:03:21,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:03:21,529 INFO L93 Difference]: Finished difference Result 256 states and 286 transitions. [2018-04-11 11:03:21,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 11:03:21,529 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 60 [2018-04-11 11:03:21,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:03:21,530 INFO L225 Difference]: With dead ends: 256 [2018-04-11 11:03:21,530 INFO L226 Difference]: Without dead ends: 256 [2018-04-11 11:03:21,530 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 47 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=251, Invalid=2003, Unknown=2, NotChecked=0, Total=2256 [2018-04-11 11:03:21,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-04-11 11:03:21,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 238. [2018-04-11 11:03:21,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-11 11:03:21,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 266 transitions. [2018-04-11 11:03:21,533 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 266 transitions. Word has length 60 [2018-04-11 11:03:21,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:03:21,533 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 266 transitions. [2018-04-11 11:03:21,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 11:03:21,533 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 266 transitions. [2018-04-11 11:03:21,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-11 11:03:21,534 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:03:21,534 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:21,534 INFO L408 AbstractCegarLoop]: === Iteration 43 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:03:21,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1522120988, now seen corresponding path program 1 times [2018-04-11 11:03:21,534 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:03:21,534 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:03:21,534 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:03:21,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:03:21,534 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:03:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:03:21,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:03:21,869 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 11:03:21,869 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:03:21,870 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:03:21,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:03:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:03:21,963 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:03:22,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 11:03:22,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:03:22,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:22,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:03:22,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 11:03:22,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:03:22,196 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:22,199 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:03:22,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:03:22,206 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2018-04-11 11:03:22,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-04-11 11:03:22,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 11:03:22,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:22,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2018-04-11 11:03:22,262 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:03:22,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:03:22,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-04-11 11:03:22,294 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 11:03:22,294 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:22,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2018-04-11 11:03:22,329 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 11:03:22,340 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:03:22,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 11:03:22,357 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:44, output treesize:153 [2018-04-11 11:03:22,414 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 11:03:22,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:22,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:03:22,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:03:22,421 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 15 treesize of output 8 [2018-04-11 11:03:22,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:22,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:03:22,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:88, output treesize:44 [2018-04-11 11:03:22,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2018-04-11 11:03:22,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-04-11 11:03:22,485 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:03:22,490 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 21 treesize of output 5 [2018-04-11 11:03:22,490 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:22,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:03:22,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 11:03:22,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 11:03:22,500 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:22,503 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:03:22,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:03:22,505 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:71, output treesize:9 [2018-04-11 11:03:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:03:22,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:03:22,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 35 [2018-04-11 11:03:22,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 11:03:22,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 11:03:22,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1166, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 11:03:22,587 INFO L87 Difference]: Start difference. First operand 238 states and 266 transitions. Second operand 36 states. [2018-04-11 11:03:24,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:03:24,471 INFO L93 Difference]: Finished difference Result 326 states and 360 transitions. [2018-04-11 11:03:24,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-11 11:03:24,471 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2018-04-11 11:03:24,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:03:24,472 INFO L225 Difference]: With dead ends: 326 [2018-04-11 11:03:24,472 INFO L226 Difference]: Without dead ends: 326 [2018-04-11 11:03:24,473 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1132 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=405, Invalid=4707, Unknown=0, NotChecked=0, Total=5112 [2018-04-11 11:03:24,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-04-11 11:03:24,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 273. [2018-04-11 11:03:24,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-04-11 11:03:24,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 304 transitions. [2018-04-11 11:03:24,476 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 304 transitions. Word has length 67 [2018-04-11 11:03:24,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:03:24,477 INFO L459 AbstractCegarLoop]: Abstraction has 273 states and 304 transitions. [2018-04-11 11:03:24,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 11:03:24,477 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 304 transitions. [2018-04-11 11:03:24,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 11:03:24,477 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:03:24,477 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:03:24,477 INFO L408 AbstractCegarLoop]: === Iteration 44 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:03:24,477 INFO L82 PathProgramCache]: Analyzing trace with hash -363478814, now seen corresponding path program 1 times [2018-04-11 11:03:24,477 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:03:24,477 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:03:24,478 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:03:24,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:03:24,478 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:03:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:03:24,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:03:24,505 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-04-11 11:03:24,506 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:03:24,506 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:03:24,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:03:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:03:24,538 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:03:24,549 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-04-11 11:03:24,566 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:03:24,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-04-11 11:03:24,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 11:03:24,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 11:03:24,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-11 11:03:24,567 INFO L87 Difference]: Start difference. First operand 273 states and 304 transitions. Second operand 7 states. [2018-04-11 11:03:24,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:03:24,579 INFO L93 Difference]: Finished difference Result 285 states and 316 transitions. [2018-04-11 11:03:24,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 11:03:24,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-04-11 11:03:24,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:03:24,580 INFO L225 Difference]: With dead ends: 285 [2018-04-11 11:03:24,580 INFO L226 Difference]: Without dead ends: 285 [2018-04-11 11:03:24,581 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-11 11:03:24,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-04-11 11:03:24,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 280. [2018-04-11 11:03:24,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-04-11 11:03:24,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 311 transitions. [2018-04-11 11:03:24,588 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 311 transitions. Word has length 74 [2018-04-11 11:03:24,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:03:24,588 INFO L459 AbstractCegarLoop]: Abstraction has 280 states and 311 transitions. [2018-04-11 11:03:24,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 11:03:24,588 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 311 transitions. [2018-04-11 11:03:24,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 11:03:24,589 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:03:24,589 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:24,589 INFO L408 AbstractCegarLoop]: === Iteration 45 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:03:24,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1382711762, now seen corresponding path program 1 times [2018-04-11 11:03:24,589 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:03:24,589 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:03:24,589 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:03:24,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:03:24,590 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:03:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:03:24,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:03:24,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:03:24,997 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:03:24,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-04-11 11:03:24,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 11:03:24,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 11:03:24,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-04-11 11:03:24,997 INFO L87 Difference]: Start difference. First operand 280 states and 311 transitions. Second operand 20 states. [2018-04-11 11:03:25,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:03:25,653 INFO L93 Difference]: Finished difference Result 316 states and 350 transitions. [2018-04-11 11:03:25,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 11:03:25,653 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-04-11 11:03:25,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:03:25,654 INFO L225 Difference]: With dead ends: 316 [2018-04-11 11:03:25,654 INFO L226 Difference]: Without dead ends: 316 [2018-04-11 11:03:25,654 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 11:03:25,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-04-11 11:03:25,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 293. [2018-04-11 11:03:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-04-11 11:03:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 325 transitions. [2018-04-11 11:03:25,659 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 325 transitions. Word has length 55 [2018-04-11 11:03:25,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:03:25,659 INFO L459 AbstractCegarLoop]: Abstraction has 293 states and 325 transitions. [2018-04-11 11:03:25,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 11:03:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 325 transitions. [2018-04-11 11:03:25,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 11:03:25,660 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:03:25,660 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:25,660 INFO L408 AbstractCegarLoop]: === Iteration 46 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:03:25,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1943956119, now seen corresponding path program 1 times [2018-04-11 11:03:25,661 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:03:25,661 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:03:25,661 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:03:25,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:03:25,661 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:03:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:03:25,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:03:25,719 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 11:03:25,719 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:03:25,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 11:03:25,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 11:03:25,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 11:03:25,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-11 11:03:25,719 INFO L87 Difference]: Start difference. First operand 293 states and 325 transitions. Second operand 6 states. [2018-04-11 11:03:25,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:03:25,819 INFO L93 Difference]: Finished difference Result 292 states and 321 transitions. [2018-04-11 11:03:25,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 11:03:25,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-04-11 11:03:25,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:03:25,820 INFO L225 Difference]: With dead ends: 292 [2018-04-11 11:03:25,820 INFO L226 Difference]: Without dead ends: 292 [2018-04-11 11:03:25,820 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 11:03:25,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-04-11 11:03:25,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 290. [2018-04-11 11:03:25,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-04-11 11:03:25,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 318 transitions. [2018-04-11 11:03:25,823 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 318 transitions. Word has length 55 [2018-04-11 11:03:25,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:03:25,823 INFO L459 AbstractCegarLoop]: Abstraction has 290 states and 318 transitions. [2018-04-11 11:03:25,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 11:03:25,823 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 318 transitions. [2018-04-11 11:03:25,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 11:03:25,823 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:03:25,823 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:25,823 INFO L408 AbstractCegarLoop]: === Iteration 47 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:03:25,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1641106482, now seen corresponding path program 1 times [2018-04-11 11:03:25,824 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:03:25,824 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:03:25,824 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:03:25,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:03:25,824 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:03:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:03:25,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:03:26,148 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 11:03:26,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:03:26,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-04-11 11:03:26,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 11:03:26,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 11:03:26,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-04-11 11:03:26,149 INFO L87 Difference]: Start difference. First operand 290 states and 318 transitions. Second operand 19 states. [2018-04-11 11:03:26,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:03:26,683 INFO L93 Difference]: Finished difference Result 314 states and 344 transitions. [2018-04-11 11:03:26,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 11:03:26,683 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2018-04-11 11:03:26,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:03:26,684 INFO L225 Difference]: With dead ends: 314 [2018-04-11 11:03:26,684 INFO L226 Difference]: Without dead ends: 314 [2018-04-11 11:03:26,685 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2018-04-11 11:03:26,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-04-11 11:03:26,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 282. [2018-04-11 11:03:26,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-04-11 11:03:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 310 transitions. [2018-04-11 11:03:26,687 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 310 transitions. Word has length 57 [2018-04-11 11:03:26,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:03:26,688 INFO L459 AbstractCegarLoop]: Abstraction has 282 states and 310 transitions. [2018-04-11 11:03:26,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 11:03:26,688 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 310 transitions. [2018-04-11 11:03:26,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 11:03:26,688 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:03:26,688 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:03:26,688 INFO L408 AbstractCegarLoop]: === Iteration 48 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:03:26,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1817611563, now seen corresponding path program 1 times [2018-04-11 11:03:26,688 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:03:26,689 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:03:26,689 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:03:26,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:03:26,689 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:03:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:03:26,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:03:27,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:03:27,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:03:27,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-04-11 11:03:27,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 11:03:27,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 11:03:27,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-04-11 11:03:27,029 INFO L87 Difference]: Start difference. First operand 282 states and 310 transitions. Second operand 21 states. [2018-04-11 11:03:27,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:03:27,604 INFO L93 Difference]: Finished difference Result 320 states and 347 transitions. [2018-04-11 11:03:27,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 11:03:27,605 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2018-04-11 11:03:27,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:03:27,605 INFO L225 Difference]: With dead ends: 320 [2018-04-11 11:03:27,606 INFO L226 Difference]: Without dead ends: 309 [2018-04-11 11:03:27,606 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=1220, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 11:03:27,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-04-11 11:03:27,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 289. [2018-04-11 11:03:27,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-04-11 11:03:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 315 transitions. [2018-04-11 11:03:27,610 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 315 transitions. Word has length 60 [2018-04-11 11:03:27,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:03:27,610 INFO L459 AbstractCegarLoop]: Abstraction has 289 states and 315 transitions. [2018-04-11 11:03:27,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 11:03:27,610 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 315 transitions. [2018-04-11 11:03:27,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 11:03:27,611 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:03:27,611 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:27,611 INFO L408 AbstractCegarLoop]: === Iteration 49 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:03:27,611 INFO L82 PathProgramCache]: Analyzing trace with hash 763384283, now seen corresponding path program 1 times [2018-04-11 11:03:27,611 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:03:27,611 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:03:27,612 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:03:27,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:03:27,612 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:03:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:03:27,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:03:28,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:03:28,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:03:28,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-04-11 11:03:28,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 11:03:28,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 11:03:28,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2018-04-11 11:03:28,090 INFO L87 Difference]: Start difference. First operand 289 states and 315 transitions. Second operand 26 states. [2018-04-11 11:03:28,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:03:28,842 INFO L93 Difference]: Finished difference Result 308 states and 334 transitions. [2018-04-11 11:03:28,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 11:03:28,843 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 60 [2018-04-11 11:03:28,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:03:28,843 INFO L225 Difference]: With dead ends: 308 [2018-04-11 11:03:28,843 INFO L226 Difference]: Without dead ends: 308 [2018-04-11 11:03:28,844 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=188, Invalid=1452, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 11:03:28,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-04-11 11:03:28,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 289. [2018-04-11 11:03:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-04-11 11:03:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 313 transitions. [2018-04-11 11:03:28,846 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 313 transitions. Word has length 60 [2018-04-11 11:03:28,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:03:28,846 INFO L459 AbstractCegarLoop]: Abstraction has 289 states and 313 transitions. [2018-04-11 11:03:28,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 11:03:28,847 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 313 transitions. [2018-04-11 11:03:28,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 11:03:28,847 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:03:28,847 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:28,847 INFO L408 AbstractCegarLoop]: === Iteration 50 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:03:28,847 INFO L82 PathProgramCache]: Analyzing trace with hash 897208251, now seen corresponding path program 1 times [2018-04-11 11:03:28,847 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:03:28,847 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:03:28,848 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:03:28,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:03:28,848 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:03:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:03:28,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:03:28,873 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:03:28,873 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:03:28,874 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:03:28,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:03:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:03:28,901 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:03:28,908 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:03:28,926 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:03:28,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-04-11 11:03:28,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 11:03:28,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 11:03:28,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-04-11 11:03:28,927 INFO L87 Difference]: Start difference. First operand 289 states and 313 transitions. Second operand 8 states. [2018-04-11 11:03:28,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:03:28,944 INFO L93 Difference]: Finished difference Result 301 states and 325 transitions. [2018-04-11 11:03:28,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 11:03:28,944 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-04-11 11:03:28,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:03:28,945 INFO L225 Difference]: With dead ends: 301 [2018-04-11 11:03:28,945 INFO L226 Difference]: Without dead ends: 301 [2018-04-11 11:03:28,946 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-04-11 11:03:28,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-04-11 11:03:28,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 296. [2018-04-11 11:03:28,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-04-11 11:03:28,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 320 transitions. [2018-04-11 11:03:28,950 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 320 transitions. Word has length 61 [2018-04-11 11:03:28,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:03:28,950 INFO L459 AbstractCegarLoop]: Abstraction has 296 states and 320 transitions. [2018-04-11 11:03:28,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 11:03:28,950 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 320 transitions. [2018-04-11 11:03:28,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 11:03:28,951 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:03:28,951 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:28,951 INFO L408 AbstractCegarLoop]: === Iteration 51 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:03:28,951 INFO L82 PathProgramCache]: Analyzing trace with hash -827109317, now seen corresponding path program 1 times [2018-04-11 11:03:28,951 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:03:28,951 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:03:28,952 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:03:28,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:03:28,952 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:03:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:03:28,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:03:29,446 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 11:03:29,446 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:03:29,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-04-11 11:03:29,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 11:03:29,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 11:03:29,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2018-04-11 11:03:29,447 INFO L87 Difference]: Start difference. First operand 296 states and 320 transitions. Second operand 25 states. [2018-04-11 11:03:30,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:03:30,163 INFO L93 Difference]: Finished difference Result 314 states and 339 transitions. [2018-04-11 11:03:30,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 11:03:30,163 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 62 [2018-04-11 11:03:30,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:03:30,164 INFO L225 Difference]: With dead ends: 314 [2018-04-11 11:03:30,164 INFO L226 Difference]: Without dead ends: 314 [2018-04-11 11:03:30,165 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=1525, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 11:03:30,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-04-11 11:03:30,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 274. [2018-04-11 11:03:30,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-04-11 11:03:30,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 296 transitions. [2018-04-11 11:03:30,169 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 296 transitions. Word has length 62 [2018-04-11 11:03:30,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:03:30,169 INFO L459 AbstractCegarLoop]: Abstraction has 274 states and 296 transitions. [2018-04-11 11:03:30,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 11:03:30,169 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 296 transitions. [2018-04-11 11:03:30,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-04-11 11:03:30,170 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:03:30,170 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:30,170 INFO L408 AbstractCegarLoop]: === Iteration 52 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:03:30,170 INFO L82 PathProgramCache]: Analyzing trace with hash 560414577, now seen corresponding path program 1 times [2018-04-11 11:03:30,170 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:03:30,170 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:03:30,175 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:03:30,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:03:30,175 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:03:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:03:30,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:03:30,262 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 11:03:30,263 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:03:30,263 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:03:30,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:03:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:03:30,299 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:03:30,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 11:03:30,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:03:30,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:30,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:03:30,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:03:30,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-11 11:03:30,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:03:30,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:03:30,341 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 15 treesize of output 8 [2018-04-11 11:03:30,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:30,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:03:30,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-04-11 11:03:30,387 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 5 treesize of output 1 [2018-04-11 11:03:30,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:30,395 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 11:03:30,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:12 [2018-04-11 11:03:36,411 WARN L148 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 12 [2018-04-11 11:03:36,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-11 11:03:36,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-11 11:03:36,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:36,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:03:36,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:03:36,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-04-11 11:03:36,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:03:36,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 11:03:36,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:03:36,441 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 11:03:36,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-11 11:03:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:03:36,488 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:03:36,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 17 [2018-04-11 11:03:36,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 11:03:36,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 11:03:36,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=255, Unknown=2, NotChecked=0, Total=306 [2018-04-11 11:03:36,489 INFO L87 Difference]: Start difference. First operand 274 states and 296 transitions. Second operand 18 states. [2018-04-11 11:04:04,702 WARN L148 SmtUtils]: Spent 2004ms on a formula simplification that was a NOOP. DAG size: 16 [2018-04-11 11:04:08,719 WARN L148 SmtUtils]: Spent 2006ms on a formula simplification that was a NOOP. DAG size: 21 [2018-04-11 11:04:45,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:04:45,080 INFO L93 Difference]: Finished difference Result 316 states and 339 transitions. [2018-04-11 11:04:45,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 11:04:45,080 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 75 [2018-04-11 11:04:45,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:04:45,081 INFO L225 Difference]: With dead ends: 316 [2018-04-11 11:04:45,081 INFO L226 Difference]: Without dead ends: 305 [2018-04-11 11:04:45,081 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=150, Invalid=773, Unknown=7, NotChecked=0, Total=930 [2018-04-11 11:04:45,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-11 11:04:45,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 204. [2018-04-11 11:04:45,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-04-11 11:04:45,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 218 transitions. [2018-04-11 11:04:45,085 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 218 transitions. Word has length 75 [2018-04-11 11:04:45,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:04:45,085 INFO L459 AbstractCegarLoop]: Abstraction has 204 states and 218 transitions. [2018-04-11 11:04:45,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 11:04:45,085 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 218 transitions. [2018-04-11 11:04:45,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 11:04:45,086 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:04:45,086 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:04:45,086 INFO L408 AbstractCegarLoop]: === Iteration 53 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:04:45,086 INFO L82 PathProgramCache]: Analyzing trace with hash 689621497, now seen corresponding path program 1 times [2018-04-11 11:04:45,086 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:04:45,086 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:04:45,087 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:04:45,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:04:45,087 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:04:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:04:45,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:04:45,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:04:45,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:04:45,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-04-11 11:04:45,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 11:04:45,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 11:04:45,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2018-04-11 11:04:45,600 INFO L87 Difference]: Start difference. First operand 204 states and 218 transitions. Second operand 24 states. [2018-04-11 11:04:46,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:04:46,434 INFO L93 Difference]: Finished difference Result 240 states and 258 transitions. [2018-04-11 11:04:46,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 11:04:46,446 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 65 [2018-04-11 11:04:46,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:04:46,447 INFO L225 Difference]: With dead ends: 240 [2018-04-11 11:04:46,447 INFO L226 Difference]: Without dead ends: 233 [2018-04-11 11:04:46,448 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=211, Invalid=1859, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 11:04:46,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-11 11:04:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 213. [2018-04-11 11:04:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-11 11:04:46,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 228 transitions. [2018-04-11 11:04:46,451 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 228 transitions. Word has length 65 [2018-04-11 11:04:46,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:04:46,451 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 228 transitions. [2018-04-11 11:04:46,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 11:04:46,451 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 228 transitions. [2018-04-11 11:04:46,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-11 11:04:46,451 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:04:46,452 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:04:46,452 INFO L408 AbstractCegarLoop]: === Iteration 54 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:04:46,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1592487693, now seen corresponding path program 1 times [2018-04-11 11:04:46,452 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:04:46,452 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:04:46,452 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:04:46,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:04:46,452 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:04:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:04:46,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:04:47,056 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:04:47,057 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:04:47,057 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:04:47,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:04:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:04:47,087 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:04:47,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 11:04:47,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:04:47,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:47,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:47,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:47,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-11 11:04:47,422 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.base Int) (|__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#t~ret14.base| Int)) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.base (store (store (select |c_old(#memory_$Pointer$.base)| __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.base) 4 (select (select |c_old(#memory_$Pointer$.base)| |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.base|) |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.offset|)) 0 |__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#t~ret14.base|)))) (store .cse0 |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.base| (store (select .cse0 |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.base|) |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.offset| __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.base)))) (= (select |c_old(#valid)| __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.base 1)))) is different from true [2018-04-11 11:04:47,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:04:47,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:04:47,443 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 21 treesize of output 33 [2018-04-11 11:04:47,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:47,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 47 [2018-04-11 11:04:47,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:04:47,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-04-11 11:04:47,467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2018-04-11 11:04:47,468 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:47,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:47,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-04-11 11:04:47,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:04:47,484 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 27 treesize of output 29 [2018-04-11 11:04:47,485 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:47,489 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:47,492 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:47,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2018-04-11 11:04:47,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-04-11 11:04:47,500 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 18 treesize of output 19 [2018-04-11 11:04:47,500 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:47,503 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:47,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:04:47,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2018-04-11 11:04:47,515 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 31 treesize of output 25 [2018-04-11 11:04:47,515 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:47,520 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:47,525 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:47,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:04:47,545 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:65, output treesize:84 [2018-04-11 11:04:47,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-04-11 11:04:47,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:47,705 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 11:04:47,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:20 [2018-04-11 11:04:47,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-04-11 11:04:47,766 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 21 treesize of output 13 [2018-04-11 11:04:47,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:47,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:47,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:47,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:62 [2018-04-11 11:04:47,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:04:47,845 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 33 treesize of output 53 [2018-04-11 11:04:47,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:47,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:47,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:37 [2018-04-11 11:04:47,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:04:47,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:04:47,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 50 [2018-04-11 11:04:47,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2018-04-11 11:04:47,884 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:04:47,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:04:47,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:04:47,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:34 [2018-04-11 11:04:47,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:04:47,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-04-11 11:04:47,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 11:04:47,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:47,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 11:04:47,948 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:47,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:47,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:04:47,952 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:16 [2018-04-11 11:04:47,993 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-11 11:04:48,012 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:04:48,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 39 [2018-04-11 11:04:48,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-11 11:04:48,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-11 11:04:48,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1340, Unknown=4, NotChecked=74, Total=1560 [2018-04-11 11:04:48,013 INFO L87 Difference]: Start difference. First operand 213 states and 228 transitions. Second operand 40 states. [2018-04-11 11:04:51,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:04:51,650 INFO L93 Difference]: Finished difference Result 256 states and 279 transitions. [2018-04-11 11:04:51,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 11:04:51,651 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 73 [2018-04-11 11:04:51,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:04:51,652 INFO L225 Difference]: With dead ends: 256 [2018-04-11 11:04:51,652 INFO L226 Difference]: Without dead ends: 256 [2018-04-11 11:04:51,652 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=372, Invalid=3654, Unknown=10, NotChecked=124, Total=4160 [2018-04-11 11:04:51,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-04-11 11:04:51,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 225. [2018-04-11 11:04:51,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-04-11 11:04:51,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 242 transitions. [2018-04-11 11:04:51,655 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 242 transitions. Word has length 73 [2018-04-11 11:04:51,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:04:51,655 INFO L459 AbstractCegarLoop]: Abstraction has 225 states and 242 transitions. [2018-04-11 11:04:51,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-11 11:04:51,655 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 242 transitions. [2018-04-11 11:04:51,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-11 11:04:51,656 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:04:51,656 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:04:51,656 INFO L408 AbstractCegarLoop]: === Iteration 55 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:04:51,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1592487694, now seen corresponding path program 1 times [2018-04-11 11:04:51,656 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:04:51,657 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:04:51,657 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:04:51,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:04:51,657 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:04:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:04:51,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:04:52,598 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:04:52,598 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:04:52,598 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:04:52,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:04:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:04:52,632 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:04:52,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 11:04:52,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:04:52,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:52,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:52,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 11:04:52,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:04:52,776 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:52,778 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:52,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:52,784 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-04-11 11:04:53,069 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.base Int) (|__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#t~ret14.offset| Int) (|__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#t~ret14.base| Int)) (and (= |c_#length| (store |c_old(#length)| __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.base 8)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.base (store (store (select |c_old(#memory_$Pointer$.base)| __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.base) 4 (select (select |c_old(#memory_$Pointer$.base)| |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.base|) |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.offset|)) 0 |__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#t~ret14.base|)))) (store .cse0 |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.base| (store (select .cse0 |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.base|) |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.offset| __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.base)))) (= (select |c_old(#valid)| __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.base) 0) (= |c_#memory_$Pointer$.offset| (let ((.cse1 (store |c_old(#memory_$Pointer$.offset)| __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.base) 4 (select (select |c_old(#memory_$Pointer$.offset)| |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.base|) |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.offset|)) 0 |__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#t~ret14.offset|)))) (store .cse1 |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.base| (store (select .cse1 |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.base|) |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.offset| 0)))))) is different from true [2018-04-11 11:04:53,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:04:53,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:04:53,153 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 15 treesize of output 8 [2018-04-11 11:04:53,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 11:04:53,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 47 [2018-04-11 11:04:53,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:04:53,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-04-11 11:04:53,302 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2018-04-11 11:04:53,303 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,310 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-04-11 11:04:53,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:04:53,325 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 27 treesize of output 29 [2018-04-11 11:04:53,325 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,329 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,336 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2018-04-11 11:04:53,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-04-11 11:04:53,348 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 18 treesize of output 19 [2018-04-11 11:04:53,348 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,352 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:04:53,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2018-04-11 11:04:53,370 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 31 treesize of output 25 [2018-04-11 11:04:53,370 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,376 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,383 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-04-11 11:04:53,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:04:53,418 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-04-11 11:04:53,421 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 33 treesize of output 33 [2018-04-11 11:04:53,421 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,425 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-04-11 11:04:53,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:04:53,434 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 19 treesize of output 19 [2018-04-11 11:04:53,434 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,437 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,440 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 38 [2018-04-11 11:04:53,448 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-04-11 11:04:53,451 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 18 treesize of output 19 [2018-04-11 11:04:53,451 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,454 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,461 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:04:53,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2018-04-11 11:04:53,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 11:04:53,464 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,468 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,472 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 11:04:53,492 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:122, output treesize:254 [2018-04-11 11:04:53,828 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 10 treesize of output 9 [2018-04-11 11:04:53,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:112, output treesize:111 [2018-04-11 11:04:53,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:04:53,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:04:53,903 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 15 treesize of output 8 [2018-04-11 11:04:53,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:04:53,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 117 [2018-04-11 11:04:53,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 97 [2018-04-11 11:04:53,928 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:04:53,945 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:04:53,956 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:04:53,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 77 [2018-04-11 11:04:53,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 84 [2018-04-11 11:04:53,959 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,965 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:53,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:04:53,981 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:132, output treesize:81 [2018-04-11 11:04:54,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2018-04-11 11:04:54,030 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:04:54,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2018-04-11 11:04:54,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:54,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 11:04:54,036 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:54,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:54,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-04-11 11:04:54,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 11:04:54,049 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:54,052 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:04:54,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2018-04-11 11:04:54,052 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:54,054 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:54,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:04:54,058 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:92, output treesize:18 [2018-04-11 11:04:54,115 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-11 11:04:54,132 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:04:54,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28] total 47 [2018-04-11 11:04:54,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-11 11:04:54,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-11 11:04:54,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1950, Unknown=10, NotChecked=90, Total=2256 [2018-04-11 11:04:54,133 INFO L87 Difference]: Start difference. First operand 225 states and 242 transitions. Second operand 48 states. [2018-04-11 11:04:54,727 WARN L151 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 101 DAG size of output 75 [2018-04-11 11:04:56,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:04:56,460 INFO L93 Difference]: Finished difference Result 296 states and 327 transitions. [2018-04-11 11:04:56,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-11 11:04:56,461 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 73 [2018-04-11 11:04:56,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:04:56,461 INFO L225 Difference]: With dead ends: 296 [2018-04-11 11:04:56,462 INFO L226 Difference]: Without dead ends: 296 [2018-04-11 11:04:56,462 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1933 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=595, Invalid=5393, Unknown=22, NotChecked=152, Total=6162 [2018-04-11 11:04:56,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-04-11 11:04:56,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 254. [2018-04-11 11:04:56,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-04-11 11:04:56,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 276 transitions. [2018-04-11 11:04:56,465 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 276 transitions. Word has length 73 [2018-04-11 11:04:56,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:04:56,465 INFO L459 AbstractCegarLoop]: Abstraction has 254 states and 276 transitions. [2018-04-11 11:04:56,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-11 11:04:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 276 transitions. [2018-04-11 11:04:56,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-04-11 11:04:56,466 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:04:56,466 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:04:56,467 INFO L408 AbstractCegarLoop]: === Iteration 56 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:04:56,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1288339126, now seen corresponding path program 1 times [2018-04-11 11:04:56,467 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:04:56,467 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:04:56,468 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:04:56,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:04:56,468 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:04:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:04:56,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:04:56,522 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 6 proven. 80 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-04-11 11:04:56,522 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:04:56,522 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:04:56,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:04:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:04:56,563 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:04:56,570 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 6 proven. 80 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-04-11 11:04:56,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:04:56,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-04-11 11:04:56,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 11:04:56,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 11:04:56,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-04-11 11:04:56,589 INFO L87 Difference]: Start difference. First operand 254 states and 276 transitions. Second operand 9 states. [2018-04-11 11:04:56,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:04:56,604 INFO L93 Difference]: Finished difference Result 266 states and 288 transitions. [2018-04-11 11:04:56,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 11:04:56,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-04-11 11:04:56,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:04:56,605 INFO L225 Difference]: With dead ends: 266 [2018-04-11 11:04:56,605 INFO L226 Difference]: Without dead ends: 266 [2018-04-11 11:04:56,605 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-04-11 11:04:56,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-04-11 11:04:56,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 261. [2018-04-11 11:04:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-04-11 11:04:56,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 283 transitions. [2018-04-11 11:04:56,607 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 283 transitions. Word has length 95 [2018-04-11 11:04:56,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:04:56,607 INFO L459 AbstractCegarLoop]: Abstraction has 261 states and 283 transitions. [2018-04-11 11:04:56,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 11:04:56,607 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 283 transitions. [2018-04-11 11:04:56,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-04-11 11:04:56,608 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:04:56,608 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:04:56,608 INFO L408 AbstractCegarLoop]: === Iteration 57 === [__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__freeDataErr6AssertViolationMEMORY_FREE, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation]=== [2018-04-11 11:04:56,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1371391946, now seen corresponding path program 1 times [2018-04-11 11:04:56,608 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:04:56,608 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:04:56,609 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:04:56,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:04:56,609 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:04:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:04:56,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:04:56,941 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:04:56,941 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:04:56,941 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:04:56,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:04:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:04:56,972 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:04:57,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 11:04:57,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:04:57,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:57,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:57,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:57,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-04-11 11:04:57,172 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.base Int) (|__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#t~ret14.base| Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.base (store (store (select |c_old(#memory_$Pointer$.base)| __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.base) 4 (select (select |c_old(#memory_$Pointer$.base)| |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.base|) |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.offset|)) 0 |__U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#t~ret14.base|)))) (store .cse0 |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.base| (store (select .cse0 |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.base|) |c___U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_#in~pointerToList.offset| __U_MULTI_foptional_data_creation_test___false_valid_memtrack_i__append_~node~0.base))))) is different from true [2018-04-11 11:04:57,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2018-04-11 11:04:57,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:04:57,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-04-11 11:04:57,192 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-04-11 11:04:57,192 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:57,196 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:57,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-04-11 11:04:57,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:04:57,204 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 20 treesize of output 20 [2018-04-11 11:04:57,205 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:57,207 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:57,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:57,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2018-04-11 11:04:57,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-04-11 11:04:57,217 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 18 treesize of output 19 [2018-04-11 11:04:57,217 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:57,219 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:57,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-04-11 11:04:57,228 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 24 treesize of output 16 [2018-04-11 11:04:57,228 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:04:57,231 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:57,234 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:04:57,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:04:57,243 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:53, output treesize:36 [2018-04-11 11:05:01,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-04-11 11:05:01,591 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 21 treesize of output 13 [2018-04-11 11:05:01,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:01,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:01,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:01,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:36 [2018-04-11 11:05:01,688 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 10 treesize of output 9 [2018-04-11 11:05:01,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:01,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:01,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:36 [2018-04-11 11:05:01,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:01,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:01,733 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 15 treesize of output 8 [2018-04-11 11:05:01,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:01,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-04-11 11:05:01,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-04-11 11:05:01,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:05:01,758 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:05:01,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:05:01,763 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:49, output treesize:27 [2018-04-11 11:05:01,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-04-11 11:05:01,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 11:05:01,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:01,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-11 11:05:01,895 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:01,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:01,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:01,898 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:4 [2018-04-11 11:05:01,917 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-11 11:05:01,935 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:05:01,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26] total 36 [2018-04-11 11:05:01,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 11:05:01,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 11:05:01,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1058, Unknown=13, NotChecked=66, Total=1260 [2018-04-11 11:05:01,936 INFO L87 Difference]: Start difference. First operand 261 states and 283 transitions. Second operand 36 states. Received shutdown request... [2018-04-11 11:05:16,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 11:05:16,364 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 11:05:16,368 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 11:05:16,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 11:05:16 BoogieIcfgContainer [2018-04-11 11:05:16,368 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 11:05:16,368 INFO L168 Benchmark]: Toolchain (without parser) took 202146.88 ms. Allocated memory was 402.7 MB in the beginning and 1.0 GB in the end (delta: 619.2 MB). Free memory was 333.5 MB in the beginning and 639.4 MB in the end (delta: -305.9 MB). Peak memory consumption was 313.3 MB. Max. memory is 5.3 GB. [2018-04-11 11:05:16,369 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 402.7 MB. Free memory is still 360.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 11:05:16,369 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.24 ms. Allocated memory is still 402.7 MB. Free memory was 333.5 MB in the beginning and 306.9 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 5.3 GB. [2018-04-11 11:05:16,370 INFO L168 Benchmark]: Boogie Preprocessor took 45.26 ms. Allocated memory is still 402.7 MB. Free memory was 306.9 MB in the beginning and 304.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 11:05:16,370 INFO L168 Benchmark]: RCFGBuilder took 440.18 ms. Allocated memory was 402.7 MB in the beginning and 589.8 MB in the end (delta: 187.2 MB). Free memory was 302.9 MB in the beginning and 511.0 MB in the end (delta: -208.1 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-04-11 11:05:16,370 INFO L168 Benchmark]: TraceAbstraction took 201400.07 ms. Allocated memory was 589.8 MB in the beginning and 1.0 GB in the end (delta: 432.0 MB). Free memory was 511.0 MB in the beginning and 639.4 MB in the end (delta: -128.4 MB). Peak memory consumption was 303.6 MB. Max. memory is 5.3 GB. [2018-04-11 11:05:16,371 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 402.7 MB. Free memory is still 360.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 258.24 ms. Allocated memory is still 402.7 MB. Free memory was 333.5 MB in the beginning and 306.9 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 45.26 ms. Allocated memory is still 402.7 MB. Free memory was 306.9 MB in the beginning and 304.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 440.18 ms. Allocated memory was 402.7 MB in the beginning and 589.8 MB in the end (delta: 187.2 MB). Free memory was 302.9 MB in the beginning and 511.0 MB in the end (delta: -208.1 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 201400.07 ms. Allocated memory was 589.8 MB in the beginning and 1.0 GB in the end (delta: 432.0 MB). Free memory was 511.0 MB in the beginning and 639.4 MB in the end (delta: -128.4 MB). Peak memory consumption was 303.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 559]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 562]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 559]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 562]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 577]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 571]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 580]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 571]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 570]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 576]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 576). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 577]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 580]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 576]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 576). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 577]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 577]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 568]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 568]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 567]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 567]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 547]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 547]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 547]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 547]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 10 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 133 locations, 45 error locations. TIMEOUT Result, 201.3s OverallTime, 57 OverallIterations, 6 TraceHistogramMax, 168.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5080 SDtfs, 4867 SDslu, 24090 SDs, 0 SdLazy, 26223 SolverSat, 1046 SolverUnsat, 98 SolverUnknown, 0 SolverNotchecked, 135.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1987 GetRequests, 824 SyntacticMatches, 87 SemanticMatches, 1076 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 9559 ImplicationChecksByTransitivity, 57.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=296occurred in iteration=50, 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.2s AutomataMinimizationTime, 56 MinimizatonAttempts, 886 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 31.4s InterpolantComputationTime, 3314 NumberOfCodeBlocks, 3314 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 3243 ConstructedInterpolants, 92 QuantifiedInterpolants, 2070956 SizeOfPredicates, 186 NumberOfNonLiveVariables, 3874 ConjunctsInSsa, 591 ConjunctsInUnsatCore, 71 InterpolantComputations, 43 PerfectInterpolantSequences, 222/736 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/optional_data_creation_test04_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_11-05-16-375.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_11-05-16-375.csv Completed graceful shutdown