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/array-memsafety/cstrncat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-35b68b2 [2018-04-06 19:07:53,396 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-06 19:07:53,398 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-06 19:07:53,413 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-06 19:07:53,413 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-06 19:07:53,414 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-06 19:07:53,415 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-06 19:07:53,417 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-06 19:07:53,419 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-06 19:07:53,420 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-06 19:07:53,421 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-06 19:07:53,421 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-06 19:07:53,422 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-06 19:07:53,424 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-06 19:07:53,424 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-06 19:07:53,427 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-06 19:07:53,429 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-06 19:07:53,431 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-06 19:07:53,432 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-06 19:07:53,433 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-06 19:07:53,435 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-06 19:07:53,436 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-06 19:07:53,436 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-06 19:07:53,437 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-06 19:07:53,438 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-06 19:07:53,439 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-06 19:07:53,439 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-06 19:07:53,440 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-06 19:07:53,441 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-06 19:07:53,441 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-06 19:07:53,442 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-06 19:07:53,442 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-06 19:07:53,466 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-06 19:07:53,467 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-06 19:07:53,467 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-06 19:07:53,467 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-06 19:07:53,468 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-06 19:07:53,468 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-06 19:07:53,468 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-06 19:07:53,468 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-06 19:07:53,469 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-06 19:07:53,469 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-06 19:07:53,469 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-06 19:07:53,469 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-06 19:07:53,470 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-06 19:07:53,470 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-06 19:07:53,470 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-06 19:07:53,470 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-06 19:07:53,470 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-06 19:07:53,471 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-06 19:07:53,471 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-06 19:07:53,471 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-06 19:07:53,471 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-06 19:07:53,471 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-06 19:07:53,472 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-06 19:07:53,472 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-06 19:07:53,472 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-06 19:07:53,472 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-06 19:07:53,472 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-06 19:07:53,473 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-06 19:07:53,473 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-06 19:07:53,473 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-06 19:07:53,473 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-06 19:07:53,473 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-06 19:07:53,474 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:07:53,474 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-06 19:07:53,475 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-06 19:07:53,475 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-06 19:07:53,475 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-06 19:07:53,475 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-06 19:07:53,509 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-06 19:07:53,521 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-06 19:07:53,525 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-06 19:07:53,527 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-06 19:07:53,527 INFO L276 PluginConnector]: CDTParser initialized [2018-04-06 19:07:53,528 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:53,864 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG7a045a7f5 [2018-04-06 19:07:54,034 INFO L287 CDTParser]: IsIndexed: true [2018-04-06 19:07:54,034 INFO L288 CDTParser]: Found 1 translation units. [2018-04-06 19:07:54,034 INFO L168 CDTParser]: Scanning cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,045 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-06 19:07:54,045 INFO L215 ultiparseSymbolTable]: [2018-04-06 19:07:54,045 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-06 19:07:54,045 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,045 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,045 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,045 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__ ('') in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,046 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-06 19:07:54,046 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_quad_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,046 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____u_char in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,046 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____off64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,046 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_int32_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,046 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,046 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____id_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,047 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__sigset_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,047 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,047 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____rlim64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,047 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____blksize_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,047 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____uint32_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,047 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__blksize_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,047 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____u_long in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,047 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____qaddr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,047 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,047 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____int32_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,047 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__ulong in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,047 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__daddr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,048 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__clock_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,048 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____dev_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,048 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__key_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,048 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,048 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__mode_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,048 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_long in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,048 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____u_short in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,048 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____off_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,048 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____caddr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,048 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__fd_set in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,048 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__size_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,048 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,048 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____intptr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,049 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____u_quad_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,049 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____pid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,049 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____ino_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,049 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,049 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____quad_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,049 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fsid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,049 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_int in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,049 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,049 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__caddr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,049 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____sigset_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,049 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____gid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,049 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,049 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____mode_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,050 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____timer_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,050 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__off_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,050 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____int16_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,050 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__div_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,050 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_char in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,050 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____clockid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,050 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_int16_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,050 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__quad_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,050 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____suseconds_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,050 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,050 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__lldiv_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,050 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,051 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____socklen_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,051 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__uid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,051 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__int16_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,051 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__wchar_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,051 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____rlim_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,051 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____uid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,051 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,051 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,051 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__ssize_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,052 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,052 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fd_mask in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,052 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,052 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__id_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,052 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,052 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,052 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_short in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,052 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__gid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,053 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____nlink_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,053 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____clock_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,053 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_int8_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,053 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__clockid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,053 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__uint in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,053 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____int8_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,053 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__int32_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,053 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__nlink_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,053 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,054 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,054 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__timer_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,054 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____ssize_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,054 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____uint64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,054 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fsword_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,054 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,054 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__suseconds_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,054 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__fd_mask in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,054 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__ushort in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____ino64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____loff_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____time_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__int8_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____uint16_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__fsid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,056 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____daddr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,056 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,056 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__int64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,056 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____uint8_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,056 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____key_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,056 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__dev_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,056 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__ldiv_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,057 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_int64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,057 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__loff_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,057 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,057 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____u_int in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,057 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__time_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,057 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__ino_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,057 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,057 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,057 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____int64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,058 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____useconds_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,058 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__register_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,058 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,058 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:54,075 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG7a045a7f5 [2018-04-06 19:07:54,079 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-06 19:07:54,080 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-06 19:07:54,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-06 19:07:54,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-06 19:07:54,086 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-06 19:07:54,086 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 07:07:54" (1/1) ... [2018-04-06 19:07:54,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5195b95e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:07:54, skipping insertion in model container [2018-04-06 19:07:54,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 07:07:54" (1/1) ... [2018-04-06 19:07:54,102 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 19:07:54,132 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 19:07:54,321 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 19:07:54,373 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 19:07:54,381 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-06 19:07:54,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:07:54 WrapperNode [2018-04-06 19:07:54,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-06 19:07:54,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-06 19:07:54,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-06 19:07:54,428 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-06 19:07:54,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:07:54" (1/1) ... [2018-04-06 19:07:54,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:07:54" (1/1) ... [2018-04-06 19:07:54,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:07:54" (1/1) ... [2018-04-06 19:07:54,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:07:54" (1/1) ... [2018-04-06 19:07:54,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:07:54" (1/1) ... [2018-04-06 19:07:54,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:07:54" (1/1) ... [2018-04-06 19:07:54,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:07:54" (1/1) ... [2018-04-06 19:07:54,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-06 19:07:54,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-06 19:07:54,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-06 19:07:54,485 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-06 19:07:54,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:07:54" (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-06 19:07:54,618 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-06 19:07:54,618 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-06 19:07:54,618 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-06 19:07:54,618 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-06 19:07:54,618 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncat [2018-04-06 19:07:54,618 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-06 19:07:54,619 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-06 19:07:54,619 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-06 19:07:54,619 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-06 19:07:54,619 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-06 19:07:54,619 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-06 19:07:54,619 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-06 19:07:54,619 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-06 19:07:54,619 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-06 19:07:54,619 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-06 19:07:54,619 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-06 19:07:54,620 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-06 19:07:54,620 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-06 19:07:54,620 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-06 19:07:54,620 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-06 19:07:54,620 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-06 19:07:54,620 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-06 19:07:54,620 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-06 19:07:54,620 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-06 19:07:54,620 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-06 19:07:54,620 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-06 19:07:54,621 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-06 19:07:54,621 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-06 19:07:54,621 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-06 19:07:54,621 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-06 19:07:54,621 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-06 19:07:54,621 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-06 19:07:54,621 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-06 19:07:54,621 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-06 19:07:54,621 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-06 19:07:54,622 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-06 19:07:54,622 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-06 19:07:54,622 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-06 19:07:54,622 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-06 19:07:54,622 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-06 19:07:54,622 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-06 19:07:54,622 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-06 19:07:54,622 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-06 19:07:54,623 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-06 19:07:54,623 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-06 19:07:54,623 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-06 19:07:54,623 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-06 19:07:54,623 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-06 19:07:54,623 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-06 19:07:54,623 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-06 19:07:54,624 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-06 19:07:54,624 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-06 19:07:54,624 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-06 19:07:54,624 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-06 19:07:54,624 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-06 19:07:54,624 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-06 19:07:54,624 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-06 19:07:54,624 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-06 19:07:54,625 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-06 19:07:54,625 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-06 19:07:54,625 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-06 19:07:54,625 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-06 19:07:54,625 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-06 19:07:54,625 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-06 19:07:54,625 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-06 19:07:54,625 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-06 19:07:54,626 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-06 19:07:54,626 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-06 19:07:54,626 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-06 19:07:54,626 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-06 19:07:54,626 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-06 19:07:54,626 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-06 19:07:54,626 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-06 19:07:54,626 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-06 19:07:54,627 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-06 19:07:54,627 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-06 19:07:54,627 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-06 19:07:54,627 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-06 19:07:54,627 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-06 19:07:54,627 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-06 19:07:54,627 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-06 19:07:54,627 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-06 19:07:54,628 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-06 19:07:54,628 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-06 19:07:54,628 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-06 19:07:54,628 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-06 19:07:54,628 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-06 19:07:54,628 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-06 19:07:54,628 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-06 19:07:54,629 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-06 19:07:54,629 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-06 19:07:54,629 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-06 19:07:54,629 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-06 19:07:54,629 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-06 19:07:54,629 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-06 19:07:54,629 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-06 19:07:54,629 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-06 19:07:54,630 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-06 19:07:54,630 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-06 19:07:54,630 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-06 19:07:54,630 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-06 19:07:54,630 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-06 19:07:54,630 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-06 19:07:54,630 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-06 19:07:54,630 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-06 19:07:54,631 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-06 19:07:54,631 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-06 19:07:54,631 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-06 19:07:54,631 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-06 19:07:54,631 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncat [2018-04-06 19:07:54,631 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-06 19:07:54,631 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-06 19:07:54,631 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-06 19:07:54,632 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-06 19:07:54,632 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-06 19:07:54,632 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-06 19:07:54,632 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-06 19:07:54,632 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-06 19:07:55,040 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-06 19:07:55,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 07:07:55 BoogieIcfgContainer [2018-04-06 19:07:55,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-06 19:07:55,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-06 19:07:55,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-06 19:07:55,046 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-06 19:07:55,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 07:07:54" (1/3) ... [2018-04-06 19:07:55,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9e0ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 07:07:55, skipping insertion in model container [2018-04-06 19:07:55,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:07:54" (2/3) ... [2018-04-06 19:07:55,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9e0ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 07:07:55, skipping insertion in model container [2018-04-06 19:07:55,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 07:07:55" (3/3) ... [2018-04-06 19:07:55,049 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:07:55,058 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-06 19:07:55,066 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-04-06 19:07:55,107 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-06 19:07:55,108 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-06 19:07:55,108 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-06 19:07:55,108 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-06 19:07:55,108 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-06 19:07:55,108 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-06 19:07:55,108 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-06 19:07:55,108 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-06 19:07:55,108 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-06 19:07:55,109 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-06 19:07:55,127 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states. [2018-04-06 19:07:55,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-06 19:07:55,132 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:07:55,134 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-06 19:07:55,134 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:07:55,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1326053013, 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-06 19:07:55,152 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:07:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:07:55,186 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:07:55,212 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-06 19:07:55,213 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:07:55,224 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-06 19:07:55,247 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:07:55,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-06 19:07:55,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-06 19:07:55,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-06 19:07:55,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-06 19:07:55,261 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 3 states. [2018-04-06 19:07:55,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:07:55,366 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2018-04-06 19:07:55,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-06 19:07:55,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-04-06 19:07:55,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:07:55,380 INFO L225 Difference]: With dead ends: 145 [2018-04-06 19:07:55,380 INFO L226 Difference]: Without dead ends: 92 [2018-04-06 19:07:55,384 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-06 19:07:55,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-04-06 19:07:55,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-04-06 19:07:55,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-04-06 19:07:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2018-04-06 19:07:55,421 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 21 [2018-04-06 19:07:55,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:07:55,421 INFO L459 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2018-04-06 19:07:55,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-06 19:07:55,422 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2018-04-06 19:07:55,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-06 19:07:55,422 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:07:55,423 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:07:55,423 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:07:55,423 INFO L82 PathProgramCache]: Analyzing trace with hash 722601381, 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-06 19:07:55,429 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:07:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:07:55,449 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:07:55,476 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-06 19:07:55,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:55,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:07:55,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 19:07:55,511 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-06 19:07:55,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:55,518 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-06 19:07:55,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-06 19:07:55,535 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-06 19:07:55,536 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:07:55,552 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-06 19:07:55,579 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:07:55,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 19:07:55,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 19:07:55,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 19:07:55,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 19:07:55,582 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 4 states. [2018-04-06 19:07:55,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:07:55,705 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2018-04-06 19:07:55,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-06 19:07:55,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-04-06 19:07:55,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:07:55,707 INFO L225 Difference]: With dead ends: 92 [2018-04-06 19:07:55,707 INFO L226 Difference]: Without dead ends: 91 [2018-04-06 19:07:55,708 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-06 19:07:55,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-04-06 19:07:55,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-04-06 19:07:55,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-04-06 19:07:55,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2018-04-06 19:07:55,719 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 24 [2018-04-06 19:07:55,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:07:55,720 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2018-04-06 19:07:55,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 19:07:55,720 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2018-04-06 19:07:55,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-06 19:07:55,721 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:07:55,721 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:07:55,722 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:07:55,722 INFO L82 PathProgramCache]: Analyzing trace with hash 722601382, 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-06 19:07:55,735 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:07:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:07:55,755 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:07:55,808 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-06 19:07:55,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:55,823 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-06 19:07:55,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:55,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:07:55,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-06 19:07:55,921 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:07:55,923 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:07:55,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, 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-06 19:07:55,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:55,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:07:55,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:07:55,954 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-06 19:07:55,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:55,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 19:07:55,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:24 [2018-04-06 19:07:56,027 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-06 19:07:56,028 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:07:56,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-04-06 19:07:56,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:56,238 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 17 treesize of output 20 [2018-04-06 19:07:56,267 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 14 treesize of output 3 [2018-04-06 19:07:56,268 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:56,273 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:07:56,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:07:56,282 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:29, output treesize:9 [2018-04-06 19:07:56,323 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-06 19:07:56,344 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:07:56,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2018-04-06 19:07:56,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-06 19:07:56,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-06 19:07:56,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-04-06 19:07:56,345 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand 13 states. [2018-04-06 19:07:56,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:07:56,557 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2018-04-06 19:07:56,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-06 19:07:56,557 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-04-06 19:07:56,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:07:56,559 INFO L225 Difference]: With dead ends: 91 [2018-04-06 19:07:56,559 INFO L226 Difference]: Without dead ends: 90 [2018-04-06 19:07:56,560 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-04-06 19:07:56,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-04-06 19:07:56,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-04-06 19:07:56,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-04-06 19:07:56,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2018-04-06 19:07:56,569 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 24 [2018-04-06 19:07:56,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:07:56,569 INFO L459 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2018-04-06 19:07:56,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-06 19:07:56,570 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2018-04-06 19:07:56,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-06 19:07:56,571 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:07:56,571 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:07:56,571 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:07:56,571 INFO L82 PathProgramCache]: Analyzing trace with hash 925806431, 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-06 19:07:56,578 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:07:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:07:56,596 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:07:56,602 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-06 19:07:56,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:56,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:07:56,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 19:07:56,615 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-06 19:07:56,615 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:07:56,632 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-06 19:07:56,667 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:07:56,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 19:07:56,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 19:07:56,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 19:07:56,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 19:07:56,668 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 4 states. [2018-04-06 19:07:56,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:07:56,720 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-04-06 19:07:56,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-06 19:07:56,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-04-06 19:07:56,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:07:56,722 INFO L225 Difference]: With dead ends: 90 [2018-04-06 19:07:56,722 INFO L226 Difference]: Without dead ends: 89 [2018-04-06 19:07:56,722 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-06 19:07:56,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-04-06 19:07:56,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-04-06 19:07:56,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-06 19:07:56,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2018-04-06 19:07:56,728 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 25 [2018-04-06 19:07:56,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:07:56,728 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2018-04-06 19:07:56,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 19:07:56,728 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2018-04-06 19:07:56,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-06 19:07:56,729 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:07:56,729 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:07:56,729 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:07:56,729 INFO L82 PathProgramCache]: Analyzing trace with hash 925806432, 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-06 19:07:56,735 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:07:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:07:56,748 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:07:56,754 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-06 19:07:56,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:56,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:07:56,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-06 19:07:56,770 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-06 19:07:56,770 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:07:56,788 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-06 19:07:56,808 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:07:56,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-06 19:07:56,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-06 19:07:56,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-06 19:07:56,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-06 19:07:56,809 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 7 states. [2018-04-06 19:07:56,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:07:56,893 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2018-04-06 19:07:56,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 19:07:56,893 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-04-06 19:07:56,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:07:56,894 INFO L225 Difference]: With dead ends: 89 [2018-04-06 19:07:56,894 INFO L226 Difference]: Without dead ends: 88 [2018-04-06 19:07:56,894 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-06 19:07:56,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-06 19:07:56,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-04-06 19:07:56,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-06 19:07:56,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-04-06 19:07:56,900 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 25 [2018-04-06 19:07:56,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:07:56,900 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-04-06 19:07:56,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-06 19:07:56,901 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-04-06 19:07:56,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-06 19:07:56,902 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:07:56,902 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:07:56,902 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:07:56,902 INFO L82 PathProgramCache]: Analyzing trace with hash -506179908, 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-06 19:07:56,916 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:07:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:07:56,935 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:07:56,960 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-06 19:07:56,960 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:07:56,972 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-06 19:07:56,993 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:07:56,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-06 19:07:56,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-06 19:07:56,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-06 19:07:56,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-06 19:07:56,995 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 6 states. [2018-04-06 19:07:57,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:07:57,114 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-04-06 19:07:57,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 19:07:57,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-04-06 19:07:57,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:07:57,115 INFO L225 Difference]: With dead ends: 118 [2018-04-06 19:07:57,116 INFO L226 Difference]: Without dead ends: 114 [2018-04-06 19:07:57,116 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-06 19:07:57,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-04-06 19:07:57,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 101. [2018-04-06 19:07:57,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-06 19:07:57,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2018-04-06 19:07:57,127 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 32 [2018-04-06 19:07:57,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:07:57,127 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2018-04-06 19:07:57,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-06 19:07:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2018-04-06 19:07:57,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-06 19:07:57,129 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:07:57,129 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:07:57,129 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:07:57,129 INFO L82 PathProgramCache]: Analyzing trace with hash -506179907, 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-06 19:07:57,139 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:07:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:07:57,158 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:07:57,236 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-06 19:07:57,236 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:07:57,248 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 18 treesize of output 14 [2018-04-06 19:07:57,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:57,255 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 14 treesize of output 12 [2018-04-06 19:07:57,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:57,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:07:57,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:7 [2018-04-06 19:07:57,273 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-06 19:07:57,294 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:07:57,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2018-04-06 19:07:57,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-06 19:07:57,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-06 19:07:57,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-06 19:07:57,295 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 10 states. [2018-04-06 19:07:57,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:07:57,435 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-04-06 19:07:57,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 19:07:57,435 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-04-06 19:07:57,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:07:57,436 INFO L225 Difference]: With dead ends: 114 [2018-04-06 19:07:57,436 INFO L226 Difference]: Without dead ends: 110 [2018-04-06 19:07:57,436 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-04-06 19:07:57,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-04-06 19:07:57,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2018-04-06 19:07:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-06 19:07:57,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-04-06 19:07:57,443 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 32 [2018-04-06 19:07:57,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:07:57,443 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-04-06 19:07:57,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-06 19:07:57,443 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-04-06 19:07:57,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-06 19:07:57,444 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:07:57,444 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-06 19:07:57,444 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:07:57,444 INFO L82 PathProgramCache]: Analyzing trace with hash -963804542, 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-06 19:07:57,451 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:07:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:07:57,475 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:07:57,498 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-06 19:07:57,498 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:07:57,506 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-06 19:07:57,527 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:07:57,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-06 19:07:57,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-06 19:07:57,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-06 19:07:57,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-06 19:07:57,528 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 7 states. [2018-04-06 19:07:57,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:07:57,619 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2018-04-06 19:07:57,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-06 19:07:57,620 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-04-06 19:07:57,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:07:57,621 INFO L225 Difference]: With dead ends: 110 [2018-04-06 19:07:57,621 INFO L226 Difference]: Without dead ends: 109 [2018-04-06 19:07:57,621 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-06 19:07:57,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-06 19:07:57,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2018-04-06 19:07:57,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-04-06 19:07:57,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-04-06 19:07:57,628 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 39 [2018-04-06 19:07:57,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:07:57,629 INFO L459 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-04-06 19:07:57,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-06 19:07:57,629 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-04-06 19:07:57,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-06 19:07:57,630 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:07:57,630 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-06 19:07:57,630 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:07:57,631 INFO L82 PathProgramCache]: Analyzing trace with hash -963804541, 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-06 19:07:57,638 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:07:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:07:57,658 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:07:57,673 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-06 19:07:57,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:57,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:07:57,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:57,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:07:57,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-04-06 19:07:57,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:07:57,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:07:57,716 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-06 19:07:57,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:57,723 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:07:57,724 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 14 treesize of output 23 [2018-04-06 19:07:57,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:57,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:07:57,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-04-06 19:07:57,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:07:57,890 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:07:58,089 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-06 19:07:58,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:58,094 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 11 treesize of output 15 [2018-04-06 19:07:58,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-06 19:07:58,104 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:58,105 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 19:07:58,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:58,108 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:07:58,111 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-06 19:07:58,111 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:21, output treesize:3 [2018-04-06 19:07:58,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:07:58,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:07:58,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-04-06 19:07:58,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-06 19:07:58,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-06 19:07:58,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2018-04-06 19:07:58,172 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 24 states. [2018-04-06 19:07:58,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:07:58,902 INFO L93 Difference]: Finished difference Result 183 states and 199 transitions. [2018-04-06 19:07:58,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-06 19:07:58,903 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 39 [2018-04-06 19:07:58,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:07:58,906 INFO L225 Difference]: With dead ends: 183 [2018-04-06 19:07:58,906 INFO L226 Difference]: Without dead ends: 182 [2018-04-06 19:07:58,907 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=1063, Unknown=0, NotChecked=0, Total=1260 [2018-04-06 19:07:58,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-04-06 19:07:58,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 106. [2018-04-06 19:07:58,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-04-06 19:07:58,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2018-04-06 19:07:58,915 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 39 [2018-04-06 19:07:58,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:07:58,915 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2018-04-06 19:07:58,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-06 19:07:58,916 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2018-04-06 19:07:58,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-06 19:07:58,917 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:07:58,917 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:07:58,917 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:07:58,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1123521185, 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-06 19:07:58,931 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:07:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:07:58,957 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:07:58,978 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-06 19:07:58,978 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:07:58,987 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-06 19:07:59,008 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:07:59,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-06 19:07:59,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-06 19:07:59,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-06 19:07:59,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-06 19:07:59,009 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand 6 states. [2018-04-06 19:07:59,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:07:59,073 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-04-06 19:07:59,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 19:07:59,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-04-06 19:07:59,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:07:59,074 INFO L225 Difference]: With dead ends: 111 [2018-04-06 19:07:59,074 INFO L226 Difference]: Without dead ends: 110 [2018-04-06 19:07:59,074 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-06 19:07:59,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-04-06 19:07:59,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2018-04-06 19:07:59,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-06 19:07:59,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2018-04-06 19:07:59,081 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 40 [2018-04-06 19:07:59,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:07:59,082 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2018-04-06 19:07:59,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-06 19:07:59,082 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-04-06 19:07:59,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-06 19:07:59,083 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:07:59,083 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:07:59,083 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:07:59,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1123521186, 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-06 19:07:59,094 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:07:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:07:59,118 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:07:59,170 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-06 19:07:59,170 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:07:59,177 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 12 treesize of output 10 [2018-04-06 19:07:59,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:59,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-06 19:07:59,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:59,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:07:59,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-06 19:07:59,197 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-06 19:07:59,217 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:07:59,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2018-04-06 19:07:59,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-06 19:07:59,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-06 19:07:59,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-06 19:07:59,218 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 9 states. [2018-04-06 19:07:59,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:07:59,338 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2018-04-06 19:07:59,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 19:07:59,338 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-04-06 19:07:59,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:07:59,339 INFO L225 Difference]: With dead ends: 142 [2018-04-06 19:07:59,339 INFO L226 Difference]: Without dead ends: 141 [2018-04-06 19:07:59,340 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-04-06 19:07:59,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-06 19:07:59,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 122. [2018-04-06 19:07:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-06 19:07:59,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2018-04-06 19:07:59,345 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 40 [2018-04-06 19:07:59,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:07:59,345 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2018-04-06 19:07:59,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-06 19:07:59,345 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2018-04-06 19:07:59,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-06 19:07:59,346 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:07:59,346 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-04-06 19:07:59,346 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:07:59,346 INFO L82 PathProgramCache]: Analyzing trace with hash 63808509, now seen corresponding path program 2 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-06 19:07:59,352 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:07:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:07:59,377 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:07:59,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:07:59,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:59,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:07:59,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-06 19:07:59,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:07:59,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:07:59,415 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-06 19:07:59,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:59,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:07:59,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-04-06 19:07:59,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-04-06 19:07:59,471 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 14 treesize of output 13 [2018-04-06 19:07:59,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:59,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:07:59,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 19:07:59,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-04-06 19:07:59,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-06 19:07:59,559 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 11 treesize of output 10 [2018-04-06 19:07:59,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:59,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:07:59,574 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-06 19:07:59,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:49, output treesize:45 [2018-04-06 19:07:59,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-04-06 19:07:59,832 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-06 19:07:59,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:07:59,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:07:59,847 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 1 case distinctions, treesize of input 25 treesize of output 37 [2018-04-06 19:07:59,848 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-06 19:07:59,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:07:59,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:07:59,905 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:70, output treesize:43 [2018-04-06 19:08:00,010 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:08:00,010 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:08:00,461 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 18 treesize of output 14 [2018-04-06 19:08:00,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:00,469 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 35 treesize of output 31 [2018-04-06 19:08:00,484 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:08:00,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-06 19:08:00,486 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:00,489 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:08:00,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:08:00,496 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:58, output treesize:14 [2018-04-06 19:08:00,600 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:08:00,622 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:08:00,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 34 [2018-04-06 19:08:00,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-06 19:08:00,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-06 19:08:00,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2018-04-06 19:08:00,623 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand 35 states. [2018-04-06 19:08:11,797 WARN L151 SmtUtils]: Spent 3550ms on a formula simplification. DAG size of input: 83 DAG size of output 70 [2018-04-06 19:08:13,954 WARN L151 SmtUtils]: Spent 2087ms on a formula simplification. DAG size of input: 79 DAG size of output 72 [2018-04-06 19:08:22,325 WARN L151 SmtUtils]: Spent 6128ms on a formula simplification. DAG size of input: 97 DAG size of output 87 [2018-04-06 19:08:30,042 WARN L151 SmtUtils]: Spent 287ms on a formula simplification. DAG size of input: 84 DAG size of output 70 [2018-04-06 19:08:34,882 WARN L151 SmtUtils]: Spent 337ms on a formula simplification. DAG size of input: 80 DAG size of output 70 [2018-04-06 19:08:37,495 WARN L151 SmtUtils]: Spent 2539ms on a formula simplification. DAG size of input: 100 DAG size of output 88 [2018-04-06 19:08:44,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:08:44,237 INFO L93 Difference]: Finished difference Result 260 states and 282 transitions. [2018-04-06 19:08:44,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-06 19:08:44,237 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 46 [2018-04-06 19:08:44,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:08:44,239 INFO L225 Difference]: With dead ends: 260 [2018-04-06 19:08:44,239 INFO L226 Difference]: Without dead ends: 259 [2018-04-06 19:08:44,240 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 34.5s TimeCoverageRelationStatistics Valid=691, Invalid=3594, Unknown=5, NotChecked=0, Total=4290 [2018-04-06 19:08:44,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-04-06 19:08:44,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 112. [2018-04-06 19:08:44,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-04-06 19:08:44,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2018-04-06 19:08:44,248 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 46 [2018-04-06 19:08:44,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:08:44,248 INFO L459 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2018-04-06 19:08:44,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-06 19:08:44,248 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2018-04-06 19:08:44,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-06 19:08:44,249 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:08:44,249 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:08:44,249 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:08:44,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1465279656, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:08:44,255 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:08:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:08:44,273 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:08:44,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:08:44,313 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:08:44,362 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-06 19:08:44,383 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:08:44,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2018-04-06 19:08:44,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-06 19:08:44,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-06 19:08:44,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-06 19:08:44,385 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand 7 states. [2018-04-06 19:08:44,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:08:44,446 INFO L93 Difference]: Finished difference Result 193 states and 210 transitions. [2018-04-06 19:08:44,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-06 19:08:44,446 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-04-06 19:08:44,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:08:44,447 INFO L225 Difference]: With dead ends: 193 [2018-04-06 19:08:44,447 INFO L226 Difference]: Without dead ends: 163 [2018-04-06 19:08:44,448 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-04-06 19:08:44,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-06 19:08:44,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 135. [2018-04-06 19:08:44,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-06 19:08:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 151 transitions. [2018-04-06 19:08:44,455 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 151 transitions. Word has length 54 [2018-04-06 19:08:44,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:08:44,456 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 151 transitions. [2018-04-06 19:08:44,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-06 19:08:44,456 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 151 transitions. [2018-04-06 19:08:44,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-06 19:08:44,457 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:08:44,457 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:08:44,457 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:08:44,457 INFO L82 PathProgramCache]: Analyzing trace with hash 834800017, 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-06 19:08:44,464 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:08:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:08:44,480 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:08:44,488 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-06 19:08:44,488 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:08:44,492 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-06 19:08:44,526 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:08:44,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 19:08:44,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-06 19:08:44,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-06 19:08:44,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-06 19:08:44,527 INFO L87 Difference]: Start difference. First operand 135 states and 151 transitions. Second operand 3 states. [2018-04-06 19:08:44,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:08:44,538 INFO L93 Difference]: Finished difference Result 182 states and 201 transitions. [2018-04-06 19:08:44,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-06 19:08:44,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-04-06 19:08:44,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:08:44,539 INFO L225 Difference]: With dead ends: 182 [2018-04-06 19:08:44,539 INFO L226 Difference]: Without dead ends: 95 [2018-04-06 19:08:44,540 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-06 19:08:44,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-06 19:08:44,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-04-06 19:08:44,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-04-06 19:08:44,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2018-04-06 19:08:44,547 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 54 [2018-04-06 19:08:44,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:08:44,547 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2018-04-06 19:08:44,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-06 19:08:44,547 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2018-04-06 19:08:44,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-06 19:08:44,548 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:08:44,548 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:08:44,548 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:08:44,548 INFO L82 PathProgramCache]: Analyzing trace with hash -269889426, 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-06 19:08:44,554 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:08:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:08:44,577 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:08:44,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-06 19:08:44,595 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 11 treesize of output 10 [2018-04-06 19:08:44,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:44,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:08:44,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 19:08:44,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-04-06 19:08:44,676 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 20 treesize of output 16 [2018-04-06 19:08:44,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-06 19:08:44,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:08:44,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:08:44,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:08:44,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-04-06 19:08:44,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:08:44,780 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:08:44,984 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 16 treesize of output 12 [2018-04-06 19:08:44,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:44,991 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 13 treesize of output 11 [2018-04-06 19:08:44,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2018-04-06 19:08:44,999 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:45,000 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:08:45,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:08:45,005 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-04-06 19:08:45,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:08:45,034 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:08:45,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-04-06 19:08:45,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-06 19:08:45,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-06 19:08:45,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2018-04-06 19:08:45,035 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 21 states. [2018-04-06 19:08:45,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:08:45,716 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-04-06 19:08:45,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-06 19:08:45,716 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2018-04-06 19:08:45,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:08:45,717 INFO L225 Difference]: With dead ends: 139 [2018-04-06 19:08:45,717 INFO L226 Difference]: Without dead ends: 138 [2018-04-06 19:08:45,718 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=165, Invalid=891, Unknown=0, NotChecked=0, Total=1056 [2018-04-06 19:08:45,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-04-06 19:08:45,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 112. [2018-04-06 19:08:45,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-04-06 19:08:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-04-06 19:08:45,725 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 58 [2018-04-06 19:08:45,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:08:45,726 INFO L459 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-04-06 19:08:45,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-06 19:08:45,726 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-04-06 19:08:45,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-06 19:08:45,727 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:08:45,727 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:08:45,727 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:08:45,727 INFO L82 PathProgramCache]: Analyzing trace with hash 853842009, 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-06 19:08:45,734 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:08:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:08:45,752 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:08:45,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:08:45,774 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 21 [2018-04-06 19:08:45,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:08:45,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-06 19:08:45,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:45,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:08:45,785 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-06 19:08:45,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-06 19:08:45,823 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0))))) is different from true [2018-04-06 19:08:45,828 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0))))) is different from true [2018-04-06 19:08:45,838 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-06 19:08:45,838 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:08:45,859 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_17| Int)) (or (not (= (select |c_#valid| |v_main_#t~malloc14.base_17|) 0)) (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc14.base_17| 1) |c_main_#t~malloc13.base| 0) |v_main_#t~malloc14.base_17| 0)))) is different from false [2018-04-06 19:08:45,867 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc13.base_16| Int) (|v_main_#t~malloc14.base_17| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_16| 1))) (or (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc14.base_17| 1) |v_main_#t~malloc13.base_16| 0) |v_main_#t~malloc14.base_17| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc13.base_16|))) (not (= (select .cse0 |v_main_#t~malloc14.base_17|) 0))))) is different from false [2018-04-06 19:08:45,891 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-06 19:08:45,916 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:08:45,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-06 19:08:45,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 19:08:45,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 19:08:45,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-06 19:08:45,917 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 12 states. [2018-04-06 19:08:45,940 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc13.base_16| Int) (|v_main_#t~malloc14.base_17| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_16| 1))) (or (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc14.base_17| 1) |v_main_#t~malloc13.base_16| 0) |v_main_#t~malloc14.base_17| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc13.base_16|))) (not (= (select .cse0 |v_main_#t~malloc14.base_17|) 0)))))) is different from false [2018-04-06 19:08:46,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:08:46,266 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2018-04-06 19:08:46,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 19:08:46,267 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-04-06 19:08:46,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:08:46,268 INFO L225 Difference]: With dead ends: 205 [2018-04-06 19:08:46,268 INFO L226 Difference]: Without dead ends: 186 [2018-04-06 19:08:46,269 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-06 19:08:46,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-04-06 19:08:46,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 181. [2018-04-06 19:08:46,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-06 19:08:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 198 transitions. [2018-04-06 19:08:46,282 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 198 transitions. Word has length 59 [2018-04-06 19:08:46,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:08:46,282 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 198 transitions. [2018-04-06 19:08:46,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 19:08:46,283 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 198 transitions. [2018-04-06 19:08:46,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-06 19:08:46,284 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:08:46,284 INFO L355 BasicCegarLoop]: trace histogram [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-06 19:08:46,284 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:08:46,284 INFO L82 PathProgramCache]: Analyzing trace with hash 223362370, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:08:46,310 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:08:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:08:46,336 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:08:46,370 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-06 19:08:46,370 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:08:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-06 19:08:46,411 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:08:46,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-06 19:08:46,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-06 19:08:46,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-06 19:08:46,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-06 19:08:46,412 INFO L87 Difference]: Start difference. First operand 181 states and 198 transitions. Second operand 7 states. [2018-04-06 19:08:46,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:08:46,532 INFO L93 Difference]: Finished difference Result 185 states and 202 transitions. [2018-04-06 19:08:46,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-06 19:08:46,532 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2018-04-06 19:08:46,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:08:46,533 INFO L225 Difference]: With dead ends: 185 [2018-04-06 19:08:46,533 INFO L226 Difference]: Without dead ends: 183 [2018-04-06 19:08:46,533 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-06 19:08:46,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-06 19:08:46,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2018-04-06 19:08:46,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-06 19:08:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 194 transitions. [2018-04-06 19:08:46,546 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 194 transitions. Word has length 59 [2018-04-06 19:08:46,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:08:46,547 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 194 transitions. [2018-04-06 19:08:46,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-06 19:08:46,547 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 194 transitions. [2018-04-06 19:08:46,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-06 19:08:46,548 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:08:46,548 INFO L355 BasicCegarLoop]: trace histogram [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-06 19:08:46,548 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:08:46,548 INFO L82 PathProgramCache]: Analyzing trace with hash 223362371, 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-06 19:08:46,556 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:08:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:08:46,576 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:08:46,581 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-06 19:08:46,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:46,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:08:46,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:7 [2018-04-06 19:08:46,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:08:46,765 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:08:47,234 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:08:47,256 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:08:47,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-04-06 19:08:47,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-06 19:08:47,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-06 19:08:47,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1023, Unknown=0, NotChecked=0, Total=1122 [2018-04-06 19:08:47,258 INFO L87 Difference]: Start difference. First operand 179 states and 194 transitions. Second operand 34 states. [2018-04-06 19:08:48,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:08:48,681 INFO L93 Difference]: Finished difference Result 335 states and 366 transitions. [2018-04-06 19:08:48,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-06 19:08:48,682 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 59 [2018-04-06 19:08:48,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:08:48,683 INFO L225 Difference]: With dead ends: 335 [2018-04-06 19:08:48,683 INFO L226 Difference]: Without dead ends: 334 [2018-04-06 19:08:48,684 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=523, Invalid=3259, Unknown=0, NotChecked=0, Total=3782 [2018-04-06 19:08:48,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-04-06 19:08:48,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 273. [2018-04-06 19:08:48,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-04-06 19:08:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 298 transitions. [2018-04-06 19:08:48,703 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 298 transitions. Word has length 59 [2018-04-06 19:08:48,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:08:48,703 INFO L459 AbstractCegarLoop]: Abstraction has 273 states and 298 transitions. [2018-04-06 19:08:48,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-06 19:08:48,703 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 298 transitions. [2018-04-06 19:08:48,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-06 19:08:48,704 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:08:48,705 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:08:48,705 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:08:48,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1771820582, 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-06 19:08:48,711 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:08:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:08:48,734 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:08:48,779 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-06 19:08:48,779 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:08:48,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:08:48,819 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:08:48,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2018-04-06 19:08:48,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-06 19:08:48,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-06 19:08:48,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-06 19:08:48,820 INFO L87 Difference]: Start difference. First operand 273 states and 298 transitions. Second operand 7 states. [2018-04-06 19:08:48,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:08:48,860 INFO L93 Difference]: Finished difference Result 412 states and 449 transitions. [2018-04-06 19:08:48,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-06 19:08:48,861 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2018-04-06 19:08:48,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:08:48,863 INFO L225 Difference]: With dead ends: 412 [2018-04-06 19:08:48,863 INFO L226 Difference]: Without dead ends: 271 [2018-04-06 19:08:48,864 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-06 19:08:48,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-04-06 19:08:48,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-04-06 19:08:48,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-04-06 19:08:48,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 294 transitions. [2018-04-06 19:08:48,877 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 294 transitions. Word has length 60 [2018-04-06 19:08:48,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:08:48,877 INFO L459 AbstractCegarLoop]: Abstraction has 271 states and 294 transitions. [2018-04-06 19:08:48,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-06 19:08:48,877 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 294 transitions. [2018-04-06 19:08:48,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-06 19:08:48,878 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:08:48,878 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:08:48,878 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:08:48,879 INFO L82 PathProgramCache]: Analyzing trace with hash 8763489, now seen corresponding path program 1 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-06 19:08:48,890 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:08:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:08:48,918 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:08:48,949 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:08:48,950 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-06 19:08:48,952 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-06 19:08:48,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:48,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:08:48,960 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-06 19:08:48,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-06 19:08:48,993 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0))))) is different from true [2018-04-06 19:08:49,002 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0))))) is different from true [2018-04-06 19:08:49,014 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-06 19:08:49,015 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:08:49,057 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_22| Int)) (or (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc14.base_22| 1) |c_main_#t~malloc13.base| 0) |v_main_#t~malloc14.base_22| 0)) (not (= (select |c_#valid| |v_main_#t~malloc14.base_22|) 0)))) is different from false [2018-04-06 19:08:49,062 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_22| Int) (|v_main_#t~malloc13.base_21| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_21| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc14.base_22| 1) |v_main_#t~malloc13.base_21| 0) |v_main_#t~malloc14.base_22| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc13.base_21|) 0)) (not (= (select .cse0 |v_main_#t~malloc14.base_22|) 0))))) is different from false [2018-04-06 19:08:49,079 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-06 19:08:49,100 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:08:49,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-06 19:08:49,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 19:08:49,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 19:08:49,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-06 19:08:49,101 INFO L87 Difference]: Start difference. First operand 271 states and 294 transitions. Second operand 12 states. [2018-04-06 19:08:49,117 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc14.base_22| Int) (|v_main_#t~malloc13.base_21| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_21| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc14.base_22| 1) |v_main_#t~malloc13.base_21| 0) |v_main_#t~malloc14.base_22| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc13.base_21|) 0)) (not (= (select .cse0 |v_main_#t~malloc14.base_22|) 0)))))) is different from false [2018-04-06 19:08:49,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:08:49,552 INFO L93 Difference]: Finished difference Result 407 states and 441 transitions. [2018-04-06 19:08:49,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 19:08:49,553 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-04-06 19:08:49,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:08:49,554 INFO L225 Difference]: With dead ends: 407 [2018-04-06 19:08:49,554 INFO L226 Difference]: Without dead ends: 388 [2018-04-06 19:08:49,555 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-06 19:08:49,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-04-06 19:08:49,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 270. [2018-04-06 19:08:49,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-04-06 19:08:49,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 292 transitions. [2018-04-06 19:08:49,565 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 292 transitions. Word has length 60 [2018-04-06 19:08:49,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:08:49,566 INFO L459 AbstractCegarLoop]: Abstraction has 270 states and 292 transitions. [2018-04-06 19:08:49,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 19:08:49,566 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 292 transitions. [2018-04-06 19:08:49,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-06 19:08:49,566 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:08:49,566 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:08:49,566 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:08:49,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1710677306, 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-06 19:08:49,577 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:08:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:08:49,605 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:08:49,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:08:49,639 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-06 19:08:49,642 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-06 19:08:49,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:49,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:08:49,666 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-06 19:08:49,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-06 19:08:49,713 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0))))) is different from true [2018-04-06 19:08:49,718 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0))))) is different from true [2018-04-06 19:08:49,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:08:49,730 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:08:49,772 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_24| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc14.base_24| 1) |c_main_#t~malloc13.base| 0) |v_main_#t~malloc14.base_24| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc14.base_24|) 0)))) is different from false [2018-04-06 19:08:49,777 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_24| Int) (|v_main_#t~malloc13.base_23| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_23| 1))) (or (not (= (select .cse0 |v_main_#t~malloc14.base_24|) 0)) (not (= (select |c_#valid| |v_main_#t~malloc13.base_23|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc14.base_24| 1) |v_main_#t~malloc13.base_23| 0) |v_main_#t~malloc14.base_24| 0))))) is different from false [2018-04-06 19:08:49,817 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-06 19:08:49,852 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:08:49,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-06 19:08:49,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 19:08:49,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 19:08:49,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-06 19:08:49,853 INFO L87 Difference]: Start difference. First operand 270 states and 292 transitions. Second operand 12 states. [2018-04-06 19:08:49,870 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc14.base_24| Int) (|v_main_#t~malloc13.base_23| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_23| 1))) (or (not (= (select .cse0 |v_main_#t~malloc14.base_24|) 0)) (not (= (select |c_#valid| |v_main_#t~malloc13.base_23|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc14.base_24| 1) |v_main_#t~malloc13.base_23| 0) |v_main_#t~malloc14.base_24| 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-06 19:08:50,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:08:50,407 INFO L93 Difference]: Finished difference Result 408 states and 442 transitions. [2018-04-06 19:08:50,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 19:08:50,408 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-04-06 19:08:50,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:08:50,409 INFO L225 Difference]: With dead ends: 408 [2018-04-06 19:08:50,409 INFO L226 Difference]: Without dead ends: 389 [2018-04-06 19:08:50,410 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-06 19:08:50,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-04-06 19:08:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 272. [2018-04-06 19:08:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-04-06 19:08:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 295 transitions. [2018-04-06 19:08:50,421 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 295 transitions. Word has length 60 [2018-04-06 19:08:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:08:50,421 INFO L459 AbstractCegarLoop]: Abstraction has 272 states and 295 transitions. [2018-04-06 19:08:50,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 19:08:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 295 transitions. [2018-04-06 19:08:50,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-06 19:08:50,422 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:08:50,422 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:08:50,422 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:08:50,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1337420224, now seen corresponding path program 1 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-06 19:08:50,430 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:08:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:08:50,458 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:08:50,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:08:50,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:50,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:08:50,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:50,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:08:50,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-04-06 19:08:50,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:08:50,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:08:50,555 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 14 treesize of output 23 [2018-04-06 19:08:50,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:50,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:08:50,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:08:50,568 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-06 19:08:50,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:50,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:08:50,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-04-06 19:08:50,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:08:50,725 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:08:50,935 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-06 19:08:50,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:50,939 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 11 treesize of output 15 [2018-04-06 19:08:50,948 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 19:08:50,948 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:50,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-06 19:08:50,950 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:50,952 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:08:50,955 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-06 19:08:50,955 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:21, output treesize:3 [2018-04-06 19:08:51,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:08:51,027 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:08:51,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-04-06 19:08:51,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-06 19:08:51,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-06 19:08:51,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-04-06 19:08:51,029 INFO L87 Difference]: Start difference. First operand 272 states and 295 transitions. Second operand 26 states. [2018-04-06 19:08:52,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:08:52,511 INFO L93 Difference]: Finished difference Result 311 states and 336 transitions. [2018-04-06 19:08:52,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-06 19:08:52,515 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 60 [2018-04-06 19:08:52,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:08:52,516 INFO L225 Difference]: With dead ends: 311 [2018-04-06 19:08:52,516 INFO L226 Difference]: Without dead ends: 305 [2018-04-06 19:08:52,517 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=220, Invalid=1262, Unknown=0, NotChecked=0, Total=1482 [2018-04-06 19:08:52,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-06 19:08:52,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 273. [2018-04-06 19:08:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-04-06 19:08:52,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 295 transitions. [2018-04-06 19:08:52,539 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 295 transitions. Word has length 60 [2018-04-06 19:08:52,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:08:52,539 INFO L459 AbstractCegarLoop]: Abstraction has 273 states and 295 transitions. [2018-04-06 19:08:52,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-06 19:08:52,540 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 295 transitions. [2018-04-06 19:08:52,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-06 19:08:52,541 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:08:52,541 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:08:52,541 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:08:52,541 INFO L82 PathProgramCache]: Analyzing trace with hash -2138307650, now seen corresponding path program 1 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-06 19:08:52,550 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:08:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:08:52,585 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:08:52,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:08:52,609 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-06 19:08:52,611 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-06 19:08:52,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:52,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:08:52,619 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-06 19:08:52,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-06 19:08:52,654 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0))))) is different from true [2018-04-06 19:08:52,659 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0))))) is different from true [2018-04-06 19:08:52,666 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-06 19:08:52,666 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:08:52,706 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_27| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc14.base_27| 1) |c_main_#t~malloc13.base| 0) |v_main_#t~malloc14.base_27| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc14.base_27|))))) is different from false [2018-04-06 19:08:52,723 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc13.base_26| Int) (|v_main_#t~malloc14.base_27| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_26| 1))) (or (not (= (select .cse0 |v_main_#t~malloc14.base_27|) 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc13.base_26|))) (= (store (store (store .cse0 |v_main_#t~malloc14.base_27| 1) |v_main_#t~malloc13.base_26| 0) |v_main_#t~malloc14.base_27| 0) |c_old(#valid)|)))) is different from false [2018-04-06 19:08:52,738 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-06 19:08:52,759 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:08:52,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-06 19:08:52,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 19:08:52,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 19:08:52,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-06 19:08:52,760 INFO L87 Difference]: Start difference. First operand 273 states and 295 transitions. Second operand 12 states. [2018-04-06 19:08:52,789 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc13.base_26| Int) (|v_main_#t~malloc14.base_27| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_26| 1))) (or (not (= (select .cse0 |v_main_#t~malloc14.base_27|) 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc13.base_26|))) (= (store (store (store .cse0 |v_main_#t~malloc14.base_27| 1) |v_main_#t~malloc13.base_26| 0) |v_main_#t~malloc14.base_27| 0) |c_old(#valid)|)))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-06 19:08:53,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:08:53,324 INFO L93 Difference]: Finished difference Result 276 states and 295 transitions. [2018-04-06 19:08:53,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 19:08:53,324 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-04-06 19:08:53,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:08:53,325 INFO L225 Difference]: With dead ends: 276 [2018-04-06 19:08:53,325 INFO L226 Difference]: Without dead ends: 256 [2018-04-06 19:08:53,326 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-06 19:08:53,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-04-06 19:08:53,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 137. [2018-04-06 19:08:53,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-06 19:08:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-04-06 19:08:53,336 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 61 [2018-04-06 19:08:53,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:08:53,337 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-04-06 19:08:53,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 19:08:53,337 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-04-06 19:08:53,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-06 19:08:53,338 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:08:53,338 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:08:53,338 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:08:53,338 INFO L82 PathProgramCache]: Analyzing trace with hash -484778563, 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-06 19:08:53,347 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:08:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:08:53,372 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:08:53,380 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-06 19:08:53,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:53,389 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-06 19:08:53,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:53,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:08:53,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-04-06 19:08:53,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:08:53,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:08:53,414 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 14 treesize of output 23 [2018-04-06 19:08:53,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:53,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:08:53,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:08:53,426 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-06 19:08:53,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:53,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:08:53,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-06 19:08:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:08:53,728 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:08:54,253 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-06 19:08:54,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:54,260 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 11 treesize of output 15 [2018-04-06 19:08:54,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-06 19:08:54,273 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:54,278 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 19:08:54,278 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:54,281 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:08:54,291 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-06 19:08:54,291 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-04-06 19:08:54,366 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:08:54,386 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:08:54,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 43 [2018-04-06 19:08:54,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-06 19:08:54,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-06 19:08:54,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1757, Unknown=0, NotChecked=0, Total=1892 [2018-04-06 19:08:54,387 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 44 states. [2018-04-06 19:08:57,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:08:57,236 INFO L93 Difference]: Finished difference Result 210 states and 220 transitions. [2018-04-06 19:08:57,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-06 19:08:57,236 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 66 [2018-04-06 19:08:57,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:08:57,237 INFO L225 Difference]: With dead ends: 210 [2018-04-06 19:08:57,237 INFO L226 Difference]: Without dead ends: 209 [2018-04-06 19:08:57,239 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1599 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=861, Invalid=6795, Unknown=0, NotChecked=0, Total=7656 [2018-04-06 19:08:57,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-04-06 19:08:57,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 166. [2018-04-06 19:08:57,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-06 19:08:57,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 175 transitions. [2018-04-06 19:08:57,247 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 175 transitions. Word has length 66 [2018-04-06 19:08:57,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:08:57,247 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 175 transitions. [2018-04-06 19:08:57,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-06 19:08:57,247 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 175 transitions. [2018-04-06 19:08:57,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-06 19:08:57,248 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:08:57,248 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:08:57,248 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:08:57,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1814952698, now seen corresponding path program 1 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-06 19:08:57,254 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:08:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:08:57,275 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:08:57,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:08:57,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:57,296 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-06 19:08:57,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:57,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:08:57,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-04-06 19:08:57,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:08:57,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:08:57,321 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-06 19:08:57,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:57,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:08:57,334 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 14 treesize of output 23 [2018-04-06 19:08:57,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:57,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:08:57,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2018-04-06 19:08:57,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-06 19:08:57,364 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 13 treesize of output 12 [2018-04-06 19:08:57,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:57,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:08:57,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:08:57,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-04-06 19:08:57,510 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 20 treesize of output 16 [2018-04-06 19:08:57,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-06 19:08:57,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:08:57,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:08:57,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-06 19:08:57,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:55 [2018-04-06 19:08:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:08:57,769 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:08:58,257 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 13 treesize of output 11 [2018-04-06 19:08:58,265 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 5 treesize of output 3 [2018-04-06 19:08:58,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:58,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:08:58,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:08:58,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2018-04-06 19:08:58,381 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-06 19:08:58,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:58,385 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 11 treesize of output 15 [2018-04-06 19:08:58,393 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 19:08:58,393 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:58,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-06 19:08:58,394 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:08:58,396 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:08:58,399 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-06 19:08:58,400 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-04-06 19:08:58,466 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:08:58,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:08:58,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 41 [2018-04-06 19:08:58,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-06 19:08:58,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-06 19:08:58,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1590, Unknown=0, NotChecked=0, Total=1722 [2018-04-06 19:08:58,487 INFO L87 Difference]: Start difference. First operand 166 states and 175 transitions. Second operand 42 states. [2018-04-06 19:09:00,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:09:00,829 INFO L93 Difference]: Finished difference Result 194 states and 203 transitions. [2018-04-06 19:09:00,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-06 19:09:00,829 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 67 [2018-04-06 19:09:00,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:09:00,830 INFO L225 Difference]: With dead ends: 194 [2018-04-06 19:09:00,830 INFO L226 Difference]: Without dead ends: 188 [2018-04-06 19:09:00,831 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1165 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=625, Invalid=5227, Unknown=0, NotChecked=0, Total=5852 [2018-04-06 19:09:00,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-06 19:09:00,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 144. [2018-04-06 19:09:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-06 19:09:00,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2018-04-06 19:09:00,839 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 67 [2018-04-06 19:09:00,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:09:00,839 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2018-04-06 19:09:00,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-06 19:09:00,839 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2018-04-06 19:09:00,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-06 19:09:00,840 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:09:00,840 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:09:00,840 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:09:00,840 INFO L82 PathProgramCache]: Analyzing trace with hash 325820419, now seen corresponding path program 2 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-06 19:09:00,846 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:09:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:09:00,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:09:00,898 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-06 19:09:00,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:09:00,905 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-06 19:09:00,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:09:00,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:09:00,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-04-06 19:09:00,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:09:00,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:09:00,929 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 14 treesize of output 23 [2018-04-06 19:09:00,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:09:00,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:09:00,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:09:00,940 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-06 19:09:00,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:09:00,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:09:00,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-06 19:09:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:09:01,391 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:09:02,389 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-06 19:09:02,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:09:02,394 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 11 treesize of output 15 [2018-04-06 19:09:02,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-06 19:09:02,402 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:09:02,403 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 19:09:02,403 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:09:02,405 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:09:02,409 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-06 19:09:02,410 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:27, output treesize:10 [2018-04-06 19:09:02,461 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:09:02,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:09:02,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2018-04-06 19:09:02,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-06 19:09:02,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-06 19:09:02,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2797, Unknown=0, NotChecked=0, Total=2970 [2018-04-06 19:09:02,483 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 55 states. [2018-04-06 19:09:07,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:09:07,151 INFO L93 Difference]: Finished difference Result 225 states and 236 transitions. [2018-04-06 19:09:07,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-06 19:09:07,151 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 73 [2018-04-06 19:09:07,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:09:07,152 INFO L225 Difference]: With dead ends: 225 [2018-04-06 19:09:07,152 INFO L226 Difference]: Without dead ends: 224 [2018-04-06 19:09:07,155 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2762 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1316, Invalid=11566, Unknown=0, NotChecked=0, Total=12882 [2018-04-06 19:09:07,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-04-06 19:09:07,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 173. [2018-04-06 19:09:07,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-04-06 19:09:07,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 183 transitions. [2018-04-06 19:09:07,164 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 183 transitions. Word has length 73 [2018-04-06 19:09:07,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:09:07,165 INFO L459 AbstractCegarLoop]: Abstraction has 173 states and 183 transitions. [2018-04-06 19:09:07,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-06 19:09:07,165 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 183 transitions. [2018-04-06 19:09:07,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-06 19:09:07,165 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:09:07,165 INFO L355 BasicCegarLoop]: trace histogram [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, 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-06 19:09:07,165 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:09:07,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1838779264, 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-06 19:09:07,172 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:09:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:09:07,198 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:09:07,213 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-06 19:09:07,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:09:07,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:09:07,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:09:07,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:09:07,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 19:09:07,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:09:07,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-06 19:09:07,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:09:07,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:09:07,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:09:07,490 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-06 19:09:07,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:09:07,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:09:07,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-06 19:09:07,660 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 18 treesize of output 15 [2018-04-06 19:09:07,667 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 15 treesize of output 14 [2018-04-06 19:09:07,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:09:07,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:09:07,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:09:07,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-04-06 19:09:07,790 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 31 treesize of output 32 [2018-04-06 19:09:07,792 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 13 treesize of output 12 [2018-04-06 19:09:07,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:09:07,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:09:07,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 19:09:07,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2018-04-06 19:09:08,070 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 34 treesize of output 32 [2018-04-06 19:09:08,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-04-06 19:09:08,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:09:08,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-06 19:09:08,084 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:09:08,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:09:08,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:09:08,093 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:23 [2018-04-06 19:09:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:09:08,360 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:09:09,138 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 13 treesize of output 11 [2018-04-06 19:09:09,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2018-04-06 19:09:09,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:09:09,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:09:09,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:09:09,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-04-06 19:09:09,362 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:09:09,383 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:09:09,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 47 [2018-04-06 19:09:09,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-06 19:09:09,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-06 19:09:09,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2102, Unknown=0, NotChecked=0, Total=2256 [2018-04-06 19:09:09,384 INFO L87 Difference]: Start difference. First operand 173 states and 183 transitions. Second operand 48 states. [2018-04-06 19:09:10,002 WARN L151 SmtUtils]: Spent 240ms on a formula simplification. DAG size of input: 34 DAG size of output 30 [2018-04-06 19:09:11,664 WARN L151 SmtUtils]: Spent 1487ms on a formula simplification. DAG size of input: 49 DAG size of output 41 [2018-04-06 19:09:19,789 WARN L151 SmtUtils]: Spent 8072ms on a formula simplification. DAG size of input: 69 DAG size of output 62 [2018-04-06 19:09:25,639 WARN L151 SmtUtils]: Spent 5786ms on a formula simplification. DAG size of input: 67 DAG size of output 56 [2018-04-06 19:09:30,087 WARN L151 SmtUtils]: Spent 4261ms on a formula simplification. DAG size of input: 54 DAG size of output 46 [2018-04-06 19:09:34,654 WARN L151 SmtUtils]: Spent 4513ms on a formula simplification. DAG size of input: 88 DAG size of output 70 [2018-04-06 19:09:41,344 WARN L151 SmtUtils]: Spent 1241ms on a formula simplification. DAG size of input: 76 DAG size of output 62 [2018-04-06 19:09:47,489 WARN L151 SmtUtils]: Spent 4102ms on a formula simplification. DAG size of input: 54 DAG size of output 47 [2018-04-06 19:09:49,814 WARN L151 SmtUtils]: Spent 2277ms on a formula simplification. DAG size of input: 61 DAG size of output 54 [2018-04-06 19:09:52,250 WARN L151 SmtUtils]: Spent 2367ms on a formula simplification. DAG size of input: 60 DAG size of output 49 [2018-04-06 19:09:53,424 WARN L151 SmtUtils]: Spent 1030ms on a formula simplification. DAG size of input: 53 DAG size of output 46 [2018-04-06 19:09:57,415 WARN L151 SmtUtils]: Spent 3940ms on a formula simplification. DAG size of input: 76 DAG size of output 60 [2018-04-06 19:10:04,000 WARN L151 SmtUtils]: Spent 3544ms on a formula simplification. DAG size of input: 73 DAG size of output 63 [2018-04-06 19:10:10,241 WARN L151 SmtUtils]: Spent 4190ms on a formula simplification. DAG size of input: 57 DAG size of output 52 [2018-04-06 19:10:13,625 WARN L151 SmtUtils]: Spent 3327ms on a formula simplification. DAG size of input: 67 DAG size of output 60 [2018-04-06 19:10:14,012 WARN L151 SmtUtils]: Spent 288ms on a formula simplification. DAG size of input: 62 DAG size of output 57 [2018-04-06 19:10:14,628 WARN L151 SmtUtils]: Spent 406ms on a formula simplification. DAG size of input: 59 DAG size of output 54 [2018-04-06 19:10:17,576 WARN L151 SmtUtils]: Spent 2891ms on a formula simplification. DAG size of input: 78 DAG size of output 68 [2018-04-06 19:10:19,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:10:19,536 INFO L93 Difference]: Finished difference Result 247 states and 259 transitions. [2018-04-06 19:10:19,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-06 19:10:19,536 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 74 [2018-04-06 19:10:19,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:10:19,537 INFO L225 Difference]: With dead ends: 247 [2018-04-06 19:10:19,537 INFO L226 Difference]: Without dead ends: 241 [2018-04-06 19:10:19,540 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1567 ImplicationChecksByTransitivity, 61.8s TimeCoverageRelationStatistics Valid=882, Invalid=7488, Unknown=2, NotChecked=0, Total=8372 [2018-04-06 19:10:19,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-04-06 19:10:19,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 213. [2018-04-06 19:10:19,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-06 19:10:19,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 224 transitions. [2018-04-06 19:10:19,553 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 224 transitions. Word has length 74 [2018-04-06 19:10:19,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:10:19,553 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 224 transitions. [2018-04-06 19:10:19,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-06 19:10:19,554 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 224 transitions. [2018-04-06 19:10:19,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-06 19:10:19,558 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:10:19,559 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:10:19,559 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:10:19,559 INFO L82 PathProgramCache]: Analyzing trace with hash -2123582662, now seen corresponding path program 2 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-06 19:10:19,567 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:10:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:10:19,591 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:10:19,593 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-06 19:10:19,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:19,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:10:19,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 19:10:19,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:10:19,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:10:19,601 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-06 19:10:19,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:19,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:10:19,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:19,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:10:19,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-06 19:10:19,624 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 15 treesize of output 12 [2018-04-06 19:10:19,625 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 12 treesize of output 11 [2018-04-06 19:10:19,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:19,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:10:19,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:10:19,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-06 19:10:19,754 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 23 treesize of output 24 [2018-04-06 19:10:19,756 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-06 19:10:19,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:19,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:10:19,764 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-06 19:10:19,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-06 19:10:19,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-06 19:10:19,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-06 19:10:19,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:10:19,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:10:19,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:10:19,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-06 19:10:19,950 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:10:19,950 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:10:21,559 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 37 treesize of output 28 [2018-04-06 19:10:21,573 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 12 treesize of output 11 [2018-04-06 19:10:21,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:21,585 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-06 19:10:21,587 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 15 treesize of output 10 [2018-04-06 19:10:21,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:21,589 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:10:21,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-04-06 19:10:21,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-06 19:10:21,591 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:21,594 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:10:21,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:10:21,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:10:21,621 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-04-06 19:10:21,792 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:10:21,812 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:10:21,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2018-04-06 19:10:21,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-06 19:10:21,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-06 19:10:21,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1519, Unknown=0, NotChecked=0, Total=1640 [2018-04-06 19:10:21,813 INFO L87 Difference]: Start difference. First operand 213 states and 224 transitions. Second operand 41 states. [2018-04-06 19:10:23,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:10:23,236 INFO L93 Difference]: Finished difference Result 283 states and 296 transitions. [2018-04-06 19:10:23,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-06 19:10:23,236 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 76 [2018-04-06 19:10:23,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:10:23,238 INFO L225 Difference]: With dead ends: 283 [2018-04-06 19:10:23,238 INFO L226 Difference]: Without dead ends: 282 [2018-04-06 19:10:23,239 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=549, Invalid=3741, Unknown=0, NotChecked=0, Total=4290 [2018-04-06 19:10:23,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-04-06 19:10:23,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 275. [2018-04-06 19:10:23,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-04-06 19:10:23,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 289 transitions. [2018-04-06 19:10:23,257 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 289 transitions. Word has length 76 [2018-04-06 19:10:23,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:10:23,257 INFO L459 AbstractCegarLoop]: Abstraction has 275 states and 289 transitions. [2018-04-06 19:10:23,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-06 19:10:23,257 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 289 transitions. [2018-04-06 19:10:23,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-06 19:10:23,258 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:10:23,258 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:10:23,258 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:10:23,259 INFO L82 PathProgramCache]: Analyzing trace with hash -325192180, 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-06 19:10:23,270 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:10:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:10:23,294 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:10:23,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-06 19:10:23,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:23,304 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-06 19:10:23,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:23,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:10:23,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-06 19:10:23,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:10:23,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-06 19:10:23,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:23,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:10:23,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:10:23,332 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-06 19:10:23,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:23,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:10:23,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:17 [2018-04-06 19:10:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:10:23,866 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:10:24,856 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-06 19:10:24,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:24,896 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 11 treesize of output 15 [2018-04-06 19:10:24,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-06 19:10:24,904 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:24,904 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 19:10:24,904 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:24,906 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:10:24,910 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-06 19:10:24,910 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:27, output treesize:10 [2018-04-06 19:10:24,964 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:10:24,984 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:10:24,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2018-04-06 19:10:24,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-06 19:10:24,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-06 19:10:24,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2655, Unknown=0, NotChecked=0, Total=2862 [2018-04-06 19:10:24,985 INFO L87 Difference]: Start difference. First operand 275 states and 289 transitions. Second operand 54 states. [2018-04-06 19:10:32,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:10:32,264 INFO L93 Difference]: Finished difference Result 335 states and 351 transitions. [2018-04-06 19:10:32,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-06 19:10:32,265 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 78 [2018-04-06 19:10:32,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:10:32,266 INFO L225 Difference]: With dead ends: 335 [2018-04-06 19:10:32,266 INFO L226 Difference]: Without dead ends: 319 [2018-04-06 19:10:32,267 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2714 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1658, Invalid=11682, Unknown=0, NotChecked=0, Total=13340 [2018-04-06 19:10:32,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-04-06 19:10:32,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 307. [2018-04-06 19:10:32,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-04-06 19:10:32,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 321 transitions. [2018-04-06 19:10:32,278 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 321 transitions. Word has length 78 [2018-04-06 19:10:32,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:10:32,278 INFO L459 AbstractCegarLoop]: Abstraction has 307 states and 321 transitions. [2018-04-06 19:10:32,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-06 19:10:32,279 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 321 transitions. [2018-04-06 19:10:32,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-06 19:10:32,280 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:10:32,280 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:10:32,280 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:10:32,280 INFO L82 PathProgramCache]: Analyzing trace with hash -189865219, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:10:32,296 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:10:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:10:32,328 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:10:32,360 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-06 19:10:32,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:32,368 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-06 19:10:32,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:32,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:10:32,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-04-06 19:10:32,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:10:32,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:10:32,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, 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-06 19:10:32,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:32,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:10:32,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:10:32,420 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-06 19:10:32,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:32,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:10:32,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-04-06 19:10:32,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-04-06 19:10:32,457 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 16 treesize of output 15 [2018-04-06 19:10:32,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:32,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:10:32,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:10:32,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-04-06 19:10:32,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:10:32,487 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 32 treesize of output 33 [2018-04-06 19:10:32,489 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 13 treesize of output 12 [2018-04-06 19:10:32,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:32,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:10:32,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 19:10:32,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-04-06 19:10:32,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:10:32,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-04-06 19:10:32,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2018-04-06 19:10:32,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:10:32,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-06 19:10:32,917 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:32,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:10:32,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:10:32,929 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:58, output treesize:63 [2018-04-06 19:10:33,778 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:10:33,779 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:10:35,559 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 16 [2018-04-06 19:10:35,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-06 19:10:35,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:35,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:10:35,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:10:35,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:54 [2018-04-06 19:10:36,021 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 32 treesize of output 26 [2018-04-06 19:10:36,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:36,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-04-06 19:10:36,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-06 19:10:36,054 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:36,059 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:10:36,075 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 32 treesize of output 26 [2018-04-06 19:10:36,075 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:36,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-04-06 19:10:36,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-06 19:10:36,105 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 19:10:36,110 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:10:36,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:10:36,123 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:80, output treesize:31 [2018-04-06 19:10:36,217 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:10:36,238 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:10:36,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 65 [2018-04-06 19:10:36,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-06 19:10:36,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-06 19:10:36,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=4064, Unknown=0, NotChecked=0, Total=4290 [2018-04-06 19:10:36,239 INFO L87 Difference]: Start difference. First operand 307 states and 321 transitions. Second operand 66 states. [2018-04-06 19:10:36,928 WARN L151 SmtUtils]: Spent 245ms on a formula simplification. DAG size of input: 98 DAG size of output 96 [2018-04-06 19:10:37,382 WARN L151 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 96 DAG size of output 81 [2018-04-06 19:10:40,642 WARN L148 SmtUtils]: Spent 2058ms on a formula simplification that was a NOOP. DAG size: 72 [2018-04-06 19:10:42,796 WARN L148 SmtUtils]: Spent 2070ms on a formula simplification that was a NOOP. DAG size: 75 [2018-04-06 19:10:43,913 WARN L148 SmtUtils]: Spent 130ms on a formula simplification that was a NOOP. DAG size: 86 [2018-04-06 19:10:44,357 WARN L151 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 94 DAG size of output 90 [2018-04-06 19:10:44,845 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 73 DAG size of output 68 [2018-04-06 19:10:45,150 WARN L151 SmtUtils]: Spent 216ms on a formula simplification. DAG size of input: 91 DAG size of output 87 [2018-04-06 19:10:45,707 WARN L151 SmtUtils]: Spent 249ms on a formula simplification. DAG size of input: 100 DAG size of output 84 [2018-04-06 19:10:48,109 WARN L151 SmtUtils]: Spent 2227ms on a formula simplification. DAG size of input: 77 DAG size of output 76 [2018-04-06 19:10:48,508 WARN L151 SmtUtils]: Spent 295ms on a formula simplification. DAG size of input: 124 DAG size of output 107 [2018-04-06 19:10:57,708 WARN L151 SmtUtils]: Spent 1003ms on a formula simplification. DAG size of input: 97 DAG size of output 88 [2018-04-06 19:10:58,285 WARN L151 SmtUtils]: Spent 419ms on a formula simplification. DAG size of input: 73 DAG size of output 68 [2018-04-06 19:11:00,689 WARN L151 SmtUtils]: Spent 2241ms on a formula simplification. DAG size of input: 96 DAG size of output 91 [2018-04-06 19:11:01,580 WARN L151 SmtUtils]: Spent 530ms on a formula simplification. DAG size of input: 79 DAG size of output 73 [2018-04-06 19:11:02,675 WARN L151 SmtUtils]: Spent 663ms on a formula simplification. DAG size of input: 71 DAG size of output 66 [2018-04-06 19:11:03,307 WARN L151 SmtUtils]: Spent 436ms on a formula simplification. DAG size of input: 76 DAG size of output 70 [2018-04-06 19:11:04,588 WARN L151 SmtUtils]: Spent 1052ms on a formula simplification. DAG size of input: 89 DAG size of output 81 [2018-04-06 19:11:05,801 WARN L151 SmtUtils]: Spent 753ms on a formula simplification. DAG size of input: 86 DAG size of output 80 [2018-04-06 19:11:06,691 WARN L151 SmtUtils]: Spent 600ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-04-06 19:11:07,309 WARN L151 SmtUtils]: Spent 438ms on a formula simplification. DAG size of input: 84 DAG size of output 76 [2018-04-06 19:11:07,790 WARN L151 SmtUtils]: Spent 397ms on a formula simplification. DAG size of input: 68 DAG size of output 63 [2018-04-06 19:11:08,740 WARN L151 SmtUtils]: Spent 604ms on a formula simplification. DAG size of input: 70 DAG size of output 66 [2018-04-06 19:11:09,001 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 64 DAG size of output 60 [2018-04-06 19:11:10,098 WARN L151 SmtUtils]: Spent 903ms on a formula simplification. DAG size of input: 80 DAG size of output 73 [2018-04-06 19:11:11,432 WARN L151 SmtUtils]: Spent 900ms on a formula simplification. DAG size of input: 79 DAG size of output 75 [2018-04-06 19:11:12,539 WARN L148 SmtUtils]: Spent 481ms on a formula simplification that was a NOOP. DAG size: 64 [2018-04-06 19:11:13,021 WARN L148 SmtUtils]: Spent 313ms on a formula simplification that was a NOOP. DAG size: 54 [2018-04-06 19:11:13,871 WARN L151 SmtUtils]: Spent 552ms on a formula simplification. DAG size of input: 77 DAG size of output 70 [2018-04-06 19:11:14,268 WARN L151 SmtUtils]: Spent 305ms on a formula simplification. DAG size of input: 71 DAG size of output 67 [2018-04-06 19:11:14,858 WARN L151 SmtUtils]: Spent 354ms on a formula simplification. DAG size of input: 56 DAG size of output 54 [2018-04-06 19:11:15,289 WARN L151 SmtUtils]: Spent 348ms on a formula simplification. DAG size of input: 72 DAG size of output 68 [2018-04-06 19:11:15,975 WARN L151 SmtUtils]: Spent 566ms on a formula simplification. DAG size of input: 68 DAG size of output 61 [2018-04-06 19:11:16,546 WARN L148 SmtUtils]: Spent 185ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-06 19:11:17,332 WARN L151 SmtUtils]: Spent 528ms on a formula simplification. DAG size of input: 61 DAG size of output 58 [2018-04-06 19:11:17,675 WARN L148 SmtUtils]: Spent 135ms on a formula simplification that was a NOOP. DAG size: 51 [2018-04-06 19:11:18,585 WARN L151 SmtUtils]: Spent 620ms on a formula simplification. DAG size of input: 63 DAG size of output 58 [2018-04-06 19:11:19,761 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 59 DAG size of output 49 [2018-04-06 19:11:20,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:11:20,310 INFO L93 Difference]: Finished difference Result 394 states and 412 transitions. [2018-04-06 19:11:20,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-04-06 19:11:20,311 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 80 [2018-04-06 19:11:20,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:11:20,312 INFO L225 Difference]: With dead ends: 394 [2018-04-06 19:11:20,312 INFO L226 Difference]: Without dead ends: 393 [2018-04-06 19:11:20,313 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4536 ImplicationChecksByTransitivity, 35.1s TimeCoverageRelationStatistics Valid=1598, Invalid=18142, Unknown=0, NotChecked=0, Total=19740 [2018-04-06 19:11:20,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-04-06 19:11:20,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 346. [2018-04-06 19:11:20,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-04-06 19:11:20,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 362 transitions. [2018-04-06 19:11:20,335 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 362 transitions. Word has length 80 [2018-04-06 19:11:20,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:11:20,335 INFO L459 AbstractCegarLoop]: Abstraction has 346 states and 362 transitions. [2018-04-06 19:11:20,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-06 19:11:20,335 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 362 transitions. [2018-04-06 19:11:20,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-06 19:11:20,336 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:20,336 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:20,336 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:11:20,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1816406528, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:20,344 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:20,369 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:20,376 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-06 19:11:20,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:20,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:20,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 19:11:20,389 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-06 19:11:20,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:20,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:20,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:20,396 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-06 19:11:20,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:20,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:20,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-06 19:11:20,416 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 15 treesize of output 12 [2018-04-06 19:11:20,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-06 19:11:20,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:20,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:20,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:20,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-06 19:11:20,530 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 23 treesize of output 24 [2018-04-06 19:11:20,532 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-06 19:11:20,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:20,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:20,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:20,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-06 19:11:20,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-06 19:11:20,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-06 19:11:20,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:11:20,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:11:20,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:11:20,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-06 19:11:20,726 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-06 19:11:20,726 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:22,672 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 37 treesize of output 28 [2018-04-06 19:11:22,685 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 12 treesize of output 11 [2018-04-06 19:11:22,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:22,697 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-06 19:11:22,699 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 15 treesize of output 10 [2018-04-06 19:11:22,700 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:22,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:22,703 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 20 treesize of output 18 [2018-04-06 19:11:22,704 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 9 treesize of output 1 [2018-04-06 19:11:22,705 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:22,707 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:22,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:11:22,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:11:22,735 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-04-06 19:11:22,903 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-06 19:11:22,923 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:11:22,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-04-06 19:11:22,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-06 19:11:22,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-06 19:11:22,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1600, Unknown=0, NotChecked=0, Total=1722 [2018-04-06 19:11:22,925 INFO L87 Difference]: Start difference. First operand 346 states and 362 transitions. Second operand 42 states. [2018-04-06 19:11:24,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:11:24,113 INFO L93 Difference]: Finished difference Result 383 states and 398 transitions. [2018-04-06 19:11:24,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-06 19:11:24,113 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 83 [2018-04-06 19:11:24,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:11:24,115 INFO L225 Difference]: With dead ends: 383 [2018-04-06 19:11:24,115 INFO L226 Difference]: Without dead ends: 382 [2018-04-06 19:11:24,115 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=332, Invalid=3208, Unknown=0, NotChecked=0, Total=3540 [2018-04-06 19:11:24,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-04-06 19:11:24,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 365. [2018-04-06 19:11:24,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-04-06 19:11:24,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 380 transitions. [2018-04-06 19:11:24,140 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 380 transitions. Word has length 83 [2018-04-06 19:11:24,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:11:24,141 INFO L459 AbstractCegarLoop]: Abstraction has 365 states and 380 transitions. [2018-04-06 19:11:24,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-06 19:11:24,141 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 380 transitions. [2018-04-06 19:11:24,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-06 19:11:24,142 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:24,142 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:24,142 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:11:24,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1481670830, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:24,152 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:24,182 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:24,187 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-06 19:11:24,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:24,213 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-06 19:11:24,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:24,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:24,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-06 19:11:24,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:24,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-06 19:11:24,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:24,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:24,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:24,247 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-06 19:11:24,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:24,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:24,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:17 [2018-04-06 19:11:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:24,847 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:25,978 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-06 19:11:25,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:25,983 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 11 treesize of output 15 [2018-04-06 19:11:25,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-06 19:11:25,991 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:25,991 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 19:11:25,991 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:25,994 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:25,998 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-06 19:11:25,998 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:27, output treesize:10 [2018-04-06 19:11:26,057 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:26,077 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:11:26,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2018-04-06 19:11:26,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-06 19:11:26,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-06 19:11:26,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=3105, Unknown=0, NotChecked=0, Total=3306 [2018-04-06 19:11:26,078 INFO L87 Difference]: Start difference. First operand 365 states and 380 transitions. Second operand 58 states. [2018-04-06 19:11:33,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:11:33,498 INFO L93 Difference]: Finished difference Result 427 states and 444 transitions. [2018-04-06 19:11:33,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-04-06 19:11:33,498 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 85 [2018-04-06 19:11:33,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:11:33,499 INFO L225 Difference]: With dead ends: 427 [2018-04-06 19:11:33,499 INFO L226 Difference]: Without dead ends: 411 [2018-04-06 19:11:33,500 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3992 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2047, Invalid=16859, Unknown=0, NotChecked=0, Total=18906 [2018-04-06 19:11:33,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-04-06 19:11:33,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 397. [2018-04-06 19:11:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-04-06 19:11:33,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 413 transitions. [2018-04-06 19:11:33,525 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 413 transitions. Word has length 85 [2018-04-06 19:11:33,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:11:33,526 INFO L459 AbstractCegarLoop]: Abstraction has 397 states and 413 transitions. [2018-04-06 19:11:33,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-06 19:11:33,526 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 413 transitions. [2018-04-06 19:11:33,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-06 19:11:33,527 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:33,527 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:33,527 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-06 19:11:33,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1932572733, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:33,539 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:33,585 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:33,602 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-06 19:11:33,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:33,611 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-06 19:11:33,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:33,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:33,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-04-06 19:11:33,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:33,636 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:33,637 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-06 19:11:33,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:33,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:33,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:33,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-06 19:11:33,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:33,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:33,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-04-06 19:11:33,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-04-06 19:11:33,679 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 16 treesize of output 15 [2018-04-06 19:11:33,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:33,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:33,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:33,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-04-06 19:11:33,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:33,702 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 32 treesize of output 33 [2018-04-06 19:11:33,704 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 13 treesize of output 12 [2018-04-06 19:11:33,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:33,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:33,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 19:11:33,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-04-06 19:11:34,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:34,449 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 55 treesize of output 49 [2018-04-06 19:11:34,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-06 19:11:34,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:34,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:34,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:34,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:34,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 73 [2018-04-06 19:11:34,472 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-06 19:11:34,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:11:34,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:11:34,509 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:78, output treesize:127 [2018-04-06 19:11:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:35,626 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:38,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-04-06 19:11:38,577 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:11:38,578 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:11:38,578 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:11:38,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 31 [2018-04-06 19:11:38,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:38,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:38,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:38,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:98 [2018-04-06 19:11:39,109 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 32 treesize of output 26 [2018-04-06 19:11:39,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:39,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 32 treesize of output 26 [2018-04-06 19:11:39,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:39,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-04-06 19:11:39,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-06 19:11:39,158 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:39,163 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:39,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-04-06 19:11:39,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-06 19:11:39,193 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:39,198 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:39,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:11:39,211 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:80, output treesize:31 [2018-04-06 19:11:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:39,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:11:39,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41] total 81 [2018-04-06 19:11:39,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-04-06 19:11:39,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-04-06 19:11:39,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=6304, Unknown=0, NotChecked=0, Total=6642 [2018-04-06 19:11:39,356 INFO L87 Difference]: Start difference. First operand 397 states and 413 transitions. Second operand 82 states. [2018-04-06 19:11:40,393 WARN L151 SmtUtils]: Spent 502ms on a formula simplification. DAG size of input: 105 DAG size of output 103 [2018-04-06 19:11:40,948 WARN L151 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 103 DAG size of output 88 [2018-04-06 19:11:44,171 WARN L148 SmtUtils]: Spent 136ms on a formula simplification that was a NOOP. DAG size: 86 [2018-04-06 19:11:44,679 WARN L151 SmtUtils]: Spent 216ms on a formula simplification. DAG size of input: 94 DAG size of output 90 [2018-04-06 19:11:47,121 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 87 DAG size of output 82 [2018-04-06 19:11:47,408 WARN L151 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 80 DAG size of output 79 [2018-04-06 19:11:47,942 WARN L151 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 82 DAG size of output 81 [2018-04-06 19:11:48,350 WARN L151 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 77 DAG size of output 76 [2018-04-06 19:11:50,589 WARN L151 SmtUtils]: Spent 2156ms on a formula simplification. DAG size of input: 80 DAG size of output 79 [2018-04-06 19:11:51,121 WARN L151 SmtUtils]: Spent 404ms on a formula simplification. DAG size of input: 95 DAG size of output 94 [2018-04-06 19:11:57,979 WARN L151 SmtUtils]: Spent 247ms on a formula simplification. DAG size of input: 131 DAG size of output 125 [2018-04-06 19:11:58,586 WARN L151 SmtUtils]: Spent 213ms on a formula simplification. DAG size of input: 96 DAG size of output 91 [2018-04-06 19:12:00,944 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 98 DAG size of output 97 [2018-04-06 19:12:01,343 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 100 DAG size of output 99 [2018-04-06 19:12:01,694 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 95 DAG size of output 94 [2018-04-06 19:12:01,938 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 98 DAG size of output 97 [2018-04-06 19:12:02,307 WARN L151 SmtUtils]: Spent 176ms on a formula simplification. DAG size of input: 117 DAG size of output 116 [2018-04-06 19:12:05,022 WARN L151 SmtUtils]: Spent 249ms on a formula simplification. DAG size of input: 144 DAG size of output 131 [2018-04-06 19:12:05,602 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 104 DAG size of output 100 [2018-04-06 19:12:05,966 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 73 DAG size of output 68 [2018-04-06 19:12:06,313 WARN L151 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 139 DAG size of output 109 [2018-04-06 19:12:06,945 WARN L151 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 142 DAG size of output 105 [2018-04-06 19:12:07,251 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 100 DAG size of output 99 [2018-04-06 19:12:07,819 WARN L151 SmtUtils]: Spent 347ms on a formula simplification. DAG size of input: 186 DAG size of output 142 [2018-04-06 19:12:08,571 WARN L151 SmtUtils]: Spent 347ms on a formula simplification. DAG size of input: 161 DAG size of output 141 [2018-04-06 19:12:08,924 WARN L151 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 117 DAG size of output 107 [2018-04-06 19:12:09,221 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 109 DAG size of output 105 [2018-04-06 19:12:09,765 WARN L151 SmtUtils]: Spent 254ms on a formula simplification. DAG size of input: 124 DAG size of output 113 [2018-04-06 19:12:10,171 WARN L151 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 115 DAG size of output 105 [2018-04-06 19:12:10,499 WARN L151 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 119 DAG size of output 108 [2018-04-06 19:12:11,000 WARN L151 SmtUtils]: Spent 318ms on a formula simplification. DAG size of input: 154 DAG size of output 135 Received shutdown request... [2018-04-06 19:12:13,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-06 19:12:13,556 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-06 19:12:13,560 WARN L197 ceAbstractionStarter]: Timeout [2018-04-06 19:12:13,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 07:12:13 BoogieIcfgContainer [2018-04-06 19:12:13,560 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-06 19:12:13,561 INFO L168 Benchmark]: Toolchain (without parser) took 259481.76 ms. Allocated memory was 305.7 MB in the beginning and 442.0 MB in the end (delta: 136.3 MB). Free memory was 242.5 MB in the beginning and 321.5 MB in the end (delta: -79.0 MB). Peak memory consumption was 57.3 MB. Max. memory is 5.3 GB. [2018-04-06 19:12:13,562 INFO L168 Benchmark]: CDTParser took 0.23 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-06 19:12:13,562 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.57 ms. Allocated memory is still 305.7 MB. Free memory was 242.5 MB in the beginning and 218.6 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-04-06 19:12:13,562 INFO L168 Benchmark]: Boogie Preprocessor took 56.71 ms. Allocated memory is still 305.7 MB. Free memory was 218.6 MB in the beginning and 215.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-06 19:12:13,563 INFO L168 Benchmark]: RCFGBuilder took 556.47 ms. Allocated memory was 305.7 MB in the beginning and 468.7 MB in the end (delta: 163.1 MB). Free memory was 215.6 MB in the beginning and 399.9 MB in the end (delta: -184.4 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. [2018-04-06 19:12:13,563 INFO L168 Benchmark]: TraceAbstraction took 258517.99 ms. Allocated memory was 468.7 MB in the beginning and 442.0 MB in the end (delta: -26.7 MB). Free memory was 399.9 MB in the beginning and 321.5 MB in the end (delta: 78.4 MB). Peak memory consumption was 51.7 MB. Max. memory is 5.3 GB. [2018-04-06 19:12:13,564 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.23 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 346.57 ms. Allocated memory is still 305.7 MB. Free memory was 242.5 MB in the beginning and 218.6 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 56.71 ms. Allocated memory is still 305.7 MB. Free memory was 218.6 MB in the beginning and 215.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 556.47 ms. Allocated memory was 305.7 MB in the beginning and 468.7 MB in the end (delta: 163.1 MB). Free memory was 215.6 MB in the beginning and 399.9 MB in the end (delta: -184.4 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 258517.99 ms. Allocated memory was 468.7 MB in the beginning and 442.0 MB in the end (delta: -26.7 MB). Free memory was 399.9 MB in the beginning and 321.5 MB in the end (delta: 78.4 MB). Peak memory consumption was 51.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 570]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (397states) and interpolant automaton (currently 69 states, 82 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 142 known predicates. - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (397states) and interpolant automaton (currently 69 states, 82 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 142 known predicates. - TimeoutResultAtElement [Line: 570]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (397states) and interpolant automaton (currently 69 states, 82 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 142 known predicates. - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (397states) and interpolant automaton (currently 69 states, 82 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 142 known predicates. - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (397states) and interpolant automaton (currently 69 states, 82 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 142 known predicates. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (397states) and interpolant automaton (currently 69 states, 82 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 142 known predicates. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (397states) and interpolant automaton (currently 69 states, 82 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 142 known predicates. - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (397states) and interpolant automaton (currently 69 states, 82 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 142 known predicates. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (397states) and interpolant automaton (currently 69 states, 82 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 142 known predicates. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (397states) and interpolant automaton (currently 69 states, 82 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 142 known predicates. - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (397states) and interpolant automaton (currently 69 states, 82 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 142 known predicates. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (397states) and interpolant automaton (currently 69 states, 82 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 142 known predicates. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (397states) and interpolant automaton (currently 69 states, 82 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 142 known predicates. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (397states) and interpolant automaton (currently 69 states, 82 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 142 known predicates. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (397states) and interpolant automaton (currently 69 states, 82 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 142 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 106 locations, 15 error locations. TIMEOUT Result, 258.4s OverallTime, 33 OverallIterations, 6 TraceHistogramMax, 226.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2750 SDtfs, 10146 SDslu, 30713 SDs, 0 SdLazy, 23016 SolverSat, 1154 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 60.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4245 GetRequests, 2811 SyntacticMatches, 33 SemanticMatches, 1400 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 25985 ImplicationChecksByTransitivity, 187.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=397occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 32 MinimizatonAttempts, 1053 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 29.2s InterpolantComputationTime, 1807 NumberOfCodeBlocks, 1807 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 3548 ConstructedInterpolants, 530 QuantifiedInterpolants, 3465426 SizeOfPredicates, 592 NumberOfNonLiveVariables, 5172 ConjunctsInSsa, 1051 ConjunctsInUnsatCore, 66 InterpolantComputations, 36 PerfectInterpolantSequences, 34/686 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/cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-06_19-12-13-572.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-06_19-12-13-572.csv Completed graceful shutdown