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/list-ext-properties/960521-1_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-835382a-m [2018-04-05 17:32:43,367 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-05 17:32:43,369 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-05 17:32:43,384 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-05 17:32:43,384 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-05 17:32:43,385 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-05 17:32:43,387 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-05 17:32:43,388 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-05 17:32:43,391 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-05 17:32:43,392 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-05 17:32:43,393 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-05 17:32:43,393 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-05 17:32:43,394 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-05 17:32:43,395 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-05 17:32:43,396 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-05 17:32:43,399 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-05 17:32:43,401 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-05 17:32:43,403 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-05 17:32:43,404 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-05 17:32:43,405 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-05 17:32:43,408 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-05 17:32:43,408 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-05 17:32:43,408 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-05 17:32:43,409 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-05 17:32:43,410 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-05 17:32:43,412 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-05 17:32:43,412 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-05 17:32:43,413 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-05 17:32:43,413 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-05 17:32:43,414 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-05 17:32:43,414 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-05 17:32:43,415 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:32:43,440 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-05 17:32:43,441 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-05 17:32:43,441 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-05 17:32:43,441 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-05 17:32:43,442 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-05 17:32:43,442 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-05 17:32:43,442 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-05 17:32:43,443 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-05 17:32:43,443 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-05 17:32:43,443 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-05 17:32:43,443 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-05 17:32:43,444 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-05 17:32:43,444 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-05 17:32:43,444 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-05 17:32:43,444 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-05 17:32:43,444 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-05 17:32:43,445 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-05 17:32:43,445 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-05 17:32:43,445 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-05 17:32:43,445 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-05 17:32:43,445 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-05 17:32:43,446 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-05 17:32:43,446 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-05 17:32:43,446 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-05 17:32:43,446 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-05 17:32:43,446 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-05 17:32:43,447 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-05 17:32:43,447 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-05 17:32:43,447 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-05 17:32:43,447 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-05 17:32:43,447 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-05 17:32:43,447 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:32:43,448 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-05 17:32:43,448 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-05 17:32:43,449 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-05 17:32:43,449 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-05 17:32:43,449 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-05 17:32:43,485 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-05 17:32:43,499 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-05 17:32:43,503 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-05 17:32:43,505 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-05 17:32:43,506 INFO L276 PluginConnector]: CDTParser initialized [2018-04-05 17:32:43,506 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:43,847 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3d375aaf0 [2018-04-05 17:32:44,029 INFO L287 CDTParser]: IsIndexed: true [2018-04-05 17:32:44,030 INFO L288 CDTParser]: Found 1 translation units. [2018-04-05 17:32:44,030 INFO L168 CDTParser]: Scanning 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,043 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-05 17:32:44,043 INFO L215 ultiparseSymbolTable]: [2018-04-05 17:32:44,043 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-05 17:32:44,043 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,043 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_f___________true_valid_memsafety_i__foo ('foo') in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,043 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-05 17:32:44,044 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____uint8_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,044 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____daddr_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,044 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____key_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,044 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__u_int8_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,044 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____u_int in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,044 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__loff_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,045 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__quad_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,045 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____clockid_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,045 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__clockid_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,045 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____blkcnt_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,045 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____fd_mask in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,045 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__fsid_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,045 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__int64_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,045 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,046 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__u_int16_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,046 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_cond_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,046 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_spinlock_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,046 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__id_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,046 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____clock_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,046 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____WAIT_STATUS in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,046 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__dev_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,046 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_condattr_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,047 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_attr_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,047 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____u_quad_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,047 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____pid_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,047 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__ushort in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,047 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____quad_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,047 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____fsblkcnt64_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,047 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__wchar_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,047 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__register_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,047 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____int64_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,047 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____useconds_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,048 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____swblk_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,048 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_barrier_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,048 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____nlink_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,048 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__timer_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,048 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__u_int32_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,048 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__sigset_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,048 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____gid_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,048 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____sig_atomic_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,048 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____uid_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,048 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__key_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,048 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____ssize_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,049 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____ino64_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,049 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__int32_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,049 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__nlink_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,049 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__uint in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,049 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____uint64_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,049 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__ssize_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,049 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_rwlockattr_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,049 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____off_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,049 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____blkcnt64_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,049 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__fd_mask in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,049 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__fsfilcnt_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,049 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____suseconds_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,050 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__time_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,050 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____rlim64_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,050 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__caddr_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,050 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____id_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,050 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_rwlock_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,050 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____qaddr_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,050 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__u_int in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,050 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____blksize_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,051 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__blksize_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,051 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____int32_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,051 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__div_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,051 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____uint32_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,051 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__fsblkcnt_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,051 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____timer_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,051 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____off64_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,051 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____time_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,051 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____intptr_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,052 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_mutexattr_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,052 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__u_quad_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,052 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__size_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,052 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____fsfilcnt_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,052 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__n in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,052 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____u_char in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,052 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__int16_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,052 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____fsblkcnt_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,052 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__int8_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,053 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_key_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,053 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__lldiv_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,053 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____rlim_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,053 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____socklen_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,053 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__uid_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,053 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____pthread_list_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,053 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_barrierattr_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,053 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__b in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,053 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__a in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,054 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__ldiv_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,054 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____fsfilcnt64_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,054 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_mutex_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,054 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__ino_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,054 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__u_short in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,054 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__off_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,054 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__gid_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,054 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____int8_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,054 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__u_char in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__blkcnt_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__u_int64_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____uint16_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__daddr_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____mode_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pthread_once_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____u_long in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,056 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____int16_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,056 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____caddr_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,056 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____ino_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,056 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____dev_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,056 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____loff_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,056 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____sigset_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,056 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__fd_set in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,056 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____u_short in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,057 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i____fsid_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,057 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__clock_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,057 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__suseconds_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,057 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__mode_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,057 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__ulong in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,057 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__u_long in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,057 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f___________true_valid_memsafety_i__pid_t in 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:44,078 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3d375aaf0 [2018-04-05 17:32:44,083 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-05 17:32:44,085 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-05 17:32:44,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-05 17:32:44,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-05 17:32:44,092 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-05 17:32:44,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 05:32:44" (1/1) ... [2018-04-05 17:32:44,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@426d4868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:32:44, skipping insertion in model container [2018-04-05 17:32:44,095 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 05:32:44" (1/1) ... [2018-04-05 17:32:44,110 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-05 17:32:44,141 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-05 17:32:44,325 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-05 17:32:44,380 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-05 17:32:44,388 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-05 17:32:44,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:32:44 WrapperNode [2018-04-05 17:32:44,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-05 17:32:44,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-05 17:32:44,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-05 17:32:44,433 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-05 17:32:44,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:32:44" (1/1) ... [2018-04-05 17:32:44,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:32:44" (1/1) ... [2018-04-05 17:32:44,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:32:44" (1/1) ... [2018-04-05 17:32:44,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:32:44" (1/1) ... [2018-04-05 17:32:44,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:32:44" (1/1) ... [2018-04-05 17:32:44,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:32:44" (1/1) ... [2018-04-05 17:32:44,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:32:44" (1/1) ... [2018-04-05 17:32:44,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-05 17:32:44,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-05 17:32:44,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-05 17:32:44,488 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-05 17:32:44,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:32:44" (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:32:44,623 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-05 17:32:44,623 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-05 17:32:44,623 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f___________true_valid_memsafety_i__foo [2018-04-05 17:32:44,623 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-05 17:32:44,623 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-05 17:32:44,623 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-05 17:32:44,624 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-05 17:32:44,624 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-05 17:32:44,624 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-05 17:32:44,624 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-05 17:32:44,624 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-05 17:32:44,624 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-05 17:32:44,624 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-05 17:32:44,625 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-05 17:32:44,625 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-05 17:32:44,625 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-05 17:32:44,625 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-05 17:32:44,625 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-05 17:32:44,625 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-05 17:32:44,625 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-05 17:32:44,626 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-05 17:32:44,626 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-05 17:32:44,626 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-05 17:32:44,626 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-05 17:32:44,626 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-05 17:32:44,626 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-05 17:32:44,626 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-05 17:32:44,626 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-05 17:32:44,626 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-05 17:32:44,626 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-05 17:32:44,627 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-05 17:32:44,627 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-05 17:32:44,627 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-05 17:32:44,627 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-05 17:32:44,627 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-05 17:32:44,627 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-05 17:32:44,627 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-05 17:32:44,627 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-05 17:32:44,628 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-05 17:32:44,628 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-05 17:32:44,628 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-05 17:32:44,628 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-05 17:32:44,628 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-05 17:32:44,628 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-05 17:32:44,629 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-05 17:32:44,630 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-05 17:32:44,630 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-05 17:32:44,630 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-05 17:32:44,630 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-05 17:32:44,630 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-05 17:32:44,631 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-05 17:32:44,631 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-05 17:32:44,631 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-05 17:32:44,631 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-05 17:32:44,631 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-05 17:32:44,631 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-05 17:32:44,631 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-05 17:32:44,632 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-05 17:32:44,632 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-05 17:32:44,632 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-05 17:32:44,632 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-05 17:32:44,632 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-05 17:32:44,632 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-05 17:32:44,632 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-05 17:32:44,632 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-05 17:32:44,633 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-05 17:32:44,633 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-05 17:32:44,633 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-05 17:32:44,633 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-05 17:32:44,633 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-05 17:32:44,633 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-05 17:32:44,633 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-05 17:32:44,634 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-05 17:32:44,634 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-05 17:32:44,634 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-05 17:32:44,634 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-05 17:32:44,634 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-05 17:32:44,634 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-05 17:32:44,634 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-05 17:32:44,634 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-05 17:32:44,635 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-05 17:32:44,635 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-05 17:32:44,635 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-05 17:32:44,635 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-05 17:32:44,635 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-05 17:32:44,635 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-05 17:32:44,635 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-05 17:32:44,636 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-05 17:32:44,636 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-05 17:32:44,636 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-05 17:32:44,636 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-05 17:32:44,636 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-05 17:32:44,636 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-05 17:32:44,636 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-05 17:32:44,636 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-05 17:32:44,637 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-05 17:32:44,637 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-05 17:32:44,637 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-05 17:32:44,637 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-05 17:32:44,637 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-05 17:32:44,637 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-05 17:32:44,637 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-05 17:32:44,638 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-05 17:32:44,638 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-05 17:32:44,638 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-05 17:32:44,638 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-05 17:32:44,638 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-05 17:32:44,638 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_f___________true_valid_memsafety_i__foo [2018-04-05 17:32:44,638 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-05 17:32:44,638 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-05 17:32:44,639 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-05 17:32:44,639 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-05 17:32:44,639 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-05 17:32:44,639 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-05 17:32:44,639 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-05 17:32:44,639 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-05 17:32:45,047 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-05 17:32:45,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:32:45 BoogieIcfgContainer [2018-04-05 17:32:45,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-05 17:32:45,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-05 17:32:45,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-05 17:32:45,052 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-05 17:32:45,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 05:32:44" (1/3) ... [2018-04-05 17:32:45,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0189cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 05:32:45, skipping insertion in model container [2018-04-05 17:32:45,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:32:44" (2/3) ... [2018-04-05 17:32:45,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0189cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 05:32:45, skipping insertion in model container [2018-04-05 17:32:45,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:32:45" (3/3) ... [2018-04-05 17:32:45,055 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_1_true-valid-memsafety.i [2018-04-05 17:32:45,064 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-05 17:32:45,072 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-04-05 17:32:45,109 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-05 17:32:45,109 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-05 17:32:45,109 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-05 17:32:45,109 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-05 17:32:45,109 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-05 17:32:45,110 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-05 17:32:45,110 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-05 17:32:45,110 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-05 17:32:45,110 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-05 17:32:45,110 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-05 17:32:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2018-04-05 17:32:45,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-05 17:32:45,133 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:32:45,134 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:32:45,134 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:32:45,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1281560952, 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:32:45,161 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:32:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:32:45,215 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:32:45,231 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:32:45,232 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:32:45,250 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:32:45,274 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:32:45,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-05 17:32:45,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-05 17:32:45,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-05 17:32:45,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-05 17:32:45,289 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 2 states. [2018-04-05 17:32:45,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:32:45,317 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2018-04-05 17:32:45,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-05 17:32:45,319 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-04-05 17:32:45,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:32:45,328 INFO L225 Difference]: With dead ends: 156 [2018-04-05 17:32:45,328 INFO L226 Difference]: Without dead ends: 84 [2018-04-05 17:32:45,333 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-05 17:32:45,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-05 17:32:45,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-04-05 17:32:45,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-05 17:32:45,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-04-05 17:32:45,375 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 18 [2018-04-05 17:32:45,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:32:45,375 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2018-04-05 17:32:45,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-05 17:32:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-04-05 17:32:45,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-05 17:32:45,376 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:32:45,376 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] [2018-04-05 17:32:45,376 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:32:45,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1181244051, 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:32:45,383 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:32:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:32:45,413 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:32:45,452 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:32:45,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:45,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:32:45,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-05 17:32:45,550 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:32:45,550 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:32:45,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:32:45,600 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:32:45,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-05 17:32:45,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-05 17:32:45,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-05 17:32:45,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-05 17:32:45,602 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 5 states. [2018-04-05 17:32:45,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:32:45,722 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-04-05 17:32:45,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-05 17:32:45,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-04-05 17:32:45,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:32:45,724 INFO L225 Difference]: With dead ends: 84 [2018-04-05 17:32:45,724 INFO L226 Difference]: Without dead ends: 80 [2018-04-05 17:32:45,727 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-05 17:32:45,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-05 17:32:45,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-04-05 17:32:45,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-04-05 17:32:45,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-04-05 17:32:45,738 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 21 [2018-04-05 17:32:45,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:32:45,738 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-04-05 17:32:45,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-05 17:32:45,739 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-04-05 17:32:45,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-05 17:32:45,740 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:32:45,740 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] [2018-04-05 17:32:45,740 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:32:45,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1181244052, 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:32:45,748 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:32:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:32:45,798 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:32:45,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-05 17:32:45,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:45,851 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:32:45,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-05 17:32:45,975 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:32:45,975 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:32:46,087 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:32:46,125 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:32:46,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-05 17:32:46,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-05 17:32:46,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-05 17:32:46,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-05 17:32:46,126 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 9 states. [2018-04-05 17:32:46,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:32:46,475 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2018-04-05 17:32:46,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-05 17:32:46,476 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-04-05 17:32:46,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:32:46,478 INFO L225 Difference]: With dead ends: 149 [2018-04-05 17:32:46,478 INFO L226 Difference]: Without dead ends: 148 [2018-04-05 17:32:46,479 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-05 17:32:46,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-05 17:32:46,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 91. [2018-04-05 17:32:46,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-04-05 17:32:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-04-05 17:32:46,494 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 21 [2018-04-05 17:32:46,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:32:46,495 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-04-05 17:32:46,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-05 17:32:46,495 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-04-05 17:32:46,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-05 17:32:46,496 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:32:46,496 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:32:46,496 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:32:46,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1417984840, 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:32:46,507 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:32:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:32:46,543 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:32:46,563 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:32:46,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:46,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:32:46,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-05 17:32:46,689 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:32:46,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:46,696 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:32:46,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-05 17:32:46,702 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:32:46,702 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:32:46,731 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:32:46,752 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:32:46,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-05 17:32:46,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-05 17:32:46,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-05 17:32:46,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-05 17:32:46,753 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 4 states. [2018-04-05 17:32:46,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:32:46,815 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-04-05 17:32:46,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-05 17:32:46,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-04-05 17:32:46,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:32:46,816 INFO L225 Difference]: With dead ends: 91 [2018-04-05 17:32:46,816 INFO L226 Difference]: Without dead ends: 88 [2018-04-05 17:32:46,817 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 2 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:32:46,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-05 17:32:46,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-04-05 17:32:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-05 17:32:46,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-04-05 17:32:46,826 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 28 [2018-04-05 17:32:46,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:32:46,826 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-04-05 17:32:46,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-05 17:32:46,826 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-04-05 17:32:46,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-05 17:32:46,827 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:32:46,828 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:32:46,828 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:32:46,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1417984841, 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:32:46,836 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:32:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:32:46,857 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:32:46,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 6 treesize of output 5 [2018-04-05 17:32:46,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:46,880 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:32:46,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:46,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:32:46,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-04-05 17:32:46,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:32:46,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:32:46,931 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:32:46,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:46,945 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 19 [2018-04-05 17:32:46,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:46,953 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:32:46,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-05 17:32:47,093 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:32:47,093 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:32:47,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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:32:47,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:47,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-04-05 17:32:47,203 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 8 treesize of output 1 [2018-04-05 17:32:47,203 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:47,204 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:32:47,207 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:32:47,207 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-04-05 17:32:47,216 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:32:47,237 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:32:47,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [] total 12 [2018-04-05 17:32:47,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-05 17:32:47,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-05 17:32:47,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-04-05 17:32:47,239 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 13 states. [2018-04-05 17:32:49,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:32:49,843 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2018-04-05 17:32:49,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-05 17:32:49,844 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-04-05 17:32:49,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:32:49,847 INFO L225 Difference]: With dead ends: 194 [2018-04-05 17:32:49,848 INFO L226 Difference]: Without dead ends: 153 [2018-04-05 17:32:49,848 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=117, Invalid=301, Unknown=2, NotChecked=0, Total=420 [2018-04-05 17:32:49,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-05 17:32:49,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 119. [2018-04-05 17:32:49,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-04-05 17:32:49,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2018-04-05 17:32:49,860 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 28 [2018-04-05 17:32:49,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:32:49,860 INFO L459 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2018-04-05 17:32:49,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-05 17:32:49,861 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2018-04-05 17:32:49,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-05 17:32:49,861 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:32:49,861 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:32:49,862 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:32:49,862 INFO L82 PathProgramCache]: Analyzing trace with hash -922220228, 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:32:49,872 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:32:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:32:49,893 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:32:49,908 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:32:49,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:49,912 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:32:49,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-05 17:32:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:32:49,947 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:32:50,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:32:50,022 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:32:50,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2018-04-05 17:32:50,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-05 17:32:50,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-05 17:32:50,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-04-05 17:32:50,023 INFO L87 Difference]: Start difference. First operand 119 states and 130 transitions. Second operand 13 states. [2018-04-05 17:32:50,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:32:50,477 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2018-04-05 17:32:50,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-05 17:32:50,477 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-04-05 17:32:50,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:32:50,478 INFO L225 Difference]: With dead ends: 143 [2018-04-05 17:32:50,479 INFO L226 Difference]: Without dead ends: 142 [2018-04-05 17:32:50,479 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2018-04-05 17:32:50,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-05 17:32:50,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 118. [2018-04-05 17:32:50,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-05 17:32:50,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2018-04-05 17:32:50,492 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 28 [2018-04-05 17:32:50,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:32:50,492 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2018-04-05 17:32:50,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-05 17:32:50,493 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2018-04-05 17:32:50,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-05 17:32:50,494 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:32:50,494 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:32:50,494 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:32:50,494 INFO L82 PathProgramCache]: Analyzing trace with hash -718741057, 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:32:50,502 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:32:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:32:50,522 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:32:50,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:32:50,575 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:32:50,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:32:50,621 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:32:50,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2018-04-05 17:32:50,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-05 17:32:50,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-05 17:32:50,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-04-05 17:32:50,622 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand 9 states. [2018-04-05 17:32:50,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:32:50,731 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-04-05 17:32:50,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-05 17:32:50,732 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-04-05 17:32:50,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:32:50,733 INFO L225 Difference]: With dead ends: 180 [2018-04-05 17:32:50,733 INFO L226 Difference]: Without dead ends: 135 [2018-04-05 17:32:50,734 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-04-05 17:32:50,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-05 17:32:50,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 113. [2018-04-05 17:32:50,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-05 17:32:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2018-04-05 17:32:50,746 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 34 [2018-04-05 17:32:50,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:32:50,747 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2018-04-05 17:32:50,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-05 17:32:50,747 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2018-04-05 17:32:50,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-05 17:32:50,748 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:32:50,748 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:32:50,748 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:32:50,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1454719071, 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:32:50,759 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:32:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:32:50,790 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:32:50,814 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:32:50,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:50,838 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:32:50,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:50,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:32:50,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-04-05 17:32:50,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:32:50,882 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 19 [2018-04-05 17:32:50,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:50,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:32:50,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:32:50,907 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:32:50,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:50,921 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:32:50,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-05 17:32:50,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:32:50,999 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:32:51,125 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 10 treesize of output 3 [2018-04-05 17:32:51,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:51,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-04-05 17:32:51,143 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 8 treesize of output 1 [2018-04-05 17:32:51,143 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:51,144 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:32:51,147 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:32:51,147 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-04-05 17:32:51,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:32:51,207 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:32:51,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [] total 16 [2018-04-05 17:32:51,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-05 17:32:51,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-05 17:32:51,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-04-05 17:32:51,208 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 17 states. [2018-04-05 17:32:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:32:52,200 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2018-04-05 17:32:52,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-05 17:32:52,201 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2018-04-05 17:32:52,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:32:52,201 INFO L225 Difference]: With dead ends: 185 [2018-04-05 17:32:52,202 INFO L226 Difference]: Without dead ends: 144 [2018-04-05 17:32:52,202 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=240, Invalid=816, Unknown=0, NotChecked=0, Total=1056 [2018-04-05 17:32:52,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-04-05 17:32:52,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 107. [2018-04-05 17:32:52,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-04-05 17:32:52,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-04-05 17:32:52,211 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 35 [2018-04-05 17:32:52,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:32:52,211 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-04-05 17:32:52,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-05 17:32:52,212 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-04-05 17:32:52,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-05 17:32:52,213 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:32:52,213 INFO L355 BasicCegarLoop]: trace histogram [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:32:52,213 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:32:52,213 INFO L82 PathProgramCache]: Analyzing trace with hash 24206100, 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:32:52,221 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:32:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:32:52,244 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:32:52,258 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:32:52,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:52,267 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:32:52,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-05 17:32:52,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-05 17:32:52,343 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:32:52,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-05 17:32:52,498 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:32:52,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2018-04-05 17:32:52,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-05 17:32:52,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-05 17:32:52,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-04-05 17:32:52,499 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 13 states. [2018-04-05 17:32:52,834 WARN L148 SmtUtils]: Spent 264ms on a formula simplification that was a NOOP. DAG size: 29 [2018-04-05 17:32:53,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:32:53,033 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2018-04-05 17:32:53,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-05 17:32:53,033 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-04-05 17:32:53,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:32:53,034 INFO L225 Difference]: With dead ends: 138 [2018-04-05 17:32:53,034 INFO L226 Difference]: Without dead ends: 136 [2018-04-05 17:32:53,035 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2018-04-05 17:32:53,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-05 17:32:53,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 116. [2018-04-05 17:32:53,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-05 17:32:53,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2018-04-05 17:32:53,045 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 39 [2018-04-05 17:32:53,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:32:53,046 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2018-04-05 17:32:53,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-05 17:32:53,046 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2018-04-05 17:32:53,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-05 17:32:53,047 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:32:53,048 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-05 17:32:53,048 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:32:53,048 INFO L82 PathProgramCache]: Analyzing trace with hash 750389122, 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:32:53,061 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:32:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:32:53,090 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:32:53,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-05 17:32:53,129 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:32:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-05 17:32:53,198 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:32:53,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2018-04-05 17:32:53,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-05 17:32:53,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-05 17:32:53,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-05 17:32:53,200 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 5 states. [2018-04-05 17:32:53,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:32:53,272 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2018-04-05 17:32:53,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-05 17:32:53,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-04-05 17:32:53,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:32:53,274 INFO L225 Difference]: With dead ends: 136 [2018-04-05 17:32:53,274 INFO L226 Difference]: Without dead ends: 135 [2018-04-05 17:32:53,274 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-05 17:32:53,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-05 17:32:53,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 116. [2018-04-05 17:32:53,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-05 17:32:53,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 121 transitions. [2018-04-05 17:32:53,283 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 121 transitions. Word has length 40 [2018-04-05 17:32:53,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:32:53,284 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 121 transitions. [2018-04-05 17:32:53,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-05 17:32:53,284 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2018-04-05 17:32:53,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-05 17:32:53,285 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:32:53,285 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:32:53,285 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:32:53,285 INFO L82 PathProgramCache]: Analyzing trace with hash -981449705, 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:32:53,293 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:32:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:32:53,314 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:32:53,366 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:32:53,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:53,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:32:53,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-05 17:32:53,441 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 16 treesize of output 15 [2018-04-05 17:32:53,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:53,449 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:32:53,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-04-05 17:32:53,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:32:53,547 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:32:54,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-04-05 17:32:54,331 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 8 treesize of output 1 [2018-04-05 17:32:54,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:54,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:32:54,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:32:54,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-04-05 17:32:54,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:32:54,391 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:32:54,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-04-05 17:32:54,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-05 17:32:54,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-05 17:32:54,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=217, Unknown=2, NotChecked=0, Total=272 [2018-04-05 17:32:54,392 INFO L87 Difference]: Start difference. First operand 116 states and 121 transitions. Second operand 17 states. [2018-04-05 17:32:54,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:32:54,808 INFO L93 Difference]: Finished difference Result 188 states and 194 transitions. [2018-04-05 17:32:54,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-05 17:32:54,808 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-04-05 17:32:54,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:32:54,809 INFO L225 Difference]: With dead ends: 188 [2018-04-05 17:32:54,810 INFO L226 Difference]: Without dead ends: 147 [2018-04-05 17:32:54,811 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=143, Invalid=505, Unknown=2, NotChecked=0, Total=650 [2018-04-05 17:32:54,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-05 17:32:54,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 122. [2018-04-05 17:32:54,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-05 17:32:54,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2018-04-05 17:32:54,821 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 41 [2018-04-05 17:32:54,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:32:54,821 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2018-04-05 17:32:54,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-05 17:32:54,821 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2018-04-05 17:32:54,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-05 17:32:54,822 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:32:54,822 INFO L355 BasicCegarLoop]: trace histogram [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:32:54,823 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:32:54,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1672473413, 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:32:54,833 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:32:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:32:54,853 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:32:54,863 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 19 treesize of output 15 [2018-04-05 17:32:54,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-05 17:32:54,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:54,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:32:54,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:32:54,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-04-05 17:32:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-05 17:32:54,871 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:32:54,878 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 18 treesize of output 14 [2018-04-05 17:32:54,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2018-04-05 17:32:54,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:54,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:32:54,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-05 17:32:54,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:10 [2018-04-05 17:32:54,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-05 17:32:54,914 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:32:54,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2018-04-05 17:32:54,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-05 17:32:54,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-05 17:32:54,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-05 17:32:54,915 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand 6 states. [2018-04-05 17:32:55,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:32:55,031 INFO L93 Difference]: Finished difference Result 144 states and 147 transitions. [2018-04-05 17:32:55,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-05 17:32:55,031 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-04-05 17:32:55,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:32:55,032 INFO L225 Difference]: With dead ends: 144 [2018-04-05 17:32:55,032 INFO L226 Difference]: Without dead ends: 131 [2018-04-05 17:32:55,033 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-05 17:32:55,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-04-05 17:32:55,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 122. [2018-04-05 17:32:55,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-05 17:32:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2018-04-05 17:32:55,040 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 47 [2018-04-05 17:32:55,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:32:55,040 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2018-04-05 17:32:55,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-05 17:32:55,040 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2018-04-05 17:32:55,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-05 17:32:55,041 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:32:55,041 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-04-05 17:32:55,041 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:32:55,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1050810381, now seen corresponding path program 2 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:32:55,049 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:32:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:32:55,074 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:32:55,214 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:32:55,214 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:32:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:32:55,298 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:32:55,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-04-05 17:32:55,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-05 17:32:55,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-05 17:32:55,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-04-05 17:32:55,299 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 15 states. [2018-04-05 17:32:55,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:32:55,584 INFO L93 Difference]: Finished difference Result 255 states and 263 transitions. [2018-04-05 17:32:55,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-05 17:32:55,586 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-04-05 17:32:55,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:32:55,587 INFO L225 Difference]: With dead ends: 255 [2018-04-05 17:32:55,587 INFO L226 Difference]: Without dead ends: 208 [2018-04-05 17:32:55,587 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2018-04-05 17:32:55,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-04-05 17:32:55,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 166. [2018-04-05 17:32:55,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-05 17:32:55,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 173 transitions. [2018-04-05 17:32:55,602 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 173 transitions. Word has length 47 [2018-04-05 17:32:55,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:32:55,602 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 173 transitions. [2018-04-05 17:32:55,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-05 17:32:55,602 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 173 transitions. [2018-04-05 17:32:55,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-05 17:32:55,603 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:32:55,603 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-05 17:32:55,603 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:32:55,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1723209179, 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:32:55,610 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:32:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:32:55,629 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:32:55,632 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:32:55,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:55,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:32:55,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-05 17:32:55,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:32:55,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:32:55,649 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:32:55,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:55,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:32:55,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-05 17:32:55,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:32:55,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-05 17:32:55,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:55,686 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:32:55,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-05 17:32:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-05 17:32:55,696 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:32:55,711 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 6 treesize of output 1 [2018-04-05 17:32:55,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:55,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:32:55,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-05 17:32:55,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-05 17:32:55,756 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:32:55,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2018-04-05 17:32:55,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-05 17:32:55,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-05 17:32:55,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-04-05 17:32:55,757 INFO L87 Difference]: Start difference. First operand 166 states and 173 transitions. Second operand 12 states. [2018-04-05 17:32:55,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:32:55,955 INFO L93 Difference]: Finished difference Result 169 states and 177 transitions. [2018-04-05 17:32:55,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-05 17:32:55,955 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-04-05 17:32:55,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:32:55,956 INFO L225 Difference]: With dead ends: 169 [2018-04-05 17:32:55,956 INFO L226 Difference]: Without dead ends: 167 [2018-04-05 17:32:55,957 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2018-04-05 17:32:55,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-05 17:32:55,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2018-04-05 17:32:55,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-05 17:32:55,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 171 transitions. [2018-04-05 17:32:55,968 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 171 transitions. Word has length 48 [2018-04-05 17:32:55,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:32:55,968 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 171 transitions. [2018-04-05 17:32:55,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-05 17:32:55,969 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 171 transitions. [2018-04-05 17:32:55,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-05 17:32:55,969 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:32:55,969 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:32:55,969 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:32:55,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1326143899, 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:32:55,975 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:32:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:32:56,000 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:32:56,023 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:32:56,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:56,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:32:56,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-05 17:32:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-05 17:32:56,144 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:32:56,273 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-05 17:32:56,296 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:32:56,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2018-04-05 17:32:56,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-05 17:32:56,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-05 17:32:56,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-04-05 17:32:56,297 INFO L87 Difference]: Start difference. First operand 164 states and 171 transitions. Second operand 17 states. [2018-04-05 17:32:56,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:32:56,699 INFO L93 Difference]: Finished difference Result 176 states and 183 transitions. [2018-04-05 17:32:56,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-05 17:32:56,699 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2018-04-05 17:32:56,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:32:56,700 INFO L225 Difference]: With dead ends: 176 [2018-04-05 17:32:56,700 INFO L226 Difference]: Without dead ends: 173 [2018-04-05 17:32:56,701 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2018-04-05 17:32:56,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-05 17:32:56,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 158. [2018-04-05 17:32:56,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-05 17:32:56,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 165 transitions. [2018-04-05 17:32:56,711 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 165 transitions. Word has length 50 [2018-04-05 17:32:56,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:32:56,711 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 165 transitions. [2018-04-05 17:32:56,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-05 17:32:56,711 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 165 transitions. [2018-04-05 17:32:56,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-05 17:32:56,712 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:32:56,712 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:32:56,712 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:32:56,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1619579565, 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:32:56,718 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:32:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:32:56,738 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:32:56,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:32:56,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-05 17:32:56,798 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 23 treesize of output 15 [2018-04-05 17:32:56,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:56,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:32:56,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:32:56,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:15 [2018-04-05 17:32:56,840 WARN L1033 $PredicateComparison]: unable to prove that (exists ((~__U_MULTI_f___________true_valid_memsafety_i__a~0.base Int)) (let ((.cse0 (store |c_old(#valid)| ~__U_MULTI_f___________true_valid_memsafety_i__a~0.base 1))) (and (= (store (store .cse0 c_~__U_MULTI_f___________true_valid_memsafety_i__b~0.base 1) ~__U_MULTI_f___________true_valid_memsafety_i__a~0.base 0) |c_#valid|) (= 0 (select .cse0 c_~__U_MULTI_f___________true_valid_memsafety_i__b~0.base)) (= (select |c_old(#valid)| ~__U_MULTI_f___________true_valid_memsafety_i__a~0.base) 0)))) is different from true [2018-04-05 17:32:56,847 WARN L1033 $PredicateComparison]: unable to prove that (exists ((~__U_MULTI_f___________true_valid_memsafety_i__b~0.base Int) (~__U_MULTI_f___________true_valid_memsafety_i__a~0.base Int)) (let ((.cse0 (store |c_old(#valid)| ~__U_MULTI_f___________true_valid_memsafety_i__a~0.base 1))) (and (= 0 (select .cse0 ~__U_MULTI_f___________true_valid_memsafety_i__b~0.base)) (= (select |c_old(#valid)| ~__U_MULTI_f___________true_valid_memsafety_i__a~0.base) 0) (= (store (store (store .cse0 ~__U_MULTI_f___________true_valid_memsafety_i__b~0.base 1) ~__U_MULTI_f___________true_valid_memsafety_i__a~0.base 0) ~__U_MULTI_f___________true_valid_memsafety_i__b~0.base 0) |c_#valid|)))) is different from true [2018-04-05 17:32:56,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-05 17:32:56,857 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:32:56,928 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc5.base_18| Int)) (or (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc5.base_18| 1) c_~__U_MULTI_f___________true_valid_memsafety_i__a~0.base 0) |v_main_#t~malloc5.base_18| 0)) (not (= (select |c_#valid| |v_main_#t~malloc5.base_18|) 0)))) is different from false [2018-04-05 17:32:56,931 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc5.base_18| Int)) (or (not (= (select |c_#valid| |v_main_#t~malloc5.base_18|) 0)) (= (store (store (store |c_#valid| |v_main_#t~malloc5.base_18| 1) |c_main_#t~malloc4.base| 0) |v_main_#t~malloc5.base_18| 0) |c_old(#valid)|))) is different from false [2018-04-05 17:32:56,938 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc4.base_17| Int) (|v_main_#t~malloc5.base_18| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc4.base_17| 1))) (or (not (= (select .cse0 |v_main_#t~malloc5.base_18|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc5.base_18| 1) |v_main_#t~malloc4.base_17| 0) |v_main_#t~malloc5.base_18| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc4.base_17|) 0))))) is different from false [2018-04-05 17:32:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-05 17:32:56,974 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:32:56,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 17 [2018-04-05 17:32:56,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-05 17:32:56,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-05 17:32:56,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=134, Unknown=5, NotChecked=130, Total=306 [2018-04-05 17:32:56,975 INFO L87 Difference]: Start difference. First operand 158 states and 165 transitions. Second operand 18 states. [2018-04-05 17:32:57,009 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc4.base_17| Int) (|v_main_#t~malloc5.base_18| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc4.base_17| 1))) (or (not (= (select .cse0 |v_main_#t~malloc5.base_18|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc5.base_18| 1) |v_main_#t~malloc4.base_17| 0) |v_main_#t~malloc5.base_18| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc4.base_17|) 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-05 17:32:57,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:32:57,406 INFO L93 Difference]: Finished difference Result 169 states and 175 transitions. [2018-04-05 17:32:57,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-05 17:32:57,407 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2018-04-05 17:32:57,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:32:57,408 INFO L225 Difference]: With dead ends: 169 [2018-04-05 17:32:57,408 INFO L226 Difference]: Without dead ends: 130 [2018-04-05 17:32:57,409 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=284, Unknown=7, NotChecked=234, Total=600 [2018-04-05 17:32:57,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-04-05 17:32:57,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-04-05 17:32:57,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-05 17:32:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2018-04-05 17:32:57,421 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 51 [2018-04-05 17:32:57,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:32:57,421 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2018-04-05 17:32:57,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-05 17:32:57,421 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-04-05 17:32:57,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-05 17:32:57,422 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:32:57,422 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-04-05 17:32:57,422 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:32:57,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1595360437, now seen corresponding path program 3 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:32:57,434 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:32:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:32:57,462 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:32:57,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-05 17:32:57,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:57,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:32:57,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-05 17:32:57,561 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 16 treesize of output 15 [2018-04-05 17:32:57,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:57,568 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:32:57,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-04-05 17:32:57,708 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:32:57,708 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:32:58,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-04-05 17:32:58,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 14 treesize of output 5 [2018-04-05 17:32:58,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:58,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:32:58,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:32:58,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-04-05 17:32:58,184 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:32:58,206 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:32:58,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2018-04-05 17:32:58,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-05 17:32:58,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-05 17:32:58,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=426, Unknown=1, NotChecked=0, Total=506 [2018-04-05 17:32:58,207 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand 23 states. [2018-04-05 17:32:58,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:32:58,959 INFO L93 Difference]: Finished difference Result 206 states and 213 transitions. [2018-04-05 17:32:58,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-05 17:32:58,959 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2018-04-05 17:32:58,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:32:58,960 INFO L225 Difference]: With dead ends: 206 [2018-04-05 17:32:58,960 INFO L226 Difference]: Without dead ends: 168 [2018-04-05 17:32:58,961 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=246, Invalid=1085, Unknown=1, NotChecked=0, Total=1332 [2018-04-05 17:32:58,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-04-05 17:32:58,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 136. [2018-04-05 17:32:58,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-05 17:32:58,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 142 transitions. [2018-04-05 17:32:58,971 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 142 transitions. Word has length 54 [2018-04-05 17:32:58,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:32:58,971 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 142 transitions. [2018-04-05 17:32:58,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-05 17:32:58,971 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 142 transitions. [2018-04-05 17:32:58,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-05 17:32:58,972 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:32:58,972 INFO L355 BasicCegarLoop]: trace histogram [3, 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] [2018-04-05 17:32:58,972 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:32:58,972 INFO L82 PathProgramCache]: Analyzing trace with hash 657403739, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:32:58,979 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:32:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:32:58,998 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:32:59,030 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-05 17:32:59,030 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:32:59,078 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-05 17:32:59,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:32:59,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-04-05 17:32:59,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-05 17:32:59,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-05 17:32:59,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-04-05 17:32:59,100 INFO L87 Difference]: Start difference. First operand 136 states and 142 transitions. Second operand 11 states. [2018-04-05 17:32:59,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:32:59,278 INFO L93 Difference]: Finished difference Result 195 states and 201 transitions. [2018-04-05 17:32:59,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-05 17:32:59,278 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-04-05 17:32:59,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:32:59,281 INFO L225 Difference]: With dead ends: 195 [2018-04-05 17:32:59,281 INFO L226 Difference]: Without dead ends: 162 [2018-04-05 17:32:59,281 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-04-05 17:32:59,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-05 17:32:59,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 135. [2018-04-05 17:32:59,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-05 17:32:59,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-04-05 17:32:59,295 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 56 [2018-04-05 17:32:59,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:32:59,295 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-04-05 17:32:59,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-05 17:32:59,296 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-04-05 17:32:59,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-05 17:32:59,296 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:32:59,296 INFO L355 BasicCegarLoop]: trace histogram [3, 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] [2018-04-05 17:32:59,297 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:32:59,297 INFO L82 PathProgramCache]: Analyzing trace with hash -337570150, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:32:59,306 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:32:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:32:59,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:32:59,496 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-05 17:32:59,496 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:32:59,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-04-05 17:32:59,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:59,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-05 17:32:59,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2018-04-05 17:32:59,639 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 33 treesize of output 31 [2018-04-05 17:32:59,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:59,647 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 27 treesize of output 25 [2018-04-05 17:32:59,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:32:59,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:32:59,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:43 [2018-04-05 17:32:59,907 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-05 17:32:59,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:32:59,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-04-05 17:32:59,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-05 17:32:59,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-05 17:32:59,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-04-05 17:32:59,945 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 15 states. [2018-04-05 17:33:00,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:33:00,441 INFO L93 Difference]: Finished difference Result 164 states and 168 transitions. [2018-04-05 17:33:00,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-05 17:33:00,442 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-04-05 17:33:00,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:33:00,443 INFO L225 Difference]: With dead ends: 164 [2018-04-05 17:33:00,443 INFO L226 Difference]: Without dead ends: 163 [2018-04-05 17:33:00,443 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-04-05 17:33:00,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-05 17:33:00,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 137. [2018-04-05 17:33:00,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-05 17:33:00,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2018-04-05 17:33:00,456 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 59 [2018-04-05 17:33:00,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:33:00,457 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2018-04-05 17:33:00,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-05 17:33:00,457 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-04-05 17:33:00,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-05 17:33:00,458 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:33:00,458 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:33:00,458 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:33:00,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1324242389, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:33:00,473 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:33:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:33:00,499 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:33:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:33:00,728 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:33:00,824 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:33:00,859 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:33:00,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2018-04-05 17:33:00,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-05 17:33:00,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-05 17:33:00,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-04-05 17:33:00,861 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 21 states. [2018-04-05 17:33:01,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:33:01,299 INFO L93 Difference]: Finished difference Result 283 states and 292 transitions. [2018-04-05 17:33:01,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-05 17:33:01,300 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2018-04-05 17:33:01,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:33:01,302 INFO L225 Difference]: With dead ends: 283 [2018-04-05 17:33:01,302 INFO L226 Difference]: Without dead ends: 239 [2018-04-05 17:33:01,303 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 95 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=334, Invalid=1226, Unknown=0, NotChecked=0, Total=1560 [2018-04-05 17:33:01,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-04-05 17:33:01,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 188. [2018-04-05 17:33:01,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-05 17:33:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 195 transitions. [2018-04-05 17:33:01,319 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 195 transitions. Word has length 60 [2018-04-05 17:33:01,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:33:01,320 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 195 transitions. [2018-04-05 17:33:01,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-05 17:33:01,320 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 195 transitions. [2018-04-05 17:33:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-05 17:33:01,321 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:33:01,321 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:33:01,321 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:33:01,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1039770973, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:33:01,342 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:33:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:33:01,381 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:33:01,397 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:33:01,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:01,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:33:01,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 17:33:01,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:33:01,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:33:01,438 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:33:01,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:01,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:33:01,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-05 17:33:01,498 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 11 treesize of output 8 [2018-04-05 17:33:01,500 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:33:01,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:01,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:33:01,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:33:01,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-05 17:33:01,537 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 7 treesize of output 5 [2018-04-05 17:33:01,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-05 17:33:01,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:01,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:33:01,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:33:01,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-04-05 17:33:01,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2018-04-05 17:33:01,890 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 19 treesize of output 22 [2018-04-05 17:33:01,911 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 22 treesize of output 30 [2018-04-05 17:33:01,912 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:01,935 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:33:01,966 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 41 treesize of output 40 [2018-04-05 17:33:01,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:33:01,976 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 19 [2018-04-05 17:33:01,977 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:02,000 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:33:02,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:33:02,062 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:33:02,062 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2018-04-05 17:33:04,436 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 53 treesize of output 45 [2018-04-05 17:33:04,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:33:04,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:33:04,469 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:33:04,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-04-05 17:33:04,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:04,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2018-04-05 17:33:04,522 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:04,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:33:04,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:33:04,529 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:60, output treesize:10 [2018-04-05 17:33:04,555 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:33:04,555 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:33:07,705 WARN L148 SmtUtils]: Spent 511ms on a formula simplification that was a NOOP. DAG size: 46 [2018-04-05 17:33:12,162 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 94 treesize of output 72 [2018-04-05 17:33:12,179 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 9 treesize of output 8 [2018-04-05 17:33:12,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:12,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 99 [2018-04-05 17:33:12,610 WARN L151 SmtUtils]: Spent 394ms on a formula simplification. DAG size of input: 167 DAG size of output 157 [2018-04-05 17:33:12,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2018-04-05 17:33:12,620 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 0 case distinctions, treesize of input 45 treesize of output 47 [2018-04-05 17:33:12,647 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 0 case distinctions, treesize of input 34 treesize of output 28 [2018-04-05 17:33:12,647 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:12,664 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 69 [2018-04-05 17:33:12,665 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-05 17:33:12,666 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-05 17:33:12,666 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:12,679 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:33:12,688 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:33:12,713 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 114 [2018-04-05 17:33:12,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 145 [2018-04-05 17:33:13,121 WARN L151 SmtUtils]: Spent 356ms on a formula simplification. DAG size of input: 240 DAG size of output 120 [2018-04-05 17:33:13,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:33:13,125 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:33:13,126 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:33:13,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 83 [2018-04-05 17:33:13,127 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:13,284 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:33:13,285 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:33:13,286 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:33:13,286 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 0 case distinctions, treesize of input 55 treesize of output 52 [2018-04-05 17:33:13,287 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:13,422 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:33:13,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 88 [2018-04-05 17:33:13,431 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-04-05 17:33:13,438 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:33:13,438 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:33:13,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 103 [2018-04-05 17:33:13,452 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-04-05 17:33:13,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:33:13,657 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:33:13,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 64 [2018-04-05 17:33:13,658 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:13,743 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:33:13,745 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:33:13,747 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:33:13,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:33:13,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2018-04-05 17:33:13,749 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:13,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 93 [2018-04-05 17:33:13,833 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 3 xjuncts. [2018-04-05 17:33:13,867 INFO L267 ElimStorePlain]: Start of recursive call 11: 7 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:33:13,975 INFO L267 ElimStorePlain]: Start of recursive call 10: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:33:14,260 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 83 treesize of output 77 [2018-04-05 17:33:14,261 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:14,262 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 77 treesize of output 71 [2018-04-05 17:33:14,263 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:14,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2018-04-05 17:33:14,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-04-05 17:33:14,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 104 [2018-04-05 17:33:14,564 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-05 17:33:14,565 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 3 xjuncts. [2018-04-05 17:33:14,565 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-05 17:33:14,565 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:14,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 87 [2018-04-05 17:33:14,588 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-04-05 17:33:14,613 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:33:14,631 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:33:14,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2018-04-05 17:33:14,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-04-05 17:33:14,661 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-05 17:33:14,662 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:14,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 87 [2018-04-05 17:33:14,686 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-04-05 17:33:14,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-04-05 17:33:14,691 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:14,703 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:33:14,714 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:33:14,987 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 0 case distinctions, treesize of input 61 treesize of output 57 [2018-04-05 17:33:14,992 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 0 case distinctions, treesize of input 51 treesize of output 47 [2018-04-05 17:33:15,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-04-05 17:33:15,009 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:15,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 87 [2018-04-05 17:33:15,031 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-04-05 17:33:15,032 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-05 17:33:15,032 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:15,042 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:33:15,056 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:33:15,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 131 [2018-04-05 17:33:15,104 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:33:15,122 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 87 treesize of output 90 [2018-04-05 17:33:15,153 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:33:15,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2018-04-05 17:33:15,155 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:15,165 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:33:15,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 148 [2018-04-05 17:33:15,789 WARN L151 SmtUtils]: Spent 314ms on a formula simplification. DAG size of input: 249 DAG size of output 137 [2018-04-05 17:33:15,794 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:33:15,795 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:33:15,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:33:15,797 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:33:15,797 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:33:15,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 91 [2018-04-05 17:33:15,799 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:15,936 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:33:15,937 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:33:15,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 118 [2018-04-05 17:33:15,952 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 3 xjuncts. [2018-04-05 17:33:15,959 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:33:15,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 98 [2018-04-05 17:33:15,967 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 2 xjuncts. [2018-04-05 17:33:16,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 61 [2018-04-05 17:33:16,081 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:16,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 54 [2018-04-05 17:33:16,145 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:16,233 INFO L267 ElimStorePlain]: Start of recursive call 39: 7 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:33:16,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-04-05 17:33:16,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 37 [2018-04-05 17:33:16,352 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:16,358 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:33:16,537 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 0 case distinctions, treesize of input 61 treesize of output 57 [2018-04-05 17:33:16,571 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:33:16,574 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:33:16,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:33:16,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 44 [2018-04-05 17:33:16,576 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:16,584 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:33:16,708 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 0 case distinctions, treesize of input 51 treesize of output 47 [2018-04-05 17:33:16,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 87 [2018-04-05 17:33:16,757 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 2 xjuncts. [2018-04-05 17:33:16,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 104 [2018-04-05 17:33:16,843 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-05 17:33:16,844 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 3 xjuncts. [2018-04-05 17:33:16,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-04-05 17:33:16,848 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:16,880 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:33:16,943 INFO L267 ElimStorePlain]: Start of recursive call 36: 13 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:33:17,116 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 96 [2018-04-05 17:33:17,117 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 3 xjuncts. [2018-04-05 17:33:17,236 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 60 treesize of output 56 [2018-04-05 17:33:17,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-04-05 17:33:17,253 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-05 17:33:17,253 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:17,269 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 69 [2018-04-05 17:33:17,269 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 2 xjuncts. [2018-04-05 17:33:17,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 81 [2018-04-05 17:33:17,297 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 3 xjuncts. [2018-04-05 17:33:17,322 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:33:17,339 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:33:17,341 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 60 treesize of output 56 [2018-04-05 17:33:17,346 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 0 case distinctions, treesize of input 45 treesize of output 41 [2018-04-05 17:33:17,361 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 0 case distinctions, treesize of input 34 treesize of output 28 [2018-04-05 17:33:17,362 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:17,378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 69 [2018-04-05 17:33:17,379 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 2 xjuncts. [2018-04-05 17:33:17,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 81 [2018-04-05 17:33:17,412 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 3 xjuncts. [2018-04-05 17:33:17,447 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:33:17,473 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:33:17,568 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 65 treesize of output 61 [2018-04-05 17:33:17,569 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:17,656 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 58 treesize of output 54 [2018-04-05 17:33:17,661 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 0 case distinctions, treesize of input 45 treesize of output 41 [2018-04-05 17:33:17,679 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 0 case distinctions, treesize of input 34 treesize of output 28 [2018-04-05 17:33:17,680 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:17,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 81 [2018-04-05 17:33:17,712 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 3 xjuncts. [2018-04-05 17:33:17,729 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 69 [2018-04-05 17:33:17,730 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 2 xjuncts. [2018-04-05 17:33:17,756 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:33:17,781 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:33:17,950 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 41 treesize of output 35 [2018-04-05 17:33:17,951 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:17,957 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 49 treesize of output 43 [2018-04-05 17:33:17,958 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:18,156 INFO L267 ElimStorePlain]: Start of recursive call 4: 13 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-05 17:33:18,163 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 36 treesize of output 38 [2018-04-05 17:33:18,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-04-05 17:33:18,195 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:18,196 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2018-04-05 17:33:18,197 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:18,198 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 26 treesize of output 22 [2018-04-05 17:33:18,199 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:18,241 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 45 [2018-04-05 17:33:18,242 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 3 xjuncts. [2018-04-05 17:33:18,244 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 23 treesize of output 18 [2018-04-05 17:33:18,244 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:18,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-04-05 17:33:18,270 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:18,284 INFO L267 ElimStorePlain]: Start of recursive call 72: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:33:18,292 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 65 treesize of output 67 [2018-04-05 17:33:18,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-04-05 17:33:18,298 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 0 case distinctions, treesize of input 45 treesize of output 47 [2018-04-05 17:33:18,329 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 69 [2018-04-05 17:33:18,330 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 2 xjuncts. [2018-04-05 17:33:18,333 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 0 case distinctions, treesize of input 34 treesize of output 28 [2018-04-05 17:33:18,333 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:18,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 81 [2018-04-05 17:33:18,362 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 3 xjuncts. [2018-04-05 17:33:18,389 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:33:18,410 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:33:18,441 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 0 case distinctions, treesize of input 59 treesize of output 55 [2018-04-05 17:33:18,446 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 0 case distinctions, treesize of input 51 treesize of output 47 [2018-04-05 17:33:18,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 87 [2018-04-05 17:33:18,481 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 2 xjuncts. [2018-04-05 17:33:18,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-04-05 17:33:18,486 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:18,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 104 [2018-04-05 17:33:18,523 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-05 17:33:18,524 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 3 xjuncts. [2018-04-05 17:33:18,558 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:33:18,585 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:33:18,632 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 53 treesize of output 47 [2018-04-05 17:33:18,633 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:18,634 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 42 treesize of output 36 [2018-04-05 17:33:18,635 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-04-05 17:33:18,676 INFO L267 ElimStorePlain]: Start of recursive call 79: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-05 17:33:18,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-05 17:33:18,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-05 17:33:18,802 INFO L202 ElimStorePlain]: Needed 91 recursive calls to eliminate 4 variables, input treesize:98, output treesize:146 [2018-04-05 17:33:19,329 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:33:19,353 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:33:19,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 38 [2018-04-05 17:33:19,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-05 17:33:19,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-05 17:33:19,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1134, Unknown=26, NotChecked=0, Total=1406 [2018-04-05 17:33:19,355 INFO L87 Difference]: Start difference. First operand 188 states and 195 transitions. Second operand 38 states. [2018-04-05 17:33:39,260 WARN L148 SmtUtils]: Spent 15125ms on a formula simplification that was a NOOP. DAG size: 59 [2018-04-05 17:33:43,264 WARN L148 SmtUtils]: Spent 112ms on a formula simplification that was a NOOP. DAG size: 23 [2018-04-05 17:33:44,811 WARN L151 SmtUtils]: Spent 219ms on a formula simplification. DAG size of input: 58 DAG size of output 40 [2018-04-05 17:33:55,897 WARN L148 SmtUtils]: Spent 690ms on a formula simplification that was a NOOP. DAG size: 70 [2018-04-05 17:34:15,730 WARN L148 SmtUtils]: Spent 14598ms on a formula simplification that was a NOOP. DAG size: 78 [2018-04-05 17:34:24,491 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 46 DAG size of output 37 [2018-04-05 17:34:45,894 WARN L148 SmtUtils]: Spent 2063ms on a formula simplification that was a NOOP. DAG size: 43 [2018-04-05 17:34:55,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:34:55,400 INFO L93 Difference]: Finished difference Result 229 states and 238 transitions. [2018-04-05 17:34:55,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-05 17:34:55,401 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 66 [2018-04-05 17:34:55,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:34:55,402 INFO L225 Difference]: With dead ends: 229 [2018-04-05 17:34:55,402 INFO L226 Difference]: Without dead ends: 217 [2018-04-05 17:34:55,404 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 65.1s TimeCoverageRelationStatistics Valid=910, Invalid=3575, Unknown=71, NotChecked=0, Total=4556 [2018-04-05 17:34:55,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-05 17:34:55,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 189. [2018-04-05 17:34:55,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-05 17:34:55,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 196 transitions. [2018-04-05 17:34:55,477 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 196 transitions. Word has length 66 [2018-04-05 17:34:55,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:34:55,477 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 196 transitions. [2018-04-05 17:34:55,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-05 17:34:55,477 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 196 transitions. [2018-04-05 17:34:55,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-05 17:34:55,478 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:34:55,479 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:34:55,479 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:34:55,479 INFO L82 PathProgramCache]: Analyzing trace with hash 250629763, now seen corresponding path program 5 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:34:55,516 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:34:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:34:55,553 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:34:55,764 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:34:55,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:34:55,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:34:55,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-05 17:34:55,953 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 16 treesize of output 15 [2018-04-05 17:34:55,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:34:55,988 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:34:55,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-04-05 17:34:56,930 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:34:56,930 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:34:58,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-04-05 17:34:58,150 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 14 treesize of output 5 [2018-04-05 17:34:58,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:34:58,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:34:58,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:34:58,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-04-05 17:34:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:34:58,318 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:34:58,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 28 [2018-04-05 17:34:58,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-05 17:34:58,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-05 17:34:58,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=702, Unknown=1, NotChecked=0, Total=812 [2018-04-05 17:34:58,320 INFO L87 Difference]: Start difference. First operand 189 states and 196 transitions. Second operand 29 states. [2018-04-05 17:35:03,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:35:03,075 INFO L93 Difference]: Finished difference Result 276 states and 283 transitions. [2018-04-05 17:35:03,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-05 17:35:03,079 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 67 [2018-04-05 17:35:03,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:35:03,081 INFO L225 Difference]: With dead ends: 276 [2018-04-05 17:35:03,081 INFO L226 Difference]: Without dead ends: 238 [2018-04-05 17:35:03,085 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 99 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=389, Invalid=1962, Unknown=1, NotChecked=0, Total=2352 [2018-04-05 17:35:03,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-04-05 17:35:03,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 195. [2018-04-05 17:35:03,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-04-05 17:35:03,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 202 transitions. [2018-04-05 17:35:03,126 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 202 transitions. Word has length 67 [2018-04-05 17:35:03,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:35:03,126 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 202 transitions. [2018-04-05 17:35:03,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-05 17:35:03,126 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 202 transitions. [2018-04-05 17:35:03,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-05 17:35:03,127 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:35:03,127 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-05 17:35:03,128 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:35:03,128 INFO L82 PathProgramCache]: Analyzing trace with hash -2067849475, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:35:03,154 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:35:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:35:03,213 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:35:03,468 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:35:03,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:35:03,503 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:35:03,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-05 17:35:04,074 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-05 17:35:04,074 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:35:04,985 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-05 17:35:05,022 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:35:05,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2018-04-05 17:35:05,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-05 17:35:05,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-05 17:35:05,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-04-05 17:35:05,023 INFO L87 Difference]: Start difference. First operand 195 states and 202 transitions. Second operand 23 states. [2018-04-05 17:35:06,243 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 37 DAG size of output 33 [2018-04-05 17:35:06,679 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 32 DAG size of output 31 [2018-04-05 17:35:08,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:35:08,559 INFO L93 Difference]: Finished difference Result 251 states and 260 transitions. [2018-04-05 17:35:08,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-05 17:35:08,559 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 69 [2018-04-05 17:35:08,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:35:08,561 INFO L225 Difference]: With dead ends: 251 [2018-04-05 17:35:08,561 INFO L226 Difference]: Without dead ends: 222 [2018-04-05 17:35:08,562 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 111 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=251, Invalid=1309, Unknown=0, NotChecked=0, Total=1560 [2018-04-05 17:35:08,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-05 17:35:08,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 207. [2018-04-05 17:35:08,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-04-05 17:35:08,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 214 transitions. [2018-04-05 17:35:08,596 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 214 transitions. Word has length 69 [2018-04-05 17:35:08,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:35:08,597 INFO L459 AbstractCegarLoop]: Abstraction has 207 states and 214 transitions. [2018-04-05 17:35:08,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-05 17:35:08,597 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 214 transitions. [2018-04-05 17:35:08,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-05 17:35:08,598 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:35:08,598 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:35:08,598 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:35:08,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1806048107, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:35:08,609 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:35:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:35:08,648 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:35:08,950 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:35:08,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-05 17:35:08,955 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 23 treesize of output 15 [2018-04-05 17:35:08,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:35:08,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:35:09,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:35:09,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:15 [2018-04-05 17:35:09,165 WARN L1033 $PredicateComparison]: unable to prove that (exists ((~__U_MULTI_f___________true_valid_memsafety_i__a~0.base Int)) (let ((.cse0 (store |c_old(#valid)| ~__U_MULTI_f___________true_valid_memsafety_i__a~0.base 1))) (and (= (store (store .cse0 c_~__U_MULTI_f___________true_valid_memsafety_i__b~0.base 1) ~__U_MULTI_f___________true_valid_memsafety_i__a~0.base 0) |c_#valid|) (= 0 (select .cse0 c_~__U_MULTI_f___________true_valid_memsafety_i__b~0.base)) (= (select |c_old(#valid)| ~__U_MULTI_f___________true_valid_memsafety_i__a~0.base) 0)))) is different from true [2018-04-05 17:35:09,180 WARN L1033 $PredicateComparison]: unable to prove that (exists ((~__U_MULTI_f___________true_valid_memsafety_i__b~0.base Int) (~__U_MULTI_f___________true_valid_memsafety_i__a~0.base Int)) (let ((.cse0 (store |c_old(#valid)| ~__U_MULTI_f___________true_valid_memsafety_i__a~0.base 1))) (and (= 0 (select .cse0 ~__U_MULTI_f___________true_valid_memsafety_i__b~0.base)) (= (select |c_old(#valid)| ~__U_MULTI_f___________true_valid_memsafety_i__a~0.base) 0) (= (store (store (store .cse0 ~__U_MULTI_f___________true_valid_memsafety_i__b~0.base 1) ~__U_MULTI_f___________true_valid_memsafety_i__a~0.base 0) ~__U_MULTI_f___________true_valid_memsafety_i__b~0.base 0) |c_#valid|)))) is different from true [2018-04-05 17:35:09,213 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-05 17:35:09,213 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:35:09,424 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc5.base_26| Int)) (or (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc5.base_26| 1) c_~__U_MULTI_f___________true_valid_memsafety_i__a~0.base 0) |v_main_#t~malloc5.base_26| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc5.base_26|))))) is different from false [2018-04-05 17:35:09,432 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc5.base_26| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc5.base_26|))) (= (store (store (store |c_#valid| |v_main_#t~malloc5.base_26| 1) |c_main_#t~malloc4.base| 0) |v_main_#t~malloc5.base_26| 0) |c_old(#valid)|))) is different from false [2018-04-05 17:35:09,445 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc5.base_26| Int) (|v_main_#t~malloc4.base_25| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc4.base_25| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc4.base_25|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc5.base_26| 1) |v_main_#t~malloc4.base_25| 0) |v_main_#t~malloc5.base_26| 0) |c_old(#valid)|) (not (= 0 (select .cse0 |v_main_#t~malloc5.base_26|)))))) is different from false [2018-04-05 17:35:09,487 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-05 17:35:09,526 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 17:35:09,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 17 [2018-04-05 17:35:09,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-05 17:35:09,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-05 17:35:09,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=134, Unknown=5, NotChecked=130, Total=306 [2018-04-05 17:35:09,527 INFO L87 Difference]: Start difference. First operand 207 states and 214 transitions. Second operand 18 states. [2018-04-05 17:35:09,725 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc5.base_26| Int) (|v_main_#t~malloc4.base_25| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc4.base_25| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc4.base_25|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc5.base_26| 1) |v_main_#t~malloc4.base_25| 0) |v_main_#t~malloc5.base_26| 0) |c_old(#valid)|) (not (= 0 (select .cse0 |v_main_#t~malloc5.base_26|))))))) is different from false [2018-04-05 17:35:10,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:35:10,955 INFO L93 Difference]: Finished difference Result 209 states and 216 transitions. [2018-04-05 17:35:10,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-05 17:35:10,955 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-04-05 17:35:10,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:35:10,957 INFO L225 Difference]: With dead ends: 209 [2018-04-05 17:35:10,957 INFO L226 Difference]: Without dead ends: 154 [2018-04-05 17:35:10,958 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=90, Invalid=344, Unknown=10, NotChecked=258, Total=702 [2018-04-05 17:35:10,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-04-05 17:35:10,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-04-05 17:35:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-05 17:35:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 159 transitions. [2018-04-05 17:35:10,980 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 159 transitions. Word has length 70 [2018-04-05 17:35:10,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:35:10,981 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 159 transitions. [2018-04-05 17:35:10,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-05 17:35:10,981 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 159 transitions. [2018-04-05 17:35:10,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-05 17:35:10,993 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:35:10,993 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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:35:10,993 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:35:10,993 INFO L82 PathProgramCache]: Analyzing trace with hash 58958201, now seen corresponding path program 6 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:35:11,019 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:35:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:35:11,062 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:35:11,831 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 48 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:35:11,831 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:35:12,376 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 48 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:35:12,407 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:35:12,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 27 [2018-04-05 17:35:12,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-05 17:35:12,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-05 17:35:12,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2018-04-05 17:35:12,408 INFO L87 Difference]: Start difference. First operand 154 states and 159 transitions. Second operand 27 states. [2018-04-05 17:35:16,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:35:16,362 INFO L93 Difference]: Finished difference Result 281 states and 287 transitions. [2018-04-05 17:35:16,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-05 17:35:16,363 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 73 [2018-04-05 17:35:16,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:35:16,364 INFO L225 Difference]: With dead ends: 281 [2018-04-05 17:35:16,365 INFO L226 Difference]: Without dead ends: 244 [2018-04-05 17:35:16,366 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 113 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=538, Invalid=2218, Unknown=0, NotChecked=0, Total=2756 [2018-04-05 17:35:16,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-04-05 17:35:16,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 217. [2018-04-05 17:35:16,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-04-05 17:35:16,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 225 transitions. [2018-04-05 17:35:16,398 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 225 transitions. Word has length 73 [2018-04-05 17:35:16,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:35:16,400 INFO L459 AbstractCegarLoop]: Abstraction has 217 states and 225 transitions. [2018-04-05 17:35:16,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-05 17:35:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 225 transitions. [2018-04-05 17:35:16,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-04-05 17:35:16,401 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:35:16,402 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:35:16,402 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:35:16,402 INFO L82 PathProgramCache]: Analyzing trace with hash -806169101, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:35:16,435 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:35:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:35:16,465 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:35:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-05 17:35:16,766 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:35:17,132 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-05 17:35:17,169 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:35:17,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-04-05 17:35:17,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-05 17:35:17,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-05 17:35:17,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-04-05 17:35:17,171 INFO L87 Difference]: Start difference. First operand 217 states and 225 transitions. Second operand 17 states. [2018-04-05 17:35:18,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:35:18,126 INFO L93 Difference]: Finished difference Result 247 states and 253 transitions. [2018-04-05 17:35:18,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-05 17:35:18,126 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 75 [2018-04-05 17:35:18,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:35:18,128 INFO L225 Difference]: With dead ends: 247 [2018-04-05 17:35:18,128 INFO L226 Difference]: Without dead ends: 227 [2018-04-05 17:35:18,129 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 129 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2018-04-05 17:35:18,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-04-05 17:35:18,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 216. [2018-04-05 17:35:18,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-04-05 17:35:18,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 222 transitions. [2018-04-05 17:35:18,159 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 222 transitions. Word has length 75 [2018-04-05 17:35:18,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:35:18,159 INFO L459 AbstractCegarLoop]: Abstraction has 216 states and 222 transitions. [2018-04-05 17:35:18,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-05 17:35:18,159 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 222 transitions. [2018-04-05 17:35:18,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-05 17:35:18,160 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:35:18,160 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-05 17:35:18,160 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:35:18,160 INFO L82 PathProgramCache]: Analyzing trace with hash 871942402, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:35:18,173 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:35:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:35:18,207 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:35:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-05 17:35:18,426 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:35:18,608 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 22 treesize of output 20 [2018-04-05 17:35:18,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:35:18,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-05 17:35:18,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:19 [2018-04-05 17:35:18,786 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 27 treesize of output 25 [2018-04-05 17:35:18,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:35:18,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-04-05 17:35:18,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:35:18,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:35:18,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:43 [2018-04-05 17:35:19,289 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-05 17:35:19,319 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:35:19,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2018-04-05 17:35:19,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-05 17:35:19,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-05 17:35:19,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2018-04-05 17:35:19,321 INFO L87 Difference]: Start difference. First operand 216 states and 222 transitions. Second operand 23 states. [2018-04-05 17:35:19,566 WARN L151 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 54 DAG size of output 42 [2018-04-05 17:35:21,230 WARN L148 SmtUtils]: Spent 141ms on a formula simplification that was a NOOP. DAG size: 29 [2018-04-05 17:35:21,384 WARN L148 SmtUtils]: Spent 110ms on a formula simplification that was a NOOP. DAG size: 39 [2018-04-05 17:35:21,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:35:21,617 INFO L93 Difference]: Finished difference Result 227 states and 232 transitions. [2018-04-05 17:35:21,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-05 17:35:21,618 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 78 [2018-04-05 17:35:21,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:35:21,619 INFO L225 Difference]: With dead ends: 227 [2018-04-05 17:35:21,619 INFO L226 Difference]: Without dead ends: 226 [2018-04-05 17:35:21,620 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=203, Invalid=1129, Unknown=0, NotChecked=0, Total=1332 [2018-04-05 17:35:21,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-04-05 17:35:21,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2018-04-05 17:35:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-05 17:35:21,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 224 transitions. [2018-04-05 17:35:21,658 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 224 transitions. Word has length 78 [2018-04-05 17:35:21,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:35:21,659 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 224 transitions. [2018-04-05 17:35:21,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-05 17:35:21,659 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 224 transitions. [2018-04-05 17:35:21,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-05 17:35:21,660 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:35:21,660 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 17:35:21,660 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:35:21,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1473039393, now seen corresponding path program 7 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:35:21,689 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:35:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:35:21,725 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:35:22,154 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:35:22,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:35:22,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:35:22,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-05 17:35:22,294 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 16 treesize of output 15 [2018-04-05 17:35:22,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:35:22,314 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:35:22,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-04-05 17:35:23,383 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 54 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:35:23,384 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:35:24,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-04-05 17:35:24,908 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 14 treesize of output 5 [2018-04-05 17:35:24,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:35:24,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:35:24,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:35:24,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-04-05 17:35:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 54 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:35:25,368 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:35:25,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 34 [2018-04-05 17:35:25,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-05 17:35:25,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-05 17:35:25,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1046, Unknown=1, NotChecked=0, Total=1190 [2018-04-05 17:35:25,369 INFO L87 Difference]: Start difference. First operand 218 states and 224 transitions. Second operand 35 states. [2018-04-05 17:35:32,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 17:35:32,841 INFO L93 Difference]: Finished difference Result 280 states and 284 transitions. [2018-04-05 17:35:32,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-05 17:35:32,842 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 80 [2018-04-05 17:35:32,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 17:35:32,844 INFO L225 Difference]: With dead ends: 280 [2018-04-05 17:35:32,844 INFO L226 Difference]: Without dead ends: 249 [2018-04-05 17:35:32,845 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 117 SyntacticMatches, 9 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=542, Invalid=2997, Unknown=1, NotChecked=0, Total=3540 [2018-04-05 17:35:32,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-04-05 17:35:32,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 224. [2018-04-05 17:35:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-04-05 17:35:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 230 transitions. [2018-04-05 17:35:32,898 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 230 transitions. Word has length 80 [2018-04-05 17:35:32,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 17:35:32,898 INFO L459 AbstractCegarLoop]: Abstraction has 224 states and 230 transitions. [2018-04-05 17:35:32,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-05 17:35:32,899 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 230 transitions. [2018-04-05 17:35:32,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-05 17:35:32,900 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 17:35:32,913 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 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:35:32,913 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr13AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr14EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr12AssertViolationMEMORY_FREE, __U_MULTI_f___________true_valid_memsafety_i__fooErr1RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr3RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr2RequiresViolation, __U_MULTI_f___________true_valid_memsafety_i__fooErr0RequiresViolation]=== [2018-04-05 17:35:32,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1186767675, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 17:35:32,932 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 17:35:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 17:35:32,999 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 17:35:33,108 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:35:33,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:35:33,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:35:33,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 17:35:33,365 WARN L148 SmtUtils]: Spent 144ms on a formula simplification that was a NOOP. DAG size: 9 [2018-04-05 17:35:33,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:35:33,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:35:33,536 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:35:33,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 17:35:33,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:35:33,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-05 17:35:33,832 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 11 treesize of output 8 [2018-04-05 17:35:33,837 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:35:33,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:35:33,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:35:33,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:35:33,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-05 17:35:33,960 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 7 treesize of output 5 [2018-04-05 17:35:33,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-05 17:35:33,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:35:33,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:35:34,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:35:34,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-04-05 17:35:35,244 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 44 DAG size of output 37 [2018-04-05 17:35:35,293 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 50 treesize of output 54 [2018-04-05 17:35:35,299 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 26 treesize of output 29 [2018-04-05 17:35:35,304 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 0 case distinctions, treesize of input 29 treesize of output 38 [2018-04-05 17:35:35,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2018-04-05 17:35:35,310 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 17:35:35,318 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:35:35,332 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:35:35,398 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 57 treesize of output 56 [2018-04-05 17:35:35,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:35:35,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 25 [2018-04-05 17:35:35,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:35:35,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:35:35,422 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 21 treesize of output 40 [2018-04-05 17:35:35,423 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-05 17:35:35,468 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:35:35,512 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:35:35,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:35:35,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-05 17:35:35,583 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:86, output treesize:67 [2018-04-05 17:35:37,895 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 75 treesize of output 63 [2018-04-05 17:35:37,909 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:35:37,917 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:35:37,921 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:35:37,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 17:35:37,929 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:35:37,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2018-04-05 17:35:37,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:35:38,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 1 [2018-04-05 17:35:38,019 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 17:35:38,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:35:38,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:35:38,058 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:82, output treesize:10 [2018-04-05 17:35:38,188 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 31 refuted. 16 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 17:35:38,188 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 17:35:40,526 WARN L148 SmtUtils]: Spent 1268ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-05 17:35:42,250 WARN L148 SmtUtils]: Spent 1378ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-05 17:35:50,952 WARN L148 SmtUtils]: Spent 967ms on a formula simplification that was a NOOP. DAG size: 53 [2018-04-05 17:36:07,879 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 118 treesize of output 96 [2018-04-05 17:36:07,897 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 9 treesize of output 8 [2018-04-05 17:36:07,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 17:36:07,920 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 89 treesize of output 91 [2018-04-05 17:36:07,924 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 0 case distinctions, treesize of input 83 treesize of output 79 [2018-04-05 17:36:07,929 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 0 case distinctions, treesize of input 75 treesize of output 71 [2018-04-05 17:36:07,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2018-04-05 17:36:07,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 67 [2018-04-05 17:36:07,968 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:36:08,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 62 treesize of output 153 [2018-04-05 17:36:08,031 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-04-05 17:36:08,032 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-04-05 17:36:08,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2018-04-05 17:36:08,043 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-05 17:36:08,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 131 [2018-04-05 17:36:08,093 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-05 17:36:08,132 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:08,154 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:08,176 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:08,201 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:08,239 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 86 treesize of output 80 [2018-04-05 17:36:08,240 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-05 17:36:08,285 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 80 treesize of output 76 [2018-04-05 17:36:08,289 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 0 case distinctions, treesize of input 69 treesize of output 65 [2018-04-05 17:36:08,295 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 0 case distinctions, treesize of input 65 treesize of output 61 [2018-04-05 17:36:08,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 61 [2018-04-05 17:36:08,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 113 [2018-04-05 17:36:08,354 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-04-05 17:36:08,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-04-05 17:36:08,362 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-05 17:36:08,364 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:36:08,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 56 treesize of output 130 [2018-04-05 17:36:08,412 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-05 17:36:08,413 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 3 xjuncts. [2018-04-05 17:36:08,454 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:36:08,478 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:08,496 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:08,518 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:08,575 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-05 17:36:08,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 133 [2018-04-05 17:36:08,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 112 treesize of output 114 [2018-04-05 17:36:08,627 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:36:08,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 60 [2018-04-05 17:36:08,645 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 3 xjuncts. [2018-04-05 17:36:08,648 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 0 case distinctions, treesize of input 26 treesize of output 20 [2018-04-05 17:36:08,649 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-05 17:36:08,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 53 [2018-04-05 17:36:08,664 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-04-05 17:36:08,688 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 0 case distinctions, treesize of input 75 treesize of output 71 [2018-04-05 17:36:08,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2018-04-05 17:36:08,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 67 [2018-04-05 17:36:08,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 131 [2018-04-05 17:36:08,784 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-04-05 17:36:08,787 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:36:08,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 62 treesize of output 153 [2018-04-05 17:36:08,853 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-04-05 17:36:08,854 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 3 xjuncts. [2018-04-05 17:36:08,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2018-04-05 17:36:08,869 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-05 17:36:08,908 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:08,931 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:08,953 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:08,978 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:09,101 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 118 treesize of output 114 [2018-04-05 17:36:09,105 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 0 case distinctions, treesize of input 69 treesize of output 71 [2018-04-05 17:36:09,110 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 0 case distinctions, treesize of input 65 treesize of output 67 [2018-04-05 17:36:09,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 67 [2018-04-05 17:36:09,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 113 [2018-04-05 17:36:09,169 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-04-05 17:36:09,173 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:36:09,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 56 treesize of output 130 [2018-04-05 17:36:09,225 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-05 17:36:09,226 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 3 xjuncts. [2018-04-05 17:36:09,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-04-05 17:36:09,236 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-05 17:36:09,278 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:09,296 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:09,314 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:09,347 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:09,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 109 treesize of output 111 [2018-04-05 17:36:09,522 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 0 case distinctions, treesize of input 75 treesize of output 77 [2018-04-05 17:36:09,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 73 [2018-04-05 17:36:09,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 73 [2018-04-05 17:36:09,569 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:36:09,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 62 treesize of output 153 [2018-04-05 17:36:09,629 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-04-05 17:36:09,630 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 3 xjuncts. [2018-04-05 17:36:09,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 131 [2018-04-05 17:36:09,675 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-04-05 17:36:09,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2018-04-05 17:36:09,709 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-05 17:36:09,753 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:09,774 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:09,796 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:09,830 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 0 case distinctions, treesize of input 26 treesize of output 20 [2018-04-05 17:36:09,830 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-05 17:36:09,833 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:36:09,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 60 [2018-04-05 17:36:09,851 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 3 xjuncts. [2018-04-05 17:36:09,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 53 [2018-04-05 17:36:09,866 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-04-05 17:36:09,900 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:10,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 115 [2018-04-05 17:36:10,046 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 0 case distinctions, treesize of input 26 treesize of output 20 [2018-04-05 17:36:10,047 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-05 17:36:10,050 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:36:10,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 60 [2018-04-05 17:36:10,068 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 3 xjuncts. [2018-04-05 17:36:10,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 53 [2018-04-05 17:36:10,083 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 2 xjuncts. [2018-04-05 17:36:10,119 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:10,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 92 treesize of output 88 [2018-04-05 17:36:10,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2018-04-05 17:36:10,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2018-04-05 17:36:10,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 61 [2018-04-05 17:36:10,261 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:36:10,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 108 [2018-04-05 17:36:10,290 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 2 xjuncts. [2018-04-05 17:36:10,290 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-05 17:36:10,291 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-04-05 17:36:10,294 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:36:10,296 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:36:10,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 125 [2018-04-05 17:36:10,339 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-05 17:36:10,340 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 3 xjuncts. [2018-04-05 17:36:10,375 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:10,391 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:10,407 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:10,437 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:10,531 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 115 treesize of output 109 [2018-04-05 17:36:10,531 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-04-05 17:36:10,706 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 73 treesize of output 67 [2018-04-05 17:36:10,706 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-04-05 17:36:10,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 67 [2018-04-05 17:36:10,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 35 [2018-04-05 17:36:10,900 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 2 xjuncts. [2018-04-05 17:36:10,902 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:36:10,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 37 [2018-04-05 17:36:10,908 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 2 xjuncts. [2018-04-05 17:36:10,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-04-05 17:36:10,910 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-04-05 17:36:10,929 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:36:11,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 109 treesize of output 105 [2018-04-05 17:36:11,242 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 0 case distinctions, treesize of input 69 treesize of output 71 [2018-04-05 17:36:11,248 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 0 case distinctions, treesize of input 65 treesize of output 67 [2018-04-05 17:36:11,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 67 [2018-04-05 17:36:11,276 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:36:11,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 56 treesize of output 130 [2018-04-05 17:36:11,326 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-05 17:36:11,327 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 3 xjuncts. [2018-04-05 17:36:11,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-04-05 17:36:11,336 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-04-05 17:36:11,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 113 [2018-04-05 17:36:11,369 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 2 xjuncts. [2018-04-05 17:36:11,412 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:11,431 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:11,455 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:11,486 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:36:11,492 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 37 [2018-04-05 17:36:11,493 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 2 xjuncts. [2018-04-05 17:36:11,495 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-04-05 17:36:11,495 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-04-05 17:36:11,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 35 [2018-04-05 17:36:11,502 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 2 xjuncts. [2018-04-05 17:36:11,530 INFO L267 ElimStorePlain]: Start of recursive call 65: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:11,604 INFO L267 ElimStorePlain]: Start of recursive call 20: 13 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-05 17:36:11,612 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 46 treesize of output 48 [2018-04-05 17:36:11,614 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 43 treesize of output 37 [2018-04-05 17:36:11,615 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-04-05 17:36:11,628 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 37 treesize of output 37 [2018-04-05 17:36:11,641 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:36:11,648 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 37 [2018-04-05 17:36:11,648 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 2 xjuncts. [2018-04-05 17:36:11,651 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-04-05 17:36:11,652 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-04-05 17:36:11,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 35 [2018-04-05 17:36:11,659 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 2 xjuncts. [2018-04-05 17:36:11,670 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 17:36:11,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2018-04-05 17:36:11,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 53 [2018-04-05 17:36:11,715 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 2 xjuncts. [2018-04-05 17:36:11,717 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 0 case distinctions, treesize of input 26 treesize of output 20 [2018-04-05 17:36:11,718 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-04-05 17:36:11,720 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 17:36:11,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 60 [2018-04-05 17:36:11,736 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 3 xjuncts. [2018-04-05 17:36:11,758 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 17:36:11,773 INFO L267 ElimStorePlain]: Start of recursive call 75: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 17:36:11,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-05 17:36:11,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-05 17:36:11,931 INFO L202 ElimStorePlain]: Needed 84 recursive calls to eliminate 5 variables, input treesize:122, output treesize:174 [2018-04-05 17:36:12,907 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 39 refuted. 2 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-05 17:36:12,935 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 17:36:12,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 49 [2018-04-05 17:36:12,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-05 17:36:12,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-05 17:36:12,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=1962, Unknown=55, NotChecked=0, Total=2352 [2018-04-05 17:36:12,937 INFO L87 Difference]: Start difference. First operand 224 states and 230 transitions. Second operand 49 states. [2018-04-05 17:36:45,567 WARN L148 SmtUtils]: Spent 11649ms on a formula simplification that was a NOOP. DAG size: 76 [2018-04-05 17:36:48,307 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 36 DAG size of output 33 [2018-04-05 17:36:49,438 WARN L151 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 71 DAG size of output 40 [2018-04-05 17:36:58,792 WARN L151 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 79 DAG size of output 55 [2018-04-05 17:37:03,492 WARN L151 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 53 DAG size of output 48 Received shutdown request... [2018-04-05 17:37:24,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-05 17:37:24,034 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-05 17:37:24,043 WARN L197 ceAbstractionStarter]: Timeout [2018-04-05 17:37:24,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 05:37:24 BoogieIcfgContainer [2018-04-05 17:37:24,044 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-05 17:37:24,045 INFO L168 Benchmark]: Toolchain (without parser) took 279960.99 ms. Allocated memory was 305.7 MB in the beginning and 524.8 MB in the end (delta: 219.2 MB). Free memory was 243.5 MB in the beginning and 428.8 MB in the end (delta: -185.3 MB). Peak memory consumption was 33.9 MB. Max. memory is 5.3 GB. [2018-04-05 17:37:24,049 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 305.7 MB. Free memory is still 268.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-05 17:37:24,049 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.81 ms. Allocated memory is still 305.7 MB. Free memory was 243.5 MB in the beginning and 218.5 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. [2018-04-05 17:37:24,049 INFO L168 Benchmark]: Boogie Preprocessor took 54.18 ms. Allocated memory is still 305.7 MB. Free memory was 218.5 MB in the beginning and 216.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-04-05 17:37:24,050 INFO L168 Benchmark]: RCFGBuilder took 560.59 ms. Allocated memory was 305.7 MB in the beginning and 445.6 MB in the end (delta: 140.0 MB). Free memory was 216.5 MB in the beginning and 380.9 MB in the end (delta: -164.4 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. [2018-04-05 17:37:24,050 INFO L168 Benchmark]: TraceAbstraction took 278995.25 ms. Allocated memory was 445.6 MB in the beginning and 524.8 MB in the end (delta: 79.2 MB). Free memory was 380.9 MB in the beginning and 428.8 MB in the end (delta: -47.9 MB). Peak memory consumption was 31.2 MB. Max. memory is 5.3 GB. [2018-04-05 17:37:24,052 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.19 ms. Allocated memory is still 305.7 MB. Free memory is still 268.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 345.81 ms. Allocated memory is still 305.7 MB. Free memory was 243.5 MB in the beginning and 218.5 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 54.18 ms. Allocated memory is still 305.7 MB. Free memory was 218.5 MB in the beginning and 216.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 560.59 ms. Allocated memory was 305.7 MB in the beginning and 445.6 MB in the end (delta: 140.0 MB). Free memory was 216.5 MB in the beginning and 380.9 MB in the end (delta: -164.4 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 278995.25 ms. Allocated memory was 445.6 MB in the beginning and 524.8 MB in the end (delta: 79.2 MB). Free memory was 380.9 MB in the beginning and 428.8 MB in the end (delta: -47.9 MB). Peak memory consumption was 31.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 33 states, 49 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 84. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 33 states, 49 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 84. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 33 states, 49 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 84. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 33 states, 49 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 84. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 33 states, 49 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 84. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 33 states, 49 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 84. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 33 states, 49 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 84. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 33 states, 49 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 84. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 33 states, 49 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 84. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 33 states, 49 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 84. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 33 states, 49 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 84. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 33 states, 49 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 84. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 33 states, 49 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 84. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 33 states, 49 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 84. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 33 states, 49 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 84. - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 33 states, 49 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 84. - TimeoutResultAtElement [Line: 628]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 33 states, 49 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 84. - TimeoutResultAtElement [Line: 628]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 33 states, 49 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 84. - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 33 states, 49 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 84. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 87 locations, 19 error locations. TIMEOUT Result, 278.9s OverallTime, 29 OverallIterations, 5 TraceHistogramMax, 200.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2032 SDtfs, 5945 SDslu, 14261 SDs, 0 SdLazy, 11533 SolverSat, 872 SolverUnsat, 197 SolverUnknown, 0 SolverNotchecked, 87.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3239 GetRequests, 2395 SyntacticMatches, 74 SemanticMatches, 769 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 6674 ImplicationChecksByTransitivity, 159.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=28, 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.5s AutomataMinimizationTime, 28 MinimizatonAttempts, 600 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 75.4s InterpolantComputationTime, 1468 NumberOfCodeBlocks, 1468 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2878 ConstructedInterpolants, 492 QuantifiedInterpolants, 2061471 SizeOfPredicates, 292 NumberOfNonLiveVariables, 4935 ConjunctsInSsa, 486 ConjunctsInUnsatCore, 58 InterpolantComputations, 30 PerfectInterpolantSequences, 720/1198 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/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-05_17-37-24-065.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-05_17-37-24-065.csv Completed graceful shutdown