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 -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/length_test03_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-835382a-m [2018-04-05 17:24:08,354 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-05 17:24:08,357 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-05 17:24:08,381 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-05 17:24:08,381 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-05 17:24:08,382 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-05 17:24:08,384 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-05 17:24:08,388 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-05 17:24:08,393 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-05 17:24:08,394 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-05 17:24:08,395 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-05 17:24:08,395 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-05 17:24:08,396 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-05 17:24:08,398 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-05 17:24:08,399 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-05 17:24:08,401 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-05 17:24:08,404 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-05 17:24:08,405 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-05 17:24:08,407 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-05 17:24:08,408 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-05 17:24:08,411 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-05 17:24:08,411 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-05 17:24:08,411 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-05 17:24:08,412 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-05 17:24:08,414 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-05 17:24:08,415 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-05 17:24:08,416 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-05 17:24:08,416 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-05 17:24:08,417 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-05 17:24:08,417 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-05 17:24:08,418 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-05 17:24:08,418 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-05 17:24:08,459 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-05 17:24:08,461 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-05 17:24:08,462 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-05 17:24:08,462 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-05 17:24:08,463 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-05 17:24:08,463 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-05 17:24:08,463 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-05 17:24:08,463 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-05 17:24:08,463 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-05 17:24:08,464 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-05 17:24:08,464 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-05 17:24:08,464 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-05 17:24:08,464 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-05 17:24:08,465 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-05 17:24:08,465 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-05 17:24:08,465 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-05 17:24:08,465 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-05 17:24:08,465 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-05 17:24:08,465 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-05 17:24:08,466 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-05 17:24:08,467 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-05 17:24:08,467 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-05 17:24:08,467 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-05 17:24:08,467 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-05 17:24:08,467 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-05 17:24:08,467 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-05 17:24:08,468 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-05 17:24:08,468 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-05 17:24:08,468 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-05 17:24:08,468 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-05 17:24:08,468 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-05 17:24:08,469 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:24:08,469 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-05 17:24:08,470 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-05 17:24:08,470 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-05 17:24:08,470 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-05 17:24:08,470 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-05 17:24:08,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-05 17:24:08,546 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-05 17:24:08,553 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-05 17:24:08,555 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-05 17:24:08,555 INFO L276 PluginConnector]: CDTParser initialized [2018-04-05 17:24:08,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/length_test03_true-valid-memsafety.i [2018-04-05 17:24:08,910 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG5d06dcf24 [2018-04-05 17:24:09,189 INFO L287 CDTParser]: IsIndexed: true [2018-04-05 17:24:09,189 INFO L288 CDTParser]: Found 1 translation units. [2018-04-05 17:24:09,190 INFO L168 CDTParser]: Scanning length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,206 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-05 17:24:09,206 INFO L215 ultiparseSymbolTable]: [2018-04-05 17:24:09,206 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-05 17:24:09,207 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flength_test___true_valid_memsafety_i__append ('append') in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,207 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flength_test___true_valid_memsafety_i____bswap_64 ('__bswap_64') in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,207 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,207 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flength_test___true_valid_memsafety_i____bswap_32 ('__bswap_32') in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,207 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-05 17:24:09,207 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__nlink_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,207 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fd_mask in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,208 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__wchar_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,208 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_attr_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,208 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____sig_atomic_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,208 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_once_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,208 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_int8_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,208 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__dev_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,208 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_condattr_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,209 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__id_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,209 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____u_int in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,209 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,209 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____clock_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,209 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__timer_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,209 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__clockid_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,209 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__fsid_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,209 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____int8_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,210 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_spinlock_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,210 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____nlink_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,210 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____sigset_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,210 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__suseconds_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,210 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____blkcnt64_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,210 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____uint64_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,210 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__gid_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__ssize_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__fd_mask in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_short in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__uint in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_long in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____uid_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pid_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fsword_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____ino64_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____uint16_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__int8_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__daddr_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__clock_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____syscall_slong_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____loff_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____blkcnt_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__register_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__int64_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____daddr_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fsfilcnt_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_barrierattr_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__ldiv_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_quad_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__ushort in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_mutex_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,221 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____time_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_int64_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____useconds_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fsfilcnt64_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__loff_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____key_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__ino_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____uint8_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,222 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____int64_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____qaddr_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__int16_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__blksize_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____u_char in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____blksize_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_key_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,223 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_rwlock_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__lldiv_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,224 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____dev_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fsblkcnt_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__uid_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____rlim64_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____uint32_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__fsblkcnt_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__time_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,225 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__div_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____int32_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____id_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____syscall_ulong_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__ulong in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__mode_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__sigset_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,226 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____pthread_slist_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_int32_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____u_short in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__caddr_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__key_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_rwlockattr_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____caddr_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__fd_set in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,227 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____off_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,228 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____quad_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,230 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____mode_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,230 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__fsfilcnt_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fsid_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____gid_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__int32_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____pid_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____ssize_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____socklen_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_mutexattr_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____ino_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,231 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__off_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,232 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____timer_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,232 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____u_long in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,232 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_cond_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,232 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____int16_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,232 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__size_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,232 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____intptr_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,232 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_int16_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,232 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__blkcnt_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,233 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____rlim_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,233 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____clockid_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,233 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_char in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,233 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_int in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,233 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__quad_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,233 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fsblkcnt64_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,233 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____off64_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,233 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____suseconds_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,233 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_barrier_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,234 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____u_quad_t in length_test03_true-valid-memsafety.i [2018-04-05 17:24:09,265 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG5d06dcf24 [2018-04-05 17:24:09,271 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-05 17:24:09,273 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-05 17:24:09,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-05 17:24:09,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-05 17:24:09,282 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-05 17:24:09,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 05:24:09" (1/1) ... [2018-04-05 17:24:09,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f63b831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:24:09, skipping insertion in model container [2018-04-05 17:24:09,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 05:24:09" (1/1) ... [2018-04-05 17:24:09,311 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-05 17:24:09,389 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-05 17:24:09,640 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-05 17:24:09,709 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-05 17:24:09,717 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 119 non ball SCCs. Number of states in SCCs 119. [2018-04-05 17:24:09,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:24:09 WrapperNode [2018-04-05 17:24:09,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-05 17:24:09,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-05 17:24:09,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-05 17:24:09,806 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-05 17:24:09,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:24:09" (1/1) ... [2018-04-05 17:24:09,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:24:09" (1/1) ... [2018-04-05 17:24:09,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:24:09" (1/1) ... [2018-04-05 17:24:09,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:24:09" (1/1) ... [2018-04-05 17:24:09,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:24:09" (1/1) ... [2018-04-05 17:24:09,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:24:09" (1/1) ... [2018-04-05 17:24:09,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:24:09" (1/1) ... [2018-04-05 17:24:09,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-05 17:24:09,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-05 17:24:09,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-05 17:24:09,910 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-05 17:24:09,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:24:09" (1/1) ... No working directory specified, using /storage/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-05 17:24:10,077 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-05 17:24:10,078 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-05 17:24:10,078 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___true_valid_memsafety_i____bswap_32 [2018-04-05 17:24:10,078 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___true_valid_memsafety_i____bswap_64 [2018-04-05 17:24:10,078 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___true_valid_memsafety_i__append [2018-04-05 17:24:10,078 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-05 17:24:10,078 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-05 17:24:10,078 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-05 17:24:10,079 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-05 17:24:10,079 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-05 17:24:10,079 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-05 17:24:10,079 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-05 17:24:10,079 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-05 17:24:10,079 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-05 17:24:10,080 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-05 17:24:10,080 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-05 17:24:10,080 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-05 17:24:10,080 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-05 17:24:10,080 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-05 17:24:10,080 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-05 17:24:10,080 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-05 17:24:10,081 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-05 17:24:10,081 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-05 17:24:10,081 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___true_valid_memsafety_i____bswap_32 [2018-04-05 17:24:10,081 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___true_valid_memsafety_i____bswap_64 [2018-04-05 17:24:10,081 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-05 17:24:10,081 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-05 17:24:10,081 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-05 17:24:10,082 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-05 17:24:10,082 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-05 17:24:10,082 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-05 17:24:10,082 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-05 17:24:10,082 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-05 17:24:10,082 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-05 17:24:10,082 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-05 17:24:10,083 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-05 17:24:10,085 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-05 17:24:10,085 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-05 17:24:10,085 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-05 17:24:10,085 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-05 17:24:10,085 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-05 17:24:10,086 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-05 17:24:10,086 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-05 17:24:10,086 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-05 17:24:10,086 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-05 17:24:10,086 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-05 17:24:10,086 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-05 17:24:10,086 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-05 17:24:10,087 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-05 17:24:10,087 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-05 17:24:10,087 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-05 17:24:10,087 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-05 17:24:10,087 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-05 17:24:10,087 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-05 17:24:10,087 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-05 17:24:10,088 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-05 17:24:10,088 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-05 17:24:10,088 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-05 17:24:10,088 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-05 17:24:10,088 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-05 17:24:10,088 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-05 17:24:10,088 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-05 17:24:10,089 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-05 17:24:10,091 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-05 17:24:10,092 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-05 17:24:10,092 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-05 17:24:10,092 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-05 17:24:10,092 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-05 17:24:10,092 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-05 17:24:10,093 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-05 17:24:10,093 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-05 17:24:10,093 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-05 17:24:10,093 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-05 17:24:10,093 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-05 17:24:10,093 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-05 17:24:10,093 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-05 17:24:10,093 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-05 17:24:10,094 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-05 17:24:10,094 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-05 17:24:10,094 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-05 17:24:10,094 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-05 17:24:10,094 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-05 17:24:10,094 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-05 17:24:10,094 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-05 17:24:10,095 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-05 17:24:10,096 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-05 17:24:10,097 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-05 17:24:10,097 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-05 17:24:10,097 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-05 17:24:10,097 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-05 17:24:10,097 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-05 17:24:10,097 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-05 17:24:10,098 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-05 17:24:10,098 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-05 17:24:10,098 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-05 17:24:10,098 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-05 17:24:10,098 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-05 17:24:10,098 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-05 17:24:10,098 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-05 17:24:10,098 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-05 17:24:10,099 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-05 17:24:10,099 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-05 17:24:10,099 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-05 17:24:10,099 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-05 17:24:10,099 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-05 17:24:10,099 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-05 17:24:10,099 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-05 17:24:10,100 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-05 17:24:10,101 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-05 17:24:10,101 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-05 17:24:10,101 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-05 17:24:10,101 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-05 17:24:10,101 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-04-05 17:24:10,101 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-05 17:24:10,102 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___true_valid_memsafety_i__append [2018-04-05 17:24:10,102 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-05 17:24:10,102 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-05 17:24:10,102 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-05 17:24:10,102 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-05 17:24:10,102 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-05 17:24:10,102 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-05 17:24:10,102 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-05 17:24:10,102 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-05 17:24:10,103 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-05 17:24:10,103 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-05 17:24:11,257 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-05 17:24:11,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:24:11 BoogieIcfgContainer [2018-04-05 17:24:11,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-05 17:24:11,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-05 17:24:11,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-05 17:24:11,263 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-05 17:24:11,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 05:24:09" (1/3) ... [2018-04-05 17:24:11,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a295659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 05:24:11, skipping insertion in model container [2018-04-05 17:24:11,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:24:09" (2/3) ... [2018-04-05 17:24:11,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a295659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 05:24:11, skipping insertion in model container [2018-04-05 17:24:11,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:24:11" (3/3) ... [2018-04-05 17:24:11,268 INFO L107 eAbstractionObserver]: Analyzing ICFG length_test03_true-valid-memsafety.i [2018-04-05 17:24:11,279 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-05 17:24:11,296 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-04-05 17:24:11,381 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-05 17:24:11,382 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-05 17:24:11,382 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-05 17:24:11,383 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-05 17:24:11,383 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-05 17:24:11,383 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-05 17:24:11,383 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-05 17:24:11,383 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-05 17:24:11,384 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-05 17:24:11,385 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-05 17:24:11,409 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states. [2018-04-05 17:24:11,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-05 17:24:11,417 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:24:11,418 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:24:11,418 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-05 17:24:11,429 INFO L82 PathProgramCache]: Analyzing trace with hash -383327672, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:24:11,459 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:24:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:24:11,520 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:24:11,585 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-05 17:24:11,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:11,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:11,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-05 17:24:11,636 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-05 17:24:11,636 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:24:11,661 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-05 17:24:11,687 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:24:11,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-05 17:24:11,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-05 17:24:11,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-05 17:24:11,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-05 17:24:11,702 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 4 states. [2018-04-05 17:24:12,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:24:12,507 INFO L93 Difference]: Finished difference Result 356 states and 379 transitions. [2018-04-05 17:24:12,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-05 17:24:12,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-04-05 17:24:12,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:24:12,524 INFO L225 Difference]: With dead ends: 356 [2018-04-05 17:24:12,524 INFO L226 Difference]: Without dead ends: 213 [2018-04-05 17:24:12,529 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-05 17:24:12,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-05 17:24:12,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 165. [2018-04-05 17:24:12,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-04-05 17:24:12,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 171 transitions. [2018-04-05 17:24:12,598 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 171 transitions. Word has length 9 [2018-04-05 17:24:12,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:24:12,598 INFO L459 AbstractCegarLoop]: Abstraction has 165 states and 171 transitions. [2018-04-05 17:24:12,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-05 17:24:12,599 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 171 transitions. [2018-04-05 17:24:12,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-05 17:24:12,599 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:24:12,599 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:24:12,599 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-05 17:24:12,600 INFO L82 PathProgramCache]: Analyzing trace with hash -383327671, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:24:12,607 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:24:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:24:12,622 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:24:12,640 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-05 17:24:12,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:12,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:12,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 17:24:12,661 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-05 17:24:12,661 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:24:12,733 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-05 17:24:12,756 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:24:12,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-05 17:24:12,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-05 17:24:12,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-05 17:24:12,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-05 17:24:12,758 INFO L87 Difference]: Start difference. First operand 165 states and 171 transitions. Second operand 6 states. [2018-04-05 17:24:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:24:13,324 INFO L93 Difference]: Finished difference Result 170 states and 177 transitions. [2018-04-05 17:24:13,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-05 17:24:13,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-04-05 17:24:13,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:24:13,328 INFO L225 Difference]: With dead ends: 170 [2018-04-05 17:24:13,328 INFO L226 Difference]: Without dead ends: 168 [2018-04-05 17:24:13,329 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-05 17:24:13,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-04-05 17:24:13,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 163. [2018-04-05 17:24:13,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-04-05 17:24:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 169 transitions. [2018-04-05 17:24:13,342 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 169 transitions. Word has length 9 [2018-04-05 17:24:13,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:24:13,342 INFO L459 AbstractCegarLoop]: Abstraction has 163 states and 169 transitions. [2018-04-05 17:24:13,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-05 17:24:13,343 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 169 transitions. [2018-04-05 17:24:13,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-05 17:24:13,343 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:24:13,343 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:24:13,343 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-05 17:24:13,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1523848588, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:24:13,355 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:24:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:24:13,372 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:24:13,386 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-05 17:24:13,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:13,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:13,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-05 17:24:13,526 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-05 17:24:13,526 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:24:13,572 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-05 17:24:13,631 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:24:13,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-05 17:24:13,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-05 17:24:13,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-05 17:24:13,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-05 17:24:13,633 INFO L87 Difference]: Start difference. First operand 163 states and 169 transitions. Second operand 4 states. [2018-04-05 17:24:13,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:24:13,994 INFO L93 Difference]: Finished difference Result 188 states and 196 transitions. [2018-04-05 17:24:13,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-05 17:24:13,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-05 17:24:13,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:24:13,997 INFO L225 Difference]: With dead ends: 188 [2018-04-05 17:24:13,997 INFO L226 Difference]: Without dead ends: 185 [2018-04-05 17:24:13,998 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-05 17:24:13,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-04-05 17:24:14,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2018-04-05 17:24:14,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-05 17:24:14,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 176 transitions. [2018-04-05 17:24:14,019 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 176 transitions. Word has length 13 [2018-04-05 17:24:14,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:24:14,020 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 176 transitions. [2018-04-05 17:24:14,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-05 17:24:14,020 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 176 transitions. [2018-04-05 17:24:14,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-05 17:24:14,021 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:24:14,022 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:24:14,022 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-05 17:24:14,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1523848589, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:24:14,030 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:24:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:24:14,045 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:24:14,052 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-05 17:24:14,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:14,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:14,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 17:24:14,176 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-05 17:24:14,177 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:24:14,240 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-05 17:24:14,263 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:24:14,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-05 17:24:14,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-05 17:24:14,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-05 17:24:14,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-05 17:24:14,264 INFO L87 Difference]: Start difference. First operand 168 states and 176 transitions. Second operand 6 states. [2018-04-05 17:24:14,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:24:14,859 INFO L93 Difference]: Finished difference Result 173 states and 182 transitions. [2018-04-05 17:24:14,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-05 17:24:14,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-05 17:24:14,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:24:14,862 INFO L225 Difference]: With dead ends: 173 [2018-04-05 17:24:14,863 INFO L226 Difference]: Without dead ends: 171 [2018-04-05 17:24:14,863 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-05 17:24:14,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-04-05 17:24:14,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 166. [2018-04-05 17:24:14,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-05 17:24:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 174 transitions. [2018-04-05 17:24:14,880 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 174 transitions. Word has length 13 [2018-04-05 17:24:14,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:24:14,881 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 174 transitions. [2018-04-05 17:24:14,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-05 17:24:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 174 transitions. [2018-04-05 17:24:14,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-05 17:24:14,882 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:24:14,882 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] [2018-04-05 17:24:14,882 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-05 17:24:14,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1964962700, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:24:14,893 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:24:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:24:14,917 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:24:14,930 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-05 17:24:14,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:14,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:14,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-05 17:24:14,946 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-05 17:24:14,946 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:24:14,950 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-05 17:24:14,972 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:24:14,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-05 17:24:14,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-05 17:24:14,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-05 17:24:14,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-05 17:24:14,973 INFO L87 Difference]: Start difference. First operand 166 states and 174 transitions. Second operand 4 states. [2018-04-05 17:24:15,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:24:15,180 INFO L93 Difference]: Finished difference Result 166 states and 174 transitions. [2018-04-05 17:24:15,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-05 17:24:15,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-04-05 17:24:15,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:24:15,181 INFO L225 Difference]: With dead ends: 166 [2018-04-05 17:24:15,181 INFO L226 Difference]: Without dead ends: 161 [2018-04-05 17:24:15,182 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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-05 17:24:15,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-05 17:24:15,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-04-05 17:24:15,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-05 17:24:15,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 169 transitions. [2018-04-05 17:24:15,192 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 169 transitions. Word has length 25 [2018-04-05 17:24:15,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:24:15,192 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 169 transitions. [2018-04-05 17:24:15,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-05 17:24:15,192 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 169 transitions. [2018-04-05 17:24:15,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-05 17:24:15,193 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:24:15,193 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] [2018-04-05 17:24:15,193 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-05 17:24:15,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1964962701, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:24:15,208 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:24:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:24:15,237 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:24:15,242 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-05 17:24:15,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:15,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:15,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 17:24:15,258 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-05 17:24:15,258 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:24:15,279 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-05 17:24:15,307 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:24:15,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-05 17:24:15,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-05 17:24:15,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-05 17:24:15,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-05 17:24:15,309 INFO L87 Difference]: Start difference. First operand 161 states and 169 transitions. Second operand 6 states. [2018-04-05 17:24:15,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:24:15,408 INFO L93 Difference]: Finished difference Result 161 states and 169 transitions. [2018-04-05 17:24:15,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-05 17:24:15,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-04-05 17:24:15,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:24:15,410 INFO L225 Difference]: With dead ends: 161 [2018-04-05 17:24:15,410 INFO L226 Difference]: Without dead ends: 156 [2018-04-05 17:24:15,410 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-05 17:24:15,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-05 17:24:15,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-04-05 17:24:15,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-04-05 17:24:15,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 164 transitions. [2018-04-05 17:24:15,418 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 164 transitions. Word has length 25 [2018-04-05 17:24:15,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:24:15,419 INFO L459 AbstractCegarLoop]: Abstraction has 156 states and 164 transitions. [2018-04-05 17:24:15,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-05 17:24:15,419 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 164 transitions. [2018-04-05 17:24:15,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-05 17:24:15,419 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:24:15,419 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:24:15,419 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-05 17:24:15,420 INFO L82 PathProgramCache]: Analyzing trace with hash 784301688, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:24:15,428 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:24:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:24:15,456 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:24:15,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 12 treesize of output 11 [2018-04-05 17:24:15,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:15,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:15,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-05 17:24:15,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-05 17:24:15,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:15,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:15,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-05 17:24:15,546 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-05 17:24:15,546 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:24:15,627 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-05 17:24:15,650 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:24:15,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 12 [2018-04-05 17:24:15,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-05 17:24:15,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-05 17:24:15,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-04-05 17:24:15,651 INFO L87 Difference]: Start difference. First operand 156 states and 164 transitions. Second operand 13 states. [2018-04-05 17:24:16,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:24:16,201 INFO L93 Difference]: Finished difference Result 253 states and 273 transitions. [2018-04-05 17:24:16,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-05 17:24:16,201 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-04-05 17:24:16,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:24:16,203 INFO L225 Difference]: With dead ends: 253 [2018-04-05 17:24:16,203 INFO L226 Difference]: Without dead ends: 245 [2018-04-05 17:24:16,204 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-04-05 17:24:16,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-04-05 17:24:16,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 184. [2018-04-05 17:24:16,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-04-05 17:24:16,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 204 transitions. [2018-04-05 17:24:16,214 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 204 transitions. Word has length 26 [2018-04-05 17:24:16,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:24:16,215 INFO L459 AbstractCegarLoop]: Abstraction has 184 states and 204 transitions. [2018-04-05 17:24:16,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-05 17:24:16,215 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 204 transitions. [2018-04-05 17:24:16,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-05 17:24:16,216 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:24:16,216 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:24:16,216 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-05 17:24:16,216 INFO L82 PathProgramCache]: Analyzing trace with hash 784301689, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:24:16,223 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:24:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:24:16,256 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:24:16,287 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-05 17:24:16,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:16,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:16,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 17:24:16,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-05 17:24:16,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:16,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:16,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-04-05 17:24:16,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:16,401 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-05 17:24:16,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-05 17:24:16,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:24:16,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:33 [2018-04-05 17:24:16,492 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-05 17:24:16,492 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:24:17,140 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-05 17:24:17,176 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:24:17,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 16 [2018-04-05 17:24:17,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-05 17:24:17,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-05 17:24:17,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=219, Unknown=1, NotChecked=0, Total=272 [2018-04-05 17:24:17,177 INFO L87 Difference]: Start difference. First operand 184 states and 204 transitions. Second operand 17 states. [2018-04-05 17:24:20,441 WARN L148 SmtUtils]: Spent 352ms on a formula simplification that was a NOOP. DAG size: 23 [2018-04-05 17:24:23,655 WARN L151 SmtUtils]: Spent 302ms on a formula simplification. DAG size of input: 24 DAG size of output 17 [2018-04-05 17:24:26,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:24:26,293 INFO L93 Difference]: Finished difference Result 496 states and 537 transitions. [2018-04-05 17:24:26,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-05 17:24:26,321 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-04-05 17:24:26,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:24:26,326 INFO L225 Difference]: With dead ends: 496 [2018-04-05 17:24:26,326 INFO L226 Difference]: Without dead ends: 489 [2018-04-05 17:24:26,328 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=126, Invalid=520, Unknown=4, NotChecked=0, Total=650 [2018-04-05 17:24:26,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-04-05 17:24:26,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 219. [2018-04-05 17:24:26,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-04-05 17:24:26,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 241 transitions. [2018-04-05 17:24:26,345 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 241 transitions. Word has length 26 [2018-04-05 17:24:26,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:24:26,345 INFO L459 AbstractCegarLoop]: Abstraction has 219 states and 241 transitions. [2018-04-05 17:24:26,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-05 17:24:26,346 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 241 transitions. [2018-04-05 17:24:26,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-05 17:24:26,347 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:24:26,347 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] [2018-04-05 17:24:26,348 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-05 17:24:26,348 INFO L82 PathProgramCache]: Analyzing trace with hash 938846954, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:24:26,364 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:24:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:24:26,407 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:24:26,414 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-05 17:24:26,417 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-05 17:24:26,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:26,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:26,425 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-05 17:24:26,427 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-05 17:24:26,427 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:26,429 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:26,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:26,433 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-04-05 17:24:26,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-05 17:24:26,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:26,455 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-05 17:24:26,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:26,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:26,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-05 17:24:26,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:26,475 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-05 17:24:26,476 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:26,480 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:26,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:26,496 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-04-05 17:24:26,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:26,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:26,544 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-05 17:24:26,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:26,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:26,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:37 [2018-04-05 17:24:26,609 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 28 treesize of output 29 [2018-04-05 17:24:26,612 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-05 17:24:26,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:26,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:26,638 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 28 treesize of output 29 [2018-04-05 17:24:26,644 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-05 17:24:26,645 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:26,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:26,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:26,675 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-04-05 17:24:26,722 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 36 [2018-04-05 17:24:26,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:26,726 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-05 17:24:26,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:26,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:26,755 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 36 [2018-04-05 17:24:26,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:26,761 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-05 17:24:26,762 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:26,771 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:26,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-05 17:24:26,785 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:77, output treesize:69 [2018-04-05 17:24:27,001 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 40 treesize of output 34 [2018-04-05 17:24:27,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:27,032 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 13 treesize of output 6 [2018-04-05 17:24:27,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:27,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:27,156 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 18 treesize of output 10 [2018-04-05 17:24:27,157 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:27,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:27,216 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 40 treesize of output 34 [2018-04-05 17:24:27,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:27,257 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 13 treesize of output 6 [2018-04-05 17:24:27,257 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:27,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:27,373 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 18 treesize of output 10 [2018-04-05 17:24:27,373 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:27,384 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:27,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:27,399 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:83, output treesize:7 [2018-04-05 17:24:27,434 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-05 17:24:27,435 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:24:27,896 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-05 17:24:27,921 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:24:27,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 9] imperfect sequences [] total 17 [2018-04-05 17:24:27,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-05 17:24:27,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-05 17:24:27,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-04-05 17:24:27,923 INFO L87 Difference]: Start difference. First operand 219 states and 241 transitions. Second operand 17 states. [2018-04-05 17:24:28,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:24:28,693 INFO L93 Difference]: Finished difference Result 408 states and 451 transitions. [2018-04-05 17:24:28,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-05 17:24:28,693 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-04-05 17:24:28,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:24:28,694 INFO L225 Difference]: With dead ends: 408 [2018-04-05 17:24:28,694 INFO L226 Difference]: Without dead ends: 219 [2018-04-05 17:24:28,695 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2018-04-05 17:24:28,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-04-05 17:24:28,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-04-05 17:24:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-04-05 17:24:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 240 transitions. [2018-04-05 17:24:28,711 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 240 transitions. Word has length 38 [2018-04-05 17:24:28,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:24:28,711 INFO L459 AbstractCegarLoop]: Abstraction has 219 states and 240 transitions. [2018-04-05 17:24:28,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-05 17:24:28,712 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 240 transitions. [2018-04-05 17:24:28,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-05 17:24:28,713 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:24:28,713 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-05 17:24:28,713 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-05 17:24:28,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1705971385, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:24:28,721 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:24:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:24:28,761 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:24:28,782 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-05 17:24:28,784 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-05 17:24:28,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:28,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:28,797 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-05 17:24:28,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-05 17:24:28,800 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:28,801 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:28,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:28,807 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-04-05 17:24:28,819 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:28,820 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:28,820 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-05 17:24:28,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:28,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:28,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-04-05 17:24:28,857 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 21 treesize of output 22 [2018-04-05 17:24:28,865 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-05 17:24:28,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:28,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:28,892 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 21 treesize of output 22 [2018-04-05 17:24:28,904 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-05 17:24:28,905 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:28,910 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:28,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:28,918 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-04-05 17:24:28,947 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 30 treesize of output 29 [2018-04-05 17:24:28,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:28,952 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-05 17:24:28,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:28,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:28,986 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 30 treesize of output 29 [2018-04-05 17:24:28,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:28,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-05 17:24:28,990 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:28,997 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:29,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-05 17:24:29,010 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:58 [2018-04-05 17:24:29,215 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 35 treesize of output 31 [2018-04-05 17:24:29,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:29,223 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 13 treesize of output 6 [2018-04-05 17:24:29,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:29,272 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:29,273 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-05 17:24:29,274 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:29,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:29,297 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 35 treesize of output 31 [2018-04-05 17:24:29,300 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:29,301 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-05 17:24:29,301 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:29,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:29,313 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 13 treesize of output 6 [2018-04-05 17:24:29,313 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:29,321 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:29,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:29,329 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:82, output treesize:7 [2018-04-05 17:24:29,367 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-05 17:24:29,367 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:24:29,775 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 27 treesize of output 25 [2018-04-05 17:24:29,813 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 7 treesize of output 3 [2018-04-05 17:24:29,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:29,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:29,832 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 27 treesize of output 25 [2018-04-05 17:24:29,889 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 7 treesize of output 3 [2018-04-05 17:24:29,889 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:29,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:29,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-05 17:24:29,909 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:55, output treesize:27 [2018-04-05 17:24:29,953 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-05 17:24:29,975 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:24:29,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 13] imperfect sequences [] total 22 [2018-04-05 17:24:29,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-05 17:24:29,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-05 17:24:29,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=380, Unknown=3, NotChecked=0, Total=462 [2018-04-05 17:24:29,976 INFO L87 Difference]: Start difference. First operand 219 states and 240 transitions. Second operand 22 states. [2018-04-05 17:24:30,422 WARN L148 SmtUtils]: Spent 154ms on a formula simplification that was a NOOP. DAG size: 41 [2018-04-05 17:24:32,270 WARN L148 SmtUtils]: Spent 121ms on a formula simplification that was a NOOP. DAG size: 28 [2018-04-05 17:24:32,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:24:32,473 INFO L93 Difference]: Finished difference Result 431 states and 472 transitions. [2018-04-05 17:24:32,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-05 17:24:32,473 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-04-05 17:24:32,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:24:32,475 INFO L225 Difference]: With dead ends: 431 [2018-04-05 17:24:32,475 INFO L226 Difference]: Without dead ends: 250 [2018-04-05 17:24:32,479 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=247, Invalid=1010, Unknown=3, NotChecked=0, Total=1260 [2018-04-05 17:24:32,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-04-05 17:24:32,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 208. [2018-04-05 17:24:32,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-05 17:24:32,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2018-04-05 17:24:32,524 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 40 [2018-04-05 17:24:32,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:24:32,525 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2018-04-05 17:24:32,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-05 17:24:32,525 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2018-04-05 17:24:32,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-05 17:24:32,533 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:24:32,533 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] [2018-04-05 17:24:32,533 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-05 17:24:32,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1496757513, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:24:32,587 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:24:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:24:32,668 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:24:32,730 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-05 17:24:32,730 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:24:32,849 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-05 17:24:32,885 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:24:32,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2018-04-05 17:24:32,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-05 17:24:32,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-05 17:24:32,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-05 17:24:32,887 INFO L87 Difference]: Start difference. First operand 208 states and 226 transitions. Second operand 4 states. [2018-04-05 17:24:32,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:24:32,963 INFO L93 Difference]: Finished difference Result 293 states and 313 transitions. [2018-04-05 17:24:32,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-05 17:24:32,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-04-05 17:24:32,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:24:32,970 INFO L225 Difference]: With dead ends: 293 [2018-04-05 17:24:32,970 INFO L226 Difference]: Without dead ends: 221 [2018-04-05 17:24:32,971 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-05 17:24:32,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-05 17:24:32,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 202. [2018-04-05 17:24:32,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-04-05 17:24:32,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 216 transitions. [2018-04-05 17:24:32,989 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 216 transitions. Word has length 49 [2018-04-05 17:24:32,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:24:32,990 INFO L459 AbstractCegarLoop]: Abstraction has 202 states and 216 transitions. [2018-04-05 17:24:32,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-05 17:24:32,990 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 216 transitions. [2018-04-05 17:24:32,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-05 17:24:32,991 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:24:32,992 INFO L355 BasicCegarLoop]: trace histogram [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-05 17:24:32,992 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-05 17:24:32,992 INFO L82 PathProgramCache]: Analyzing trace with hash -855864649, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:24:33,001 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:24:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:24:33,060 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:24:33,153 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 6 treesize of output 5 [2018-04-05 17:24:33,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:33,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:33,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-04-05 17:24:33,277 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-05 17:24:33,281 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-05 17:24:33,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:33,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:33,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:33,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-05 17:24:33,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-05 17:24:33,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:33,358 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 16 treesize of output 23 [2018-04-05 17:24:33,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:33,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:33,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:33,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-04-05 17:24:33,636 WARN L148 SmtUtils]: Spent 123ms on a formula simplification that was a NOOP. DAG size: 19 [2018-04-05 17:24:33,716 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 3 case distinctions, treesize of input 30 treesize of output 40 [2018-04-05 17:24:33,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:33,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:33,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 53 [2018-04-05 17:24:33,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-05 17:24:33,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-04-05 17:24:33,827 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:33,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:24:33,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:24:33,922 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:123 [2018-04-05 17:24:34,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:34,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 49 treesize of output 50 [2018-04-05 17:24:34,003 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 31 treesize of output 27 [2018-04-05 17:24:34,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:34,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:34,114 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 78 [2018-04-05 17:24:34,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:34,121 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 80 treesize of output 95 [2018-04-05 17:24:34,121 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:34,161 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:34,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:34,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:34,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 99 [2018-04-05 17:24:34,174 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-05 17:24:34,248 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-05 17:24:34,295 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-05 17:24:34,343 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-05 17:24:34,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 51 treesize of output 44 [2018-04-05 17:24:34,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:34,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:34,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:34,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:34,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 60 [2018-04-05 17:24:34,426 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:34,449 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:34,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-05 17:24:34,533 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:182, output treesize:225 [2018-04-05 17:24:34,763 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 69 DAG size of output 52 [2018-04-05 17:24:35,495 WARN L148 SmtUtils]: Spent 473ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-05 17:24:36,275 WARN L148 SmtUtils]: Spent 556ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-05 17:24:36,326 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 63 treesize of output 60 [2018-04-05 17:24:36,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:36,542 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 38 treesize of output 37 [2018-04-05 17:24:36,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:36,622 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 86 treesize of output 79 [2018-04-05 17:24:36,622 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:36,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-05 17:24:36,704 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:188, output treesize:177 [2018-04-05 17:24:36,920 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-05 17:24:36,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:36,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 75 [2018-04-05 17:24:36,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:36,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 68 treesize of output 52 [2018-04-05 17:24:36,987 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:37,039 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:37,040 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 46 treesize of output 40 [2018-04-05 17:24:37,040 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:37,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:37,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:37,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 70 [2018-04-05 17:24:37,122 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:37,211 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:24:37,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 39 treesize of output 33 [2018-04-05 17:24:37,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:37,339 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 18 treesize of output 10 [2018-04-05 17:24:37,340 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:37,358 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:37,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:24:37,411 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:197, output treesize:84 [2018-04-05 17:24:37,827 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:24:37,827 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:24:38,970 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 13 treesize of output 17 [2018-04-05 17:24:39,072 WARN L148 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 20 [2018-04-05 17:24:39,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:24:39,078 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 14 treesize of output 8 [2018-04-05 17:24:39,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:39,082 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 11 treesize of output 4 [2018-04-05 17:24:39,083 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:39,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:39,118 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 44 [2018-04-05 17:24:39,152 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-05 17:24:39,152 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:39,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 43 [2018-04-05 17:24:39,176 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:39,177 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 39 treesize of output 42 [2018-04-05 17:24:39,177 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:39,188 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:39,205 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 37 treesize of output 31 [2018-04-05 17:24:39,239 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:39,252 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:39,261 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:39,278 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:39,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 56 [2018-04-05 17:24:39,659 WARN L151 SmtUtils]: Spent 377ms on a formula simplification. DAG size of input: 31 DAG size of output 24 [2018-04-05 17:24:39,675 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:39,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-04-05 17:24:39,676 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:39,810 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:39,832 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:39,883 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:39,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:39,897 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:78, output treesize:7 [2018-04-05 17:24:41,110 WARN L148 SmtUtils]: Spent 569ms on a formula simplification that was a NOOP. DAG size: 83 [2018-04-05 17:24:41,123 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 55 treesize of output 56 [2018-04-05 17:24:41,167 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 14 treesize of output 18 [2018-04-05 17:24:41,170 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:41,171 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 18 treesize of output 24 [2018-04-05 17:24:41,171 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:41,179 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:41,207 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 41 treesize of output 38 [2018-04-05 17:24:41,210 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 16 treesize of output 20 [2018-04-05 17:24:41,231 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 6 [2018-04-05 17:24:41,231 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:41,234 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 1 [2018-04-05 17:24:41,235 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:41,238 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:41,245 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:41,245 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 5 [2018-04-05 17:24:41,246 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:41,248 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:41,255 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 1 case distinctions, treesize of input 27 treesize of output 29 [2018-04-05 17:24:41,259 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:41,260 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 24 treesize of output 15 [2018-04-05 17:24:41,260 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:41,271 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 10 treesize of output 3 [2018-04-05 17:24:41,272 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:41,282 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:41,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 24 [2018-04-05 17:24:41,292 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-05 17:24:41,302 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:24:41,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:24:41,323 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2018-04-05 17:24:41,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 43 [2018-04-05 17:24:41,371 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:41,371 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 39 treesize of output 42 [2018-04-05 17:24:41,372 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:41,380 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:41,383 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 23 treesize of output 26 [2018-04-05 17:24:41,385 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:41,386 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 24 [2018-04-05 17:24:41,386 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:41,392 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:41,418 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 41 treesize of output 35 [2018-04-05 17:24:41,421 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:41,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 55 [2018-04-05 17:24:41,535 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:41,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 46 [2018-04-05 17:24:41,580 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-04-05 17:24:41,582 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:41,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 34 [2018-04-05 17:24:41,600 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-04-05 17:24:41,700 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 1 case distinctions, treesize of input 23 treesize of output 19 [2018-04-05 17:24:41,700 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-04-05 17:24:41,703 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:41,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 24 [2018-04-05 17:24:41,718 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-04-05 17:24:41,779 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 1 case distinctions, treesize of input 21 treesize of output 17 [2018-04-05 17:24:41,779 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-04-05 17:24:41,783 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:41,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2018-04-05 17:24:41,789 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-04-05 17:24:41,838 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-05 17:24:41,854 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-05 17:24:41,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 29 [2018-04-05 17:24:41,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-05 17:24:41,864 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:41,875 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:41,875 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 18 treesize of output 9 [2018-04-05 17:24:41,875 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:41,908 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:41,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 24 [2018-04-05 17:24:41,921 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-04-05 17:24:41,934 INFO L267 ElimStorePlain]: Start of recursive call 27: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:24:42,080 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-04-05 17:24:42,233 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 68 treesize of output 69 [2018-04-05 17:24:42,298 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 14 treesize of output 18 [2018-04-05 17:24:42,339 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:42,340 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 18 treesize of output 24 [2018-04-05 17:24:42,340 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:42,432 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:42,484 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 1 case distinctions, treesize of input 27 treesize of output 29 [2018-04-05 17:24:42,490 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:42,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 24 [2018-04-05 17:24:42,583 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-04-05 17:24:42,607 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:42,608 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 24 treesize of output 15 [2018-04-05 17:24:42,608 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:42,619 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 10 treesize of output 3 [2018-04-05 17:24:42,620 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:42,632 INFO L267 ElimStorePlain]: Start of recursive call 34: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:24:42,636 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 41 treesize of output 38 [2018-04-05 17:24:42,640 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 16 treesize of output 20 [2018-04-05 17:24:42,656 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 1 [2018-04-05 17:24:42,656 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:42,658 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-05 17:24:42,658 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:42,661 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:42,671 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:42,671 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 5 [2018-04-05 17:24:42,671 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:42,680 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:42,712 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:24:42,716 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2018-04-05 17:24:42,767 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 43 treesize of output 43 [2018-04-05 17:24:42,771 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:42,771 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 39 treesize of output 42 [2018-04-05 17:24:42,772 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:42,780 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:42,782 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 23 treesize of output 26 [2018-04-05 17:24:42,785 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:42,785 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 24 [2018-04-05 17:24:42,786 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:42,792 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:24:42,821 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 41 treesize of output 35 [2018-04-05 17:24:42,823 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:42,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 55 [2018-04-05 17:24:42,904 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:42,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2018-04-05 17:24:42,910 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 2 xjuncts. [2018-04-05 17:24:42,912 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-05 17:24:42,912 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:42,953 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:42,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 46 [2018-04-05 17:24:42,978 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 2 xjuncts. [2018-04-05 17:24:43,074 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:43,075 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:43,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-04-05 17:24:43,077 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:43,096 INFO L267 ElimStorePlain]: Start of recursive call 49: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-05 17:24:43,111 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-05 17:24:43,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 29 [2018-04-05 17:24:43,123 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:43,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 24 [2018-04-05 17:24:43,138 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 2 xjuncts. [2018-04-05 17:24:43,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-05 17:24:43,156 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:43,169 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:24:43,170 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 18 treesize of output 9 [2018-04-05 17:24:43,170 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:43,179 INFO L267 ElimStorePlain]: Start of recursive call 54: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:24:43,210 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-05 17:24:43,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 11 xjuncts. [2018-04-05 17:24:43,351 INFO L202 ElimStorePlain]: Needed 57 recursive calls to eliminate 5 variables, input treesize:144, output treesize:247 [2018-04-05 17:24:46,437 WARN L151 SmtUtils]: Spent 3000ms on a formula simplification. DAG size of input: 71 DAG size of output 69 [2018-04-05 17:24:47,738 WARN L151 SmtUtils]: Spent 1043ms on a formula simplification. DAG size of input: 69 DAG size of output 69 [2018-04-05 17:24:47,751 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 31 treesize of output 34 [2018-04-05 17:24:47,785 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-04-05 17:24:47,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-05 17:24:47,789 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 11 treesize of output 4 [2018-04-05 17:24:47,789 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:47,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:24:47,945 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 26 treesize of output 29 [2018-04-05 17:24:48,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-04-05 17:24:48,154 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-05 17:24:48,157 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 11 treesize of output 4 [2018-04-05 17:24:48,158 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:48,349 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:24:48,460 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 33 treesize of output 36 [2018-04-05 17:24:48,493 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-04-05 17:24:48,494 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-05 17:24:48,496 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 11 treesize of output 4 [2018-04-05 17:24:48,496 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:48,517 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:24:48,657 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 29 treesize of output 32 [2018-04-05 17:24:48,697 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-04-05 17:24:48,698 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-05 17:24:48,712 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 11 treesize of output 4 [2018-04-05 17:24:48,713 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-05 17:24:48,731 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:24:48,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-04-05 17:24:48,854 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 10 variables, input treesize:149, output treesize:148 [2018-04-05 17:24:49,296 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:24:49,332 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:24:49,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-04-05 17:24:49,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-05 17:24:49,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-05 17:24:49,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1007, Unknown=1, NotChecked=0, Total=1122 [2018-04-05 17:24:49,334 INFO L87 Difference]: Start difference. First operand 202 states and 216 transitions. Second operand 34 states. [2018-04-05 17:24:50,630 WARN L151 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 129 DAG size of output 54 [2018-04-05 17:24:51,059 WARN L151 SmtUtils]: Spent 294ms on a formula simplification. DAG size of input: 165 DAG size of output 70 [2018-04-05 17:24:51,532 WARN L151 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 134 DAG size of output 57 [2018-04-05 17:24:51,840 WARN L151 SmtUtils]: Spent 180ms on a formula simplification. DAG size of input: 140 DAG size of output 61 [2018-04-05 17:24:52,223 WARN L151 SmtUtils]: Spent 259ms on a formula simplification. DAG size of input: 152 DAG size of output 66 [2018-04-05 17:24:52,630 WARN L151 SmtUtils]: Spent 264ms on a formula simplification. DAG size of input: 160 DAG size of output 63 [2018-04-05 17:24:53,085 WARN L151 SmtUtils]: Spent 357ms on a formula simplification. DAG size of input: 167 DAG size of output 67 [2018-04-05 17:24:53,356 WARN L151 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 160 DAG size of output 61 [2018-04-05 17:24:53,824 WARN L151 SmtUtils]: Spent 294ms on a formula simplification. DAG size of input: 152 DAG size of output 54 [2018-04-05 17:24:54,414 WARN L151 SmtUtils]: Spent 251ms on a formula simplification. DAG size of input: 153 DAG size of output 67 [2018-04-05 17:24:54,802 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 117 DAG size of output 38 [2018-04-05 17:24:55,097 WARN L151 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 123 DAG size of output 54 [2018-04-05 17:24:57,913 WARN L148 SmtUtils]: Spent 356ms on a formula simplification that was a NOOP. DAG size: 60 [2018-04-05 17:25:01,906 WARN L151 SmtUtils]: Spent 239ms on a formula simplification. DAG size of input: 98 DAG size of output 69 [2018-04-05 17:25:02,753 WARN L151 SmtUtils]: Spent 182ms on a formula simplification. DAG size of input: 106 DAG size of output 74 [2018-04-05 17:25:03,596 WARN L151 SmtUtils]: Spent 455ms on a formula simplification. DAG size of input: 109 DAG size of output 34 [2018-04-05 17:25:04,015 WARN L151 SmtUtils]: Spent 208ms on a formula simplification. DAG size of input: 117 DAG size of output 52 [2018-04-05 17:25:04,552 WARN L151 SmtUtils]: Spent 247ms on a formula simplification. DAG size of input: 123 DAG size of output 61 [2018-04-05 17:25:05,067 WARN L151 SmtUtils]: Spent 368ms on a formula simplification. DAG size of input: 127 DAG size of output 65 [2018-04-05 17:25:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:25:05,543 INFO L93 Difference]: Finished difference Result 285 states and 312 transitions. [2018-04-05 17:25:05,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-05 17:25:05,543 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 57 [2018-04-05 17:25:05,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:25:05,546 INFO L225 Difference]: With dead ends: 285 [2018-04-05 17:25:05,546 INFO L226 Difference]: Without dead ends: 280 [2018-04-05 17:25:05,547 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=826, Invalid=3203, Unknown=3, NotChecked=0, Total=4032 [2018-04-05 17:25:05,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-04-05 17:25:05,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 209. [2018-04-05 17:25:05,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-04-05 17:25:05,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 221 transitions. [2018-04-05 17:25:05,569 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 221 transitions. Word has length 57 [2018-04-05 17:25:05,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:25:05,570 INFO L459 AbstractCegarLoop]: Abstraction has 209 states and 221 transitions. [2018-04-05 17:25:05,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-05 17:25:05,570 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 221 transitions. [2018-04-05 17:25:05,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-05 17:25:05,571 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:25:05,571 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:25:05,571 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-05 17:25:05,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1546292785, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:25:05,582 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:25:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:25:05,626 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:25:05,715 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base|)) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| 1)))) is different from true [2018-04-05 17:25:05,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:25:05,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:25:05,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-05 17:25:05,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:25:05,779 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-05 17:25:05,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-05 17:25:05,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-04-05 17:25:05,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:25:05,997 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-05 17:25:05,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:20 [2018-04-05 17:25:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-05 17:25:06,058 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:25:06,381 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-05 17:25:06,382 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 2 variables, input treesize:21, output treesize:1 [2018-04-05 17:25:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:25:06,436 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:25:06,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-04-05 17:25:06,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-05 17:25:06,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-05 17:25:06,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=221, Unknown=1, NotChecked=30, Total=306 [2018-04-05 17:25:06,437 INFO L87 Difference]: Start difference. First operand 209 states and 221 transitions. Second operand 18 states. [2018-04-05 17:25:12,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:25:12,538 INFO L93 Difference]: Finished difference Result 266 states and 276 transitions. [2018-04-05 17:25:12,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-05 17:25:12,538 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2018-04-05 17:25:12,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:25:12,541 INFO L225 Difference]: With dead ends: 266 [2018-04-05 17:25:12,541 INFO L226 Difference]: Without dead ends: 264 [2018-04-05 17:25:12,541 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 97 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=133, Invalid=470, Unknown=1, NotChecked=46, Total=650 [2018-04-05 17:25:12,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-04-05 17:25:12,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 211. [2018-04-05 17:25:12,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-04-05 17:25:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 225 transitions. [2018-04-05 17:25:12,586 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 225 transitions. Word has length 58 [2018-04-05 17:25:12,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:25:12,586 INFO L459 AbstractCegarLoop]: Abstraction has 211 states and 225 transitions. [2018-04-05 17:25:12,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-05 17:25:12,587 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 225 transitions. [2018-04-05 17:25:12,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-05 17:25:12,590 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:25:12,590 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:25:12,590 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-05 17:25:12,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1546292784, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:25:12,610 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:25:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:25:12,655 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:25:12,692 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| Int)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| 9))) is different from true [2018-04-05 17:25:12,734 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 14 treesize of output 20 [2018-04-05 17:25:12,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-05 17:25:12,748 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-05 17:25:12,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:19 [2018-04-05 17:25:12,988 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 33 [2018-04-05 17:25:12,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-05 17:25:13,036 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-05 17:25:13,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-04-05 17:25:13,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-05 17:25:13,099 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:25:31,893 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:25:31,900 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 37 [2018-04-05 17:25:31,992 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:25:31,993 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:25:31,993 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-05 17:25:31,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:25:32,007 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 18 treesize of output 8 [2018-04-05 17:25:32,007 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 17:25:32,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:25:32,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:25:32,025 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-04-05 17:25:32,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:25:32,113 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:25:32,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-04-05 17:25:32,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-05 17:25:32,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-05 17:25:32,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=278, Unknown=10, NotChecked=34, Total=380 [2018-04-05 17:25:32,114 INFO L87 Difference]: Start difference. First operand 211 states and 225 transitions. Second operand 20 states. [2018-04-05 17:25:43,711 WARN L148 SmtUtils]: Spent 366ms on a formula simplification that was a NOOP. DAG size: 25 [2018-04-05 17:26:01,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:26:01,041 INFO L93 Difference]: Finished difference Result 214 states and 225 transitions. [2018-04-05 17:26:01,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-05 17:26:01,044 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 58 [2018-04-05 17:26:01,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:26:01,046 INFO L225 Difference]: With dead ends: 214 [2018-04-05 17:26:01,046 INFO L226 Difference]: Without dead ends: 212 [2018-04-05 17:26:01,047 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=120, Invalid=570, Unknown=16, NotChecked=50, Total=756 [2018-04-05 17:26:01,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-05 17:26:01,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 209. [2018-04-05 17:26:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-04-05 17:26:01,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 223 transitions. [2018-04-05 17:26:01,074 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 223 transitions. Word has length 58 [2018-04-05 17:26:01,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:26:01,077 INFO L459 AbstractCegarLoop]: Abstraction has 209 states and 223 transitions. [2018-04-05 17:26:01,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-05 17:26:01,077 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 223 transitions. [2018-04-05 17:26:01,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-05 17:26:01,078 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:26:01,079 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:26:01,079 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-05 17:26:01,079 INFO L82 PathProgramCache]: Analyzing trace with hash -2083974182, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:26:01,089 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:26:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:26:01,123 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:26:01,173 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:26:01,175 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 14 treesize of output 17 [2018-04-05 17:26:01,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:01,187 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:26:01,187 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:26:01,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-05 17:26:01,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:01,196 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-05 17:26:01,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:27 [2018-04-05 17:26:01,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:26:01,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:26:01,247 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 19 treesize of output 30 [2018-04-05 17:26:01,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:01,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:26:01,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:26:01,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:26:01,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-05 17:26:01,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:01,273 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-05 17:26:01,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:30 [2018-04-05 17:26:01,355 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:26:01,355 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:26:01,863 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:26:01,872 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 34 [2018-04-05 17:26:01,918 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 4 [2018-04-05 17:26:01,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:01,932 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:26:01,933 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:26:01,934 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-04-05 17:26:01,934 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:01,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:26:01,957 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 2 xjuncts. [2018-04-05 17:26:01,957 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:33 [2018-04-05 17:26:02,022 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:02,023 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-04-05 17:26:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:26:02,090 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:26:02,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-04-05 17:26:02,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-05 17:26:02,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-05 17:26:02,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=433, Unknown=1, NotChecked=0, Total=506 [2018-04-05 17:26:02,092 INFO L87 Difference]: Start difference. First operand 209 states and 223 transitions. Second operand 23 states. [2018-04-05 17:26:04,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:26:04,704 INFO L93 Difference]: Finished difference Result 258 states and 268 transitions. [2018-04-05 17:26:04,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-05 17:26:04,705 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 61 [2018-04-05 17:26:04,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:26:04,707 INFO L225 Difference]: With dead ends: 258 [2018-04-05 17:26:04,707 INFO L226 Difference]: Without dead ends: 256 [2018-04-05 17:26:04,708 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=130, Invalid=625, Unknown=1, NotChecked=0, Total=756 [2018-04-05 17:26:04,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-04-05 17:26:04,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 203. [2018-04-05 17:26:04,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-05 17:26:04,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 215 transitions. [2018-04-05 17:26:04,731 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 215 transitions. Word has length 61 [2018-04-05 17:26:04,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:26:04,731 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 215 transitions. [2018-04-05 17:26:04,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-05 17:26:04,731 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 215 transitions. [2018-04-05 17:26:04,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-05 17:26:04,744 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:26:04,745 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:26:04,745 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-05 17:26:04,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1651039156, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:26:04,783 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:26:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:26:04,851 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:26:05,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:26:05,388 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:26:05,389 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-05 17:26:05,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:05,405 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-05 17:26:05,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:05,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:26:05,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-05 17:26:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:26:05,547 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:26:05,905 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 13 treesize of output 9 [2018-04-05 17:26:05,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:05,917 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:26:05,918 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:26:05,918 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 13 treesize of output 3 [2018-04-05 17:26:05,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:05,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:26:05,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:3 [2018-04-05 17:26:06,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2018-04-05 17:26:06,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-05 17:26:06,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-05 17:26:06,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:29 [2018-04-05 17:26:06,132 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:26:06,150 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:26:06,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-04-05 17:26:06,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:06,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:26:06,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2018-04-05 17:26:06,225 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:26:06,260 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:26:06,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2018-04-05 17:26:06,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-05 17:26:06,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-05 17:26:06,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-04-05 17:26:06,262 INFO L87 Difference]: Start difference. First operand 203 states and 215 transitions. Second operand 20 states. [2018-04-05 17:26:07,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:26:07,803 INFO L93 Difference]: Finished difference Result 219 states and 231 transitions. [2018-04-05 17:26:07,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-05 17:26:07,804 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-04-05 17:26:07,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:26:07,806 INFO L225 Difference]: With dead ends: 219 [2018-04-05 17:26:07,806 INFO L226 Difference]: Without dead ends: 218 [2018-04-05 17:26:07,807 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2018-04-05 17:26:07,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-05 17:26:07,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 197. [2018-04-05 17:26:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-05 17:26:07,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 208 transitions. [2018-04-05 17:26:07,827 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 208 transitions. Word has length 61 [2018-04-05 17:26:07,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:26:07,828 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 208 transitions. [2018-04-05 17:26:07,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-05 17:26:07,829 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 208 transitions. [2018-04-05 17:26:07,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-05 17:26:07,830 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:26:07,830 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:26:07,831 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-05 17:26:07,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1089881476, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:26:07,846 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:26:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:26:07,894 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:26:07,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-05 17:26:07,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:07,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:26:07,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-05 17:26:08,116 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-05 17:26:08,125 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-05 17:26:08,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:08,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:26:08,152 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-05 17:26:08,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-04-05 17:26:08,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-04-05 17:26:08,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-05 17:26:08,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:08,280 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 21 treesize of output 30 [2018-04-05 17:26:08,281 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-05 17:26:08,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:26:08,360 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 2 xjuncts. [2018-04-05 17:26:08,360 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:44, output treesize:77 [2018-04-05 17:26:08,856 WARN L151 SmtUtils]: Spent 240ms on a formula simplification. DAG size of input: 37 DAG size of output 37 [2018-04-05 17:26:08,888 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 71 [2018-04-05 17:26:08,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:26:08,940 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 3 case distinctions, treesize of input 54 treesize of output 60 [2018-04-05 17:26:08,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-05 17:26:09,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:26:09,034 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 57 treesize of output 72 [2018-04-05 17:26:09,034 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:09,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:26:09,187 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 41 treesize of output 36 [2018-04-05 17:26:09,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:26:09,192 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 27 [2018-04-05 17:26:09,192 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:09,206 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:26:09,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-05 17:26:09,267 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:116, output treesize:141 [2018-04-05 17:26:09,392 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-05 17:26:09,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:09,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:26:09,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:26:09,430 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 17 treesize of output 10 [2018-04-05 17:26:09,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:09,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-05 17:26:09,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:165, output treesize:66 [2018-04-05 17:26:09,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:26:09,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:26:09,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:26:09,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-05 17:26:09,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:09,672 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-05 17:26:09,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:77, output treesize:85 [2018-04-05 17:26:09,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-04-05 17:26:09,869 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-05 17:26:09,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:10,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:26:10,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-05 17:26:10,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:85 [2018-04-05 17:26:10,185 INFO L303 Elim1Store]: Index analysis took 137 ms [2018-04-05 17:26:10,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-04-05 17:26:10,197 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-05 17:26:10,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:10,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:26:10,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-05 17:26:10,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:98, output treesize:94 [2018-04-05 17:26:10,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65 [2018-04-05 17:26:10,335 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:26:10,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2018-04-05 17:26:10,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:10,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:26:10,355 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-05 17:26:10,355 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:10,367 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 7 treesize of output 1 [2018-04-05 17:26:10,367 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:10,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:26:10,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-05 17:26:10,390 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:103, output treesize:28 [2018-04-05 17:26:10,468 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:26:10,469 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:26:11,198 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:26:11,200 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:26:11,235 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:26:11,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 292 [2018-04-05 17:26:11,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:11,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 174 [2018-04-05 17:26:11,663 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 11 treesize of output 10 [2018-04-05 17:26:11,663 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:11,745 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 122 [2018-04-05 17:26:11,935 WARN L151 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 110 DAG size of output 65 [2018-04-05 17:26:11,961 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 50 treesize of output 62 [2018-04-05 17:26:11,965 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:26:11,966 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 53 treesize of output 61 [2018-04-05 17:26:11,966 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:12,013 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:26:12,033 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 3 case distinctions, treesize of input 50 treesize of output 69 [2018-04-05 17:26:12,034 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-05 17:26:12,120 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:26:12,234 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 57 treesize of output 60 [2018-04-05 17:26:12,238 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:26:12,239 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 28 [2018-04-05 17:26:12,239 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:12,260 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:26:12,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 49 [2018-04-05 17:26:12,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 17 [2018-04-05 17:26:12,368 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:12,380 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:26:12,380 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 17 treesize of output 7 [2018-04-05 17:26:12,381 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-05 17:26:12,387 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:26:12,525 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2018-04-05 17:26:12,529 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:26:12,541 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:26:12,546 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:26:12,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 72 [2018-04-05 17:26:12,572 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-04-05 17:26:12,637 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:26:12,641 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2018-04-05 17:26:12,644 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:26:12,646 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:26:12,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2018-04-05 17:26:12,655 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-04-05 17:26:12,679 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:26:12,682 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2018-04-05 17:26:12,686 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:26:12,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2018-04-05 17:26:12,725 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-04-05 17:26:12,744 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:26:12,891 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-05 17:26:12,932 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-05 17:26:13,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-05 17:26:13,002 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 8 variables, input treesize:131, output treesize:59 [2018-04-05 17:26:13,380 WARN L152 XnfTransformerHelper]: Simplifying disjunction of 7225 conjuctions. This might take some time... [2018-04-05 17:26:17,591 INFO L170 XnfTransformerHelper]: Simplified to disjunction of 7225 conjuctions. [2018-04-05 17:26:18,813 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7225 Received shutdown request... [2018-04-05 17:28:27,392 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-05 17:28:27,393 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-05 17:28:27,399 WARN L197 ceAbstractionStarter]: Timeout [2018-04-05 17:28:27,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 05:28:27 BoogieIcfgContainer [2018-04-05 17:28:27,399 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-05 17:28:27,400 INFO L168 Benchmark]: Toolchain (without parser) took 258128.65 ms. Allocated memory was 308.8 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 246.3 MB in the beginning and 1.1 GB in the end (delta: -827.1 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-04-05 17:28:27,401 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 308.8 MB. Free memory is still 270.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-05 17:28:27,402 INFO L168 Benchmark]: CACSL2BoogieTranslator took 530.99 ms. Allocated memory is still 308.8 MB. Free memory was 246.3 MB in the beginning and 220.1 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 5.3 GB. [2018-04-05 17:28:27,402 INFO L168 Benchmark]: Boogie Preprocessor took 103.23 ms. Allocated memory is still 308.8 MB. Free memory was 220.1 MB in the beginning and 217.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-05 17:28:27,402 INFO L168 Benchmark]: RCFGBuilder took 1348.95 ms. Allocated memory was 308.8 MB in the beginning and 450.4 MB in the end (delta: 141.6 MB). Free memory was 217.1 MB in the beginning and 366.1 MB in the end (delta: -149.0 MB). Peak memory consumption was 19.1 MB. Max. memory is 5.3 GB. [2018-04-05 17:28:27,402 INFO L168 Benchmark]: TraceAbstraction took 256139.86 ms. Allocated memory was 450.4 MB in the beginning and 1.7 GB in the end (delta: 1.2 GB). Free memory was 366.1 MB in the beginning and 1.1 GB in the end (delta: -707.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-04-05 17:28:27,404 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.29 ms. Allocated memory is still 308.8 MB. Free memory is still 270.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 530.99 ms. Allocated memory is still 308.8 MB. Free memory was 246.3 MB in the beginning and 220.1 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 103.23 ms. Allocated memory is still 308.8 MB. Free memory was 220.1 MB in the beginning and 217.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 1348.95 ms. Allocated memory was 308.8 MB in the beginning and 450.4 MB in the end (delta: 141.6 MB). Free memory was 217.1 MB in the beginning and 366.1 MB in the end (delta: -149.0 MB). Peak memory consumption was 19.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 256139.86 ms. Allocated memory was 450.4 MB in the beginning and 1.7 GB in the end (delta: 1.2 GB). Free memory was 366.1 MB in the beginning and 1.1 GB in the end (delta: -707.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 541]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 541]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 559]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 575]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 576]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 576). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 580]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 582]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 575]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 580]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 583]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 583). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 583]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 583). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 582]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 573]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 573]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 559]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 576]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 576). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 7225 disjunction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 180 locations, 55 error locations. TIMEOUT Result, 256.0s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 71.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2116 SDtfs, 4954 SDslu, 11467 SDs, 0 SdLazy, 6400 SolverSat, 441 SolverUnsat, 34 SolverUnknown, 0 SolverNotchecked, 39.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1228 GetRequests, 921 SyntacticMatches, 20 SemanticMatches, 287 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1803 ImplicationChecksByTransitivity, 62.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219occurred in iteration=8, 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.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 668 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 43.4s InterpolantComputationTime, 568 NumberOfCodeBlocks, 568 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1104 ConstructedInterpolants, 353 QuantifiedInterpolants, 941098 SizeOfPredicates, 131 NumberOfNonLiveVariables, 2384 ConjunctsInSsa, 290 ConjunctsInUnsatCore, 32 InterpolantComputations, 22 PerfectInterpolantSequences, 14/98 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-05_17-28-27-414.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-05_17-28-27-414.csv Completed graceful shutdown