java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrncat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 09:56:58,568 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 09:56:58,569 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 09:56:58,579 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 09:56:58,579 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 09:56:58,580 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 09:56:58,580 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 09:56:58,582 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 09:56:58,584 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 09:56:58,584 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 09:56:58,585 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 09:56:58,585 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 09:56:58,585 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 09:56:58,586 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 09:56:58,587 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 09:56:58,589 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 09:56:58,590 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 09:56:58,591 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 09:56:58,592 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 09:56:58,593 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 09:56:58,595 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 09:56:58,595 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 09:56:58,595 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 09:56:58,596 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 09:56:58,596 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 09:56:58,597 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 09:56:58,597 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 09:56:58,598 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 09:56:58,599 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 09:56:58,599 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 09:56:58,599 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 09:56:58,599 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-11 09:56:58,619 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 09:56:58,619 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 09:56:58,620 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 09:56:58,620 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 09:56:58,621 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 09:56:58,621 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 09:56:58,621 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 09:56:58,621 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 09:56:58,621 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 09:56:58,621 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 09:56:58,622 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 09:56:58,622 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 09:56:58,622 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 09:56:58,622 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 09:56:58,622 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 09:56:58,622 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 09:56:58,623 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 09:56:58,623 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 09:56:58,623 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 09:56:58,623 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 09:56:58,623 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 09:56:58,623 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 09:56:58,624 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 09:56:58,624 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 09:56:58,652 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 09:56:58,664 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 09:56:58,667 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 09:56:58,669 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 09:56:58,669 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 09:56:58,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 09:56:58,944 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGd9dd0fc27 [2018-04-11 09:56:59,052 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 09:56:59,052 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 09:56:59,052 INFO L168 CDTParser]: Scanning cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 09:56:59,059 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 09:56:59,059 INFO L215 ultiparseSymbolTable]: [2018-04-11 09:56:59,059 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 09:56:59,059 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-11 09:56:59,059 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 09:56:59,059 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-11 09:56:59,060 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-11 09:56:59,060 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 09:56:59,060 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-11 09:56:59,060 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-11 09:56:59,060 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-11 09:56:59,060 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-11 09:56:59,060 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-11 09:56:59,060 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-11 09:56:59,060 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-11 09:56:59,060 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-11 09:56:59,060 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-11 09:56:59,061 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-11 09:56:59,061 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-11 09:56:59,061 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-11 09:56:59,061 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-11 09:56:59,061 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-11 09:56:59,061 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-11 09:56:59,061 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-11 09:56:59,061 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-11 09:56:59,061 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-11 09:56:59,061 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-11 09:56:59,061 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-11 09:56:59,062 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-11 09:56:59,062 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-11 09:56:59,062 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-11 09:56:59,062 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-11 09:56:59,062 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-11 09:56:59,062 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-11 09:56:59,062 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-11 09:56:59,062 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-11 09:56:59,062 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-11 09:56:59,062 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-11 09:56:59,062 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-11 09:56:59,063 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-11 09:56:59,063 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-11 09:56:59,063 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-11 09:56:59,063 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-11 09:56:59,063 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-11 09:56:59,063 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-11 09:56:59,063 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-11 09:56:59,063 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-11 09:56:59,063 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-11 09:56:59,063 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-11 09:56:59,063 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-11 09:56:59,064 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-11 09:56:59,064 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-11 09:56:59,064 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-11 09:56:59,064 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-11 09:56:59,064 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-11 09:56:59,064 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-11 09:56:59,064 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-11 09:56:59,064 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-11 09:56:59,064 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-11 09:56:59,064 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-11 09:56:59,064 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-11 09:56:59,064 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-11 09:56:59,064 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-11 09:56:59,064 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-11 09:56:59,064 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-11 09:56:59,064 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-11 09:56:59,065 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-11 09:56:59,065 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-11 09:56:59,065 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-11 09:56:59,065 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-11 09:56:59,065 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-11 09:56:59,065 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-11 09:56:59,065 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-11 09:56:59,065 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-11 09:56:59,065 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-11 09:56:59,065 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-11 09:56:59,065 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-11 09:56:59,065 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-11 09:56:59,065 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-11 09:56:59,065 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-11 09:56:59,065 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-11 09:56:59,065 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-11 09:56:59,065 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-11 09:56:59,065 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-11 09:56:59,065 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-11 09:56:59,066 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-11 09:56:59,066 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-11 09:56:59,066 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-11 09:56:59,066 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-11 09:56:59,066 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-11 09:56:59,066 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-11 09:56:59,066 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-11 09:56:59,066 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-11 09:56:59,066 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-11 09:56:59,066 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-11 09:56:59,066 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-11 09:56:59,067 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-11 09:56:59,067 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-11 09:56:59,067 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-11 09:56:59,067 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-11 09:56:59,067 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-11 09:56:59,067 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-11 09:56:59,067 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-11 09:56:59,067 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-11 09:56:59,067 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-11 09:56:59,067 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-11 09:56:59,067 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-11 09:56:59,067 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-11 09:56:59,068 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-11 09:56:59,068 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-11 09:56:59,068 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-11 09:56:59,068 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-11 09:56:59,068 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-11 09:56:59,068 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-11 09:56:59,068 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-11 09:56:59,068 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-11 09:56:59,068 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-11 09:56:59,068 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-11 09:56:59,068 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-11 09:56:59,069 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-11 09:56:59,069 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-11 09:56:59,069 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-11 09:56:59,069 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-11 09:56:59,069 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-11 09:56:59,069 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-11 09:56:59,069 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-11 09:56:59,069 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-11 09:56:59,069 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-11 09:56:59,082 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGd9dd0fc27 [2018-04-11 09:56:59,084 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 09:56:59,085 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 09:56:59,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 09:56:59,086 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 09:56:59,090 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 09:56:59,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 09:56:59" (1/1) ... [2018-04-11 09:56:59,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@403bdb97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:56:59, skipping insertion in model container [2018-04-11 09:56:59,093 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 09:56:59" (1/1) ... [2018-04-11 09:56:59,103 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 09:56:59,123 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 09:56:59,255 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 09:56:59,291 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 09:56:59,296 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-11 09:56:59,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:56:59 WrapperNode [2018-04-11 09:56:59,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 09:56:59,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 09:56:59,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 09:56:59,326 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 09:56:59,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:56:59" (1/1) ... [2018-04-11 09:56:59,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:56:59" (1/1) ... [2018-04-11 09:56:59,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:56:59" (1/1) ... [2018-04-11 09:56:59,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:56:59" (1/1) ... [2018-04-11 09:56:59,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:56:59" (1/1) ... [2018-04-11 09:56:59,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:56:59" (1/1) ... [2018-04-11 09:56:59,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:56:59" (1/1) ... [2018-04-11 09:56:59,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 09:56:59,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 09:56:59,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 09:56:59,358 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 09:56:59,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:56:59" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 09:56:59,473 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 09:56:59,473 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 09:56:59,474 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 09:56:59,474 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 09:56:59,474 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncat [2018-04-11 09:56:59,474 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 09:56:59,474 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 09:56:59,474 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 09:56:59,474 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 09:56:59,474 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 09:56:59,474 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 09:56:59,474 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 09:56:59,474 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 09:56:59,474 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 09:56:59,475 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 09:56:59,475 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 09:56:59,475 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 09:56:59,475 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 09:56:59,475 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 09:56:59,475 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 09:56:59,475 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 09:56:59,475 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 09:56:59,475 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 09:56:59,476 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 09:56:59,476 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 09:56:59,476 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 09:56:59,476 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 09:56:59,476 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 09:56:59,476 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 09:56:59,476 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 09:56:59,476 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 09:56:59,476 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 09:56:59,476 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 09:56:59,477 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 09:56:59,477 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 09:56:59,477 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 09:56:59,477 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 09:56:59,477 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 09:56:59,477 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 09:56:59,477 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 09:56:59,477 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 09:56:59,477 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 09:56:59,477 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 09:56:59,478 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 09:56:59,478 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 09:56:59,478 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 09:56:59,478 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 09:56:59,478 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 09:56:59,478 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 09:56:59,478 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 09:56:59,478 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 09:56:59,478 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 09:56:59,478 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 09:56:59,479 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 09:56:59,479 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 09:56:59,479 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 09:56:59,479 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 09:56:59,479 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 09:56:59,479 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 09:56:59,479 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 09:56:59,479 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 09:56:59,479 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 09:56:59,479 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 09:56:59,479 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 09:56:59,480 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 09:56:59,480 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 09:56:59,480 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 09:56:59,480 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 09:56:59,480 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 09:56:59,480 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 09:56:59,480 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 09:56:59,480 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 09:56:59,480 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 09:56:59,480 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 09:56:59,480 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 09:56:59,480 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 09:56:59,480 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 09:56:59,480 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 09:56:59,480 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 09:56:59,481 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 09:56:59,481 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 09:56:59,481 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 09:56:59,481 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 09:56:59,481 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 09:56:59,481 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 09:56:59,481 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 09:56:59,481 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 09:56:59,481 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 09:56:59,481 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 09:56:59,481 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 09:56:59,481 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 09:56:59,481 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 09:56:59,482 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 09:56:59,482 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 09:56:59,482 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 09:56:59,482 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 09:56:59,482 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 09:56:59,482 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 09:56:59,482 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 09:56:59,482 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 09:56:59,482 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 09:56:59,482 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 09:56:59,482 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 09:56:59,483 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 09:56:59,483 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 09:56:59,483 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 09:56:59,483 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 09:56:59,483 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 09:56:59,483 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 09:56:59,483 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncat [2018-04-11 09:56:59,483 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 09:56:59,483 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 09:56:59,483 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 09:56:59,484 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 09:56:59,484 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 09:56:59,484 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 09:56:59,484 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 09:56:59,484 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 09:56:59,732 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 09:56:59,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 09:56:59 BoogieIcfgContainer [2018-04-11 09:56:59,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 09:56:59,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 09:56:59,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 09:56:59,735 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 09:56:59,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 09:56:59" (1/3) ... [2018-04-11 09:56:59,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3196f531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 09:56:59, skipping insertion in model container [2018-04-11 09:56:59,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:56:59" (2/3) ... [2018-04-11 09:56:59,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3196f531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 09:56:59, skipping insertion in model container [2018-04-11 09:56:59,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 09:56:59" (3/3) ... [2018-04-11 09:56:59,737 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 09:56:59,742 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 09:56:59,746 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-04-11 09:56:59,767 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 09:56:59,768 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 09:56:59,768 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 09:56:59,768 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 09:56:59,768 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 09:56:59,768 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 09:56:59,768 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 09:56:59,768 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 09:56:59,768 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 09:56:59,769 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 09:56:59,776 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-04-11 09:56:59,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-11 09:56:59,781 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:56:59,781 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:56:59,781 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:56:59,784 INFO L82 PathProgramCache]: Analyzing trace with hash 281371018, now seen corresponding path program 1 times [2018-04-11 09:56:59,785 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:56:59,785 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:56:59,812 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:56:59,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:56:59,812 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:56:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:56:59,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:56:59,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:56:59,872 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 09:56:59,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 09:56:59,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 09:56:59,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 09:56:59,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 09:56:59,882 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 3 states. [2018-04-11 09:56:59,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:56:59,968 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-04-11 09:56:59,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 09:56:59,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-04-11 09:56:59,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:56:59,977 INFO L225 Difference]: With dead ends: 59 [2018-04-11 09:56:59,978 INFO L226 Difference]: Without dead ends: 55 [2018-04-11 09:56:59,979 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 09:56:59,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-04-11 09:57:00,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-04-11 09:57:00,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 09:57:00,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-04-11 09:57:00,008 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 11 [2018-04-11 09:57:00,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:57:00,008 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-04-11 09:57:00,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 09:57:00,008 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-04-11 09:57:00,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 09:57:00,009 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:57:00,009 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:57:00,009 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:57:00,009 INFO L82 PathProgramCache]: Analyzing trace with hash -2051881253, now seen corresponding path program 1 times [2018-04-11 09:57:00,009 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:57:00,009 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:57:00,010 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:00,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:57:00,010 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:57:00,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:57:00,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:57:00,067 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 09:57:00,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 09:57:00,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 09:57:00,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 09:57:00,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 09:57:00,069 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 5 states. [2018-04-11 09:57:00,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:57:00,109 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-04-11 09:57:00,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 09:57:00,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-11 09:57:00,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:57:00,109 INFO L225 Difference]: With dead ends: 58 [2018-04-11 09:57:00,109 INFO L226 Difference]: Without dead ends: 55 [2018-04-11 09:57:00,110 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 09:57:00,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-04-11 09:57:00,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-04-11 09:57:00,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 09:57:00,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-04-11 09:57:00,113 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 15 [2018-04-11 09:57:00,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:57:00,113 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-04-11 09:57:00,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 09:57:00,113 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-04-11 09:57:00,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 09:57:00,113 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:57:00,113 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:57:00,113 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:57:00,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1371822883, now seen corresponding path program 1 times [2018-04-11 09:57:00,114 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:57:00,114 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:57:00,114 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:00,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:57:00,114 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:57:00,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:57:00,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:57:00,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 09:57:00,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 09:57:00,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 09:57:00,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 09:57:00,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 09:57:00,179 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 4 states. [2018-04-11 09:57:00,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:57:00,230 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-04-11 09:57:00,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 09:57:00,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-11 09:57:00,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:57:00,231 INFO L225 Difference]: With dead ends: 54 [2018-04-11 09:57:00,231 INFO L226 Difference]: Without dead ends: 54 [2018-04-11 09:57:00,232 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 09:57:00,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-11 09:57:00,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-11 09:57:00,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-11 09:57:00,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-04-11 09:57:00,237 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 15 [2018-04-11 09:57:00,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:57:00,237 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-04-11 09:57:00,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 09:57:00,237 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-04-11 09:57:00,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 09:57:00,238 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:57:00,238 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:57:00,238 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:57:00,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1371822882, now seen corresponding path program 1 times [2018-04-11 09:57:00,238 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:57:00,240 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:57:00,241 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:00,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:57:00,241 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:57:00,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:57:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:57:00,371 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 09:57:00,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 09:57:00,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 09:57:00,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 09:57:00,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-04-11 09:57:00,372 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 8 states. [2018-04-11 09:57:00,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:57:00,495 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-04-11 09:57:00,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 09:57:00,495 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-04-11 09:57:00,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:57:00,496 INFO L225 Difference]: With dead ends: 53 [2018-04-11 09:57:00,496 INFO L226 Difference]: Without dead ends: 53 [2018-04-11 09:57:00,496 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-04-11 09:57:00,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-11 09:57:00,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-04-11 09:57:00,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-11 09:57:00,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-04-11 09:57:00,499 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 15 [2018-04-11 09:57:00,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:57:00,508 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-04-11 09:57:00,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 09:57:00,508 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-04-11 09:57:00,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 09:57:00,509 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:57:00,509 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:57:00,509 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:57:00,510 INFO L82 PathProgramCache]: Analyzing trace with hash 423163648, now seen corresponding path program 1 times [2018-04-11 09:57:00,510 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:57:00,510 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:57:00,511 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:00,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:57:00,511 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:57:00,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:57:00,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:57:00,540 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 09:57:00,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 09:57:00,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 09:57:00,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 09:57:00,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 09:57:00,540 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-04-11 09:57:00,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:57:00,570 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-04-11 09:57:00,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 09:57:00,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-11 09:57:00,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:57:00,570 INFO L225 Difference]: With dead ends: 52 [2018-04-11 09:57:00,571 INFO L226 Difference]: Without dead ends: 52 [2018-04-11 09:57:00,571 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 09:57:00,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-11 09:57:00,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-04-11 09:57:00,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-11 09:57:00,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-04-11 09:57:00,573 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 16 [2018-04-11 09:57:00,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:57:00,573 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-04-11 09:57:00,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 09:57:00,573 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-04-11 09:57:00,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 09:57:00,573 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:57:00,573 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:57:00,573 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:57:00,574 INFO L82 PathProgramCache]: Analyzing trace with hash 423163649, now seen corresponding path program 1 times [2018-04-11 09:57:00,574 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:57:00,574 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:57:00,574 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:00,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:57:00,574 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:57:00,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:57:00,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:57:00,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 09:57:00,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 09:57:00,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 09:57:00,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 09:57:00,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 09:57:00,608 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-04-11 09:57:00,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:57:00,637 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-04-11 09:57:00,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 09:57:00,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-11 09:57:00,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:57:00,638 INFO L225 Difference]: With dead ends: 51 [2018-04-11 09:57:00,638 INFO L226 Difference]: Without dead ends: 51 [2018-04-11 09:57:00,638 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-11 09:57:00,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-11 09:57:00,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-11 09:57:00,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-11 09:57:00,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-04-11 09:57:00,640 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 16 [2018-04-11 09:57:00,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:57:00,640 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-04-11 09:57:00,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 09:57:00,640 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-04-11 09:57:00,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 09:57:00,640 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:57:00,641 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] [2018-04-11 09:57:00,641 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:57:00,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1443369787, now seen corresponding path program 1 times [2018-04-11 09:57:00,641 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:57:00,641 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:57:00,641 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:00,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:57:00,641 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:57:00,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:57:00,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:57:00,678 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 09:57:00,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 09:57:00,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 09:57:00,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 09:57:00,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 09:57:00,679 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-04-11 09:57:00,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:57:00,714 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-04-11 09:57:00,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 09:57:00,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-04-11 09:57:00,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:57:00,715 INFO L225 Difference]: With dead ends: 47 [2018-04-11 09:57:00,715 INFO L226 Difference]: Without dead ends: 47 [2018-04-11 09:57:00,715 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 09:57:00,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-04-11 09:57:00,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-04-11 09:57:00,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-11 09:57:00,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-04-11 09:57:00,717 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 20 [2018-04-11 09:57:00,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:57:00,717 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-04-11 09:57:00,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 09:57:00,717 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-04-11 09:57:00,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 09:57:00,717 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:57:00,717 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] [2018-04-11 09:57:00,717 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:57:00,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1443369788, now seen corresponding path program 1 times [2018-04-11 09:57:00,718 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:57:00,718 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:57:00,718 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:00,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:57:00,718 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:57:00,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:57:00,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:57:00,803 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 09:57:00,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 09:57:00,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 09:57:00,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 09:57:00,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 09:57:00,804 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 9 states. [2018-04-11 09:57:00,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:57:00,908 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-04-11 09:57:00,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 09:57:00,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-04-11 09:57:00,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:57:00,909 INFO L225 Difference]: With dead ends: 65 [2018-04-11 09:57:00,909 INFO L226 Difference]: Without dead ends: 65 [2018-04-11 09:57:00,910 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-04-11 09:57:00,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-11 09:57:00,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-04-11 09:57:00,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-11 09:57:00,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2018-04-11 09:57:00,912 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 20 [2018-04-11 09:57:00,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:57:00,912 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2018-04-11 09:57:00,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 09:57:00,912 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-04-11 09:57:00,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 09:57:00,913 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:57:00,913 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] [2018-04-11 09:57:00,913 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:57:00,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1783256229, now seen corresponding path program 1 times [2018-04-11 09:57:00,913 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:57:00,913 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:57:00,913 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:00,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:57:00,914 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:57:00,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:57:01,028 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-11 09:57:01,029 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 09:57:01,029 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 09:57:01,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:57:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:57:01,055 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 09:57:01,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:57:01,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:01,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:57:01,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:01,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:57:01,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-04-11 09:57:01,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:01,157 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:01,157 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-11 09:57:01,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:01,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:01,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:01,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 09:57:01,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:01,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:57:01,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-04-11 09:57:01,300 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-11 09:57:01,319 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 09:57:01,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-04-11 09:57:01,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 09:57:01,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 09:57:01,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-04-11 09:57:01,320 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 22 states. [2018-04-11 09:57:01,655 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 39 DAG size of output 31 [2018-04-11 09:57:02,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:57:02,057 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2018-04-11 09:57:02,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 09:57:02,057 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2018-04-11 09:57:02,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:57:02,058 INFO L225 Difference]: With dead ends: 83 [2018-04-11 09:57:02,058 INFO L226 Difference]: Without dead ends: 83 [2018-04-11 09:57:02,058 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2018-04-11 09:57:02,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-11 09:57:02,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2018-04-11 09:57:02,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-11 09:57:02,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2018-04-11 09:57:02,063 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 23 [2018-04-11 09:57:02,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:57:02,063 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2018-04-11 09:57:02,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 09:57:02,064 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2018-04-11 09:57:02,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 09:57:02,064 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:57:02,065 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-11 09:57:02,065 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:57:02,065 INFO L82 PathProgramCache]: Analyzing trace with hash -18671751, now seen corresponding path program 1 times [2018-04-11 09:57:02,065 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:57:02,065 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:57:02,066 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:02,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:57:02,066 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:57:02,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:57:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:57:02,104 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 09:57:02,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 09:57:02,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 09:57:02,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 09:57:02,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 09:57:02,106 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 6 states. [2018-04-11 09:57:02,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:57:02,148 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2018-04-11 09:57:02,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 09:57:02,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-04-11 09:57:02,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:57:02,150 INFO L225 Difference]: With dead ends: 72 [2018-04-11 09:57:02,150 INFO L226 Difference]: Without dead ends: 72 [2018-04-11 09:57:02,150 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-11 09:57:02,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-11 09:57:02,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2018-04-11 09:57:02,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-11 09:57:02,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2018-04-11 09:57:02,153 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 25 [2018-04-11 09:57:02,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:57:02,153 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2018-04-11 09:57:02,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 09:57:02,153 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2018-04-11 09:57:02,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 09:57:02,154 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:57:02,154 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-11 09:57:02,154 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:57:02,154 INFO L82 PathProgramCache]: Analyzing trace with hash -18671750, now seen corresponding path program 1 times [2018-04-11 09:57:02,154 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:57:02,154 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:57:02,155 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:02,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:57:02,155 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:57:02,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:57:02,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:57:02,248 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 09:57:02,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 09:57:02,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 09:57:02,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 09:57:02,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-11 09:57:02,249 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand 9 states. [2018-04-11 09:57:02,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:57:02,322 INFO L93 Difference]: Finished difference Result 98 states and 120 transitions. [2018-04-11 09:57:02,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 09:57:02,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-04-11 09:57:02,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:57:02,323 INFO L225 Difference]: With dead ends: 98 [2018-04-11 09:57:02,323 INFO L226 Difference]: Without dead ends: 98 [2018-04-11 09:57:02,323 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-04-11 09:57:02,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-04-11 09:57:02,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 80. [2018-04-11 09:57:02,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-04-11 09:57:02,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2018-04-11 09:57:02,326 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 25 [2018-04-11 09:57:02,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:57:02,326 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2018-04-11 09:57:02,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 09:57:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2018-04-11 09:57:02,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 09:57:02,326 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:57:02,326 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:57:02,326 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:57:02,327 INFO L82 PathProgramCache]: Analyzing trace with hash -535876900, now seen corresponding path program 2 times [2018-04-11 09:57:02,327 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:57:02,327 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:57:02,327 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:02,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:57:02,327 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:57:02,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:57:02,582 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-11 09:57:02,582 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 09:57:02,582 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 09:57:02,588 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 09:57:02,603 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 09:57:02,603 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 09:57:02,605 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 09:57:02,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:57:02,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:02,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:57:02,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:02,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:57:02,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-11 09:57:02,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:02,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:02,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 09:57:02,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:02,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:02,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 09:57:02,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:02,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:57:02,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-11 09:57:02,771 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-11 09:57:02,772 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-11 09:57:02,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:02,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:57:02,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 09:57:02,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-04-11 09:57:02,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:02,820 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-11 09:57:02,821 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-11 09:57:02,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:02,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:57:02,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 09:57:02,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:48 [2018-04-11 09:57:02,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:02,916 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-11 09:57:02,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-11 09:57:02,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:02,925 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 19 [2018-04-11 09:57:02,926 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 09:57:02,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 09:57:02,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 09:57:02,937 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:69 [2018-04-11 09:57:03,044 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-11 09:57:03,061 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 09:57:03,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 26 [2018-04-11 09:57:03,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 09:57:03,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 09:57:03,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2018-04-11 09:57:03,061 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand 27 states. [2018-04-11 09:57:08,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:57:08,483 INFO L93 Difference]: Finished difference Result 189 states and 227 transitions. [2018-04-11 09:57:08,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 09:57:08,483 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-04-11 09:57:08,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:57:08,484 INFO L225 Difference]: With dead ends: 189 [2018-04-11 09:57:08,484 INFO L226 Difference]: Without dead ends: 189 [2018-04-11 09:57:08,485 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=319, Invalid=1661, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 09:57:08,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-04-11 09:57:08,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 83. [2018-04-11 09:57:08,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-11 09:57:08,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2018-04-11 09:57:08,493 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 26 [2018-04-11 09:57:08,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:57:08,493 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2018-04-11 09:57:08,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 09:57:08,493 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2018-04-11 09:57:08,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 09:57:08,494 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:57:08,494 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:57:08,494 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:57:08,494 INFO L82 PathProgramCache]: Analyzing trace with hash 84668347, now seen corresponding path program 3 times [2018-04-11 09:57:08,495 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:57:08,495 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:57:08,495 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:08,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 09:57:08,495 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:57:08,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:57:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:57:08,808 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 09:57:08,808 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 09:57:08,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 09:57:08,836 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 09:57:08,836 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 09:57:08,839 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 09:57:08,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:57:08,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:08,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:57:08,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-04-11 09:57:08,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 09:57:08,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 09:57:08,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 09:57:08,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:45 [2018-04-11 09:57:09,031 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 32 treesize of output 29 [2018-04-11 09:57:09,033 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-11 09:57:09,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:09,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:57:09,054 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 31 treesize of output 28 [2018-04-11 09:57:09,056 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-11 09:57:09,056 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:09,060 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:57:09,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 09:57:09,073 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:56 [2018-04-11 09:57:09,109 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 30 treesize of output 25 [2018-04-11 09:57:09,112 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 17 treesize of output 18 [2018-04-11 09:57:09,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:09,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:57:09,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 44 [2018-04-11 09:57:09,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:09,138 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 30 treesize of output 40 [2018-04-11 09:57:09,138 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:09,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-04-11 09:57:09,154 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:09,161 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:57:09,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 09:57:09,171 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:63, output treesize:55 [2018-04-11 09:57:10,300 WARN L148 SmtUtils]: Spent 1104ms on a formula simplification that was a NOOP. DAG size: 32 [2018-04-11 09:57:11,148 WARN L148 SmtUtils]: Spent 818ms on a formula simplification that was a NOOP. DAG size: 32 [2018-04-11 09:57:12,569 WARN L148 SmtUtils]: Spent 1393ms on a formula simplification that was a NOOP. DAG size: 32 [2018-04-11 09:57:12,837 WARN L151 SmtUtils]: Spent 241ms on a formula simplification. DAG size of input: 32 DAG size of output 27 [2018-04-11 09:57:12,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:12,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:12,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2018-04-11 09:57:12,898 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 67 [2018-04-11 09:57:12,904 INFO L267 ElimStorePlain]: Start of recursive call 3: 11 dim-0 vars, End of recursive call: 11 dim-0 vars, and 14 xjuncts. [2018-04-11 09:57:12,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 09:57:12,932 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:12,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 09:57:12,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 09:57:12,952 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:39, output treesize:56 [2018-04-11 09:57:13,092 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:57:13,111 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 09:57:13,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2018-04-11 09:57:13,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 09:57:13,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 09:57:13,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=846, Unknown=0, NotChecked=0, Total=930 [2018-04-11 09:57:13,113 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. Second operand 31 states. [2018-04-11 09:57:18,437 WARN L151 SmtUtils]: Spent 4673ms on a formula simplification. DAG size of input: 51 DAG size of output 51 [2018-04-11 09:57:20,562 WARN L151 SmtUtils]: Spent 2016ms on a formula simplification. DAG size of input: 59 DAG size of output 49 [2018-04-11 09:57:23,137 WARN L148 SmtUtils]: Spent 1218ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-11 09:57:24,889 WARN L148 SmtUtils]: Spent 875ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-11 09:57:29,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:57:29,008 INFO L93 Difference]: Finished difference Result 434 states and 533 transitions. [2018-04-11 09:57:29,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-11 09:57:29,008 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 29 [2018-04-11 09:57:29,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:57:29,011 INFO L225 Difference]: With dead ends: 434 [2018-04-11 09:57:29,011 INFO L226 Difference]: Without dead ends: 434 [2018-04-11 09:57:29,012 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1269 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=553, Invalid=4277, Unknown=0, NotChecked=0, Total=4830 [2018-04-11 09:57:29,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-04-11 09:57:29,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 232. [2018-04-11 09:57:29,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-04-11 09:57:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 310 transitions. [2018-04-11 09:57:29,028 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 310 transitions. Word has length 29 [2018-04-11 09:57:29,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:57:29,028 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 310 transitions. [2018-04-11 09:57:29,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 09:57:29,028 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 310 transitions. [2018-04-11 09:57:29,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 09:57:29,029 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:57:29,030 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:57:29,030 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:57:29,030 INFO L82 PathProgramCache]: Analyzing trace with hash 507370173, now seen corresponding path program 1 times [2018-04-11 09:57:29,030 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:57:29,030 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:57:29,031 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:29,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 09:57:29,031 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:57:29,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:57:29,357 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:57:29,357 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 09:57:29,357 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 09:57:29,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:57:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:57:29,389 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 09:57:29,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:57:29,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:29,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:57:29,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:29,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:57:29,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-11 09:57:29,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:29,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:29,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 09:57:29,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:29,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:29,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 09:57:29,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:29,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:57:29,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-11 09:57:29,626 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-11 09:57:29,627 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-11 09:57:29,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:29,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:57:29,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 09:57:29,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-04-11 09:57:29,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:29,668 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-11 09:57:29,669 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-11 09:57:29,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:29,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:57:29,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 09:57:29,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:48 [2018-04-11 09:57:29,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:29,881 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 45 treesize of output 41 [2018-04-11 09:57:29,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:29,890 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 27 treesize of output 41 [2018-04-11 09:57:29,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 09:57:29,920 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-11 09:57:29,920 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:29,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 09:57:29,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 09:57:29,940 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:73, output treesize:122 [2018-04-11 09:57:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:57:30,083 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 09:57:30,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 31 [2018-04-11 09:57:30,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 09:57:30,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 09:57:30,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2018-04-11 09:57:30,084 INFO L87 Difference]: Start difference. First operand 232 states and 310 transitions. Second operand 32 states. [2018-04-11 09:57:30,700 WARN L151 SmtUtils]: Spent 385ms on a formula simplification. DAG size of input: 79 DAG size of output 52 [2018-04-11 09:57:35,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:57:35,061 INFO L93 Difference]: Finished difference Result 575 states and 743 transitions. [2018-04-11 09:57:35,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 09:57:35,061 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 29 [2018-04-11 09:57:35,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:57:35,063 INFO L225 Difference]: With dead ends: 575 [2018-04-11 09:57:35,063 INFO L226 Difference]: Without dead ends: 575 [2018-04-11 09:57:35,064 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=433, Invalid=2759, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 09:57:35,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-04-11 09:57:35,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 279. [2018-04-11 09:57:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-04-11 09:57:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 374 transitions. [2018-04-11 09:57:35,076 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 374 transitions. Word has length 29 [2018-04-11 09:57:35,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:57:35,076 INFO L459 AbstractCegarLoop]: Abstraction has 279 states and 374 transitions. [2018-04-11 09:57:35,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 09:57:35,076 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 374 transitions. [2018-04-11 09:57:35,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 09:57:35,077 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:57:35,078 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:57:35,078 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:57:35,078 INFO L82 PathProgramCache]: Analyzing trace with hash -751050763, now seen corresponding path program 1 times [2018-04-11 09:57:35,078 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:57:35,078 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:57:35,079 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:35,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:57:35,079 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:57:35,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:57:35,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:57:35,133 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 09:57:35,133 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 09:57:35,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:57:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:57:35,152 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 09:57:35,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:57:35,179 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 09:57:35,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-04-11 09:57:35,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 09:57:35,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 09:57:35,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 09:57:35,180 INFO L87 Difference]: Start difference. First operand 279 states and 374 transitions. Second operand 7 states. [2018-04-11 09:57:35,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:57:35,221 INFO L93 Difference]: Finished difference Result 307 states and 368 transitions. [2018-04-11 09:57:35,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 09:57:35,221 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-04-11 09:57:35,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:57:35,222 INFO L225 Difference]: With dead ends: 307 [2018-04-11 09:57:35,222 INFO L226 Difference]: Without dead ends: 307 [2018-04-11 09:57:35,222 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-04-11 09:57:35,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-04-11 09:57:35,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 204. [2018-04-11 09:57:35,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-04-11 09:57:35,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 252 transitions. [2018-04-11 09:57:35,229 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 252 transitions. Word has length 32 [2018-04-11 09:57:35,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:57:35,229 INFO L459 AbstractCegarLoop]: Abstraction has 204 states and 252 transitions. [2018-04-11 09:57:35,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 09:57:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 252 transitions. [2018-04-11 09:57:35,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 09:57:35,230 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:57:35,230 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:57:35,230 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:57:35,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1074866234, now seen corresponding path program 2 times [2018-04-11 09:57:35,231 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:57:35,231 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:57:35,231 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:35,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:57:35,232 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:57:35,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:57:35,597 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-11 09:57:35,598 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 09:57:35,598 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 09:57:35,603 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 09:57:35,618 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 09:57:35,618 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 09:57:35,620 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 09:57:35,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 6 treesize of output 5 [2018-04-11 09:57:35,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:35,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:57:35,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:35,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:57:35,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-11 09:57:35,723 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:35,723 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:35,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 12 treesize of output 21 [2018-04-11 09:57:35,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:35,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:35,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:35,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 09:57:35,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:35,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:57:35,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-11 09:57:35,798 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-11 09:57:35,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 09:57:35,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:35,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:57:35,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 09:57:35,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-04-11 09:57:35,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:35,845 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-11 09:57:35,846 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-11 09:57:35,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:35,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:57:35,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 09:57:35,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:48 [2018-04-11 09:57:36,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:36,090 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 50 treesize of output 44 [2018-04-11 09:57:36,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:36,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:36,098 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 30 treesize of output 54 [2018-04-11 09:57:36,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 09:57:36,114 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-11 09:57:36,114 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:36,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 09:57:36,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-11 09:57:36,138 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:70, output treesize:204 [2018-04-11 09:57:36,307 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-11 09:57:36,325 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 09:57:36,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2018-04-11 09:57:36,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 09:57:36,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 09:57:36,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1080, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 09:57:36,326 INFO L87 Difference]: Start difference. First operand 204 states and 252 transitions. Second operand 35 states. [2018-04-11 09:57:39,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:57:39,918 INFO L93 Difference]: Finished difference Result 541 states and 637 transitions. [2018-04-11 09:57:39,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 09:57:39,919 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 32 [2018-04-11 09:57:39,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:57:39,920 INFO L225 Difference]: With dead ends: 541 [2018-04-11 09:57:39,920 INFO L226 Difference]: Without dead ends: 541 [2018-04-11 09:57:39,921 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=409, Invalid=3251, Unknown=0, NotChecked=0, Total=3660 [2018-04-11 09:57:39,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-04-11 09:57:39,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 206. [2018-04-11 09:57:39,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-04-11 09:57:39,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 253 transitions. [2018-04-11 09:57:39,929 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 253 transitions. Word has length 32 [2018-04-11 09:57:39,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:57:39,929 INFO L459 AbstractCegarLoop]: Abstraction has 206 states and 253 transitions. [2018-04-11 09:57:39,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 09:57:39,930 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 253 transitions. [2018-04-11 09:57:39,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 09:57:39,930 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:57:39,930 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:57:39,930 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:57:39,931 INFO L82 PathProgramCache]: Analyzing trace with hash -885064269, now seen corresponding path program 1 times [2018-04-11 09:57:39,931 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:57:39,931 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:57:39,931 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:39,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 09:57:39,932 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:57:39,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:57:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:57:40,024 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 09:57:40,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 09:57:40,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 09:57:40,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 09:57:40,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-04-11 09:57:40,024 INFO L87 Difference]: Start difference. First operand 206 states and 253 transitions. Second operand 11 states. [2018-04-11 09:57:40,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:57:40,126 INFO L93 Difference]: Finished difference Result 300 states and 359 transitions. [2018-04-11 09:57:40,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 09:57:40,127 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-04-11 09:57:40,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:57:40,127 INFO L225 Difference]: With dead ends: 300 [2018-04-11 09:57:40,127 INFO L226 Difference]: Without dead ends: 300 [2018-04-11 09:57:40,128 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2018-04-11 09:57:40,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-04-11 09:57:40,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 229. [2018-04-11 09:57:40,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-11 09:57:40,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 283 transitions. [2018-04-11 09:57:40,131 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 283 transitions. Word has length 32 [2018-04-11 09:57:40,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:57:40,131 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 283 transitions. [2018-04-11 09:57:40,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 09:57:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 283 transitions. [2018-04-11 09:57:40,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 09:57:40,132 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:57:40,132 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:57:40,132 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:57:40,132 INFO L82 PathProgramCache]: Analyzing trace with hash -744515659, now seen corresponding path program 1 times [2018-04-11 09:57:40,132 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:57:40,132 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:57:40,133 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:40,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:57:40,133 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:57:40,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:57:40,257 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-11 09:57:40,257 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 09:57:40,257 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 09:57:40,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:57:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:57:40,292 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 09:57:40,295 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-11 09:57:40,297 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-11 09:57:40,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:40,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:57:40,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 09:57:40,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-04-11 09:57:40,378 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-11 09:57:40,383 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-11 09:57:40,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 09:57:40,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 09:57:40,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 09:57:40,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-04-11 09:57:40,455 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-11 09:57:40,473 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 09:57:40,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2018-04-11 09:57:40,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 09:57:40,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 09:57:40,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-04-11 09:57:40,474 INFO L87 Difference]: Start difference. First operand 229 states and 283 transitions. Second operand 19 states. [2018-04-11 09:57:42,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:57:42,418 INFO L93 Difference]: Finished difference Result 314 states and 387 transitions. [2018-04-11 09:57:42,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 09:57:42,418 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-04-11 09:57:42,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:57:42,419 INFO L225 Difference]: With dead ends: 314 [2018-04-11 09:57:42,420 INFO L226 Difference]: Without dead ends: 314 [2018-04-11 09:57:42,420 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2018-04-11 09:57:42,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-04-11 09:57:42,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 239. [2018-04-11 09:57:42,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-04-11 09:57:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 296 transitions. [2018-04-11 09:57:42,426 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 296 transitions. Word has length 32 [2018-04-11 09:57:42,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:57:42,426 INFO L459 AbstractCegarLoop]: Abstraction has 239 states and 296 transitions. [2018-04-11 09:57:42,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 09:57:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 296 transitions. [2018-04-11 09:57:42,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 09:57:42,427 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:57:42,427 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:57:42,427 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:57:42,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1936224867, now seen corresponding path program 3 times [2018-04-11 09:57:42,427 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:57:42,427 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:57:42,428 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:42,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:57:42,428 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:57:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:57:42,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:57:43,072 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:57:43,072 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 09:57:43,072 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 09:57:43,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 09:57:43,103 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-04-11 09:57:43,103 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 09:57:43,105 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 09:57:43,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:57:43,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:43,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:57:43,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:43,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:57:43,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-11 09:57:43,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:43,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:43,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 09:57:43,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:43,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:43,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:43,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 09:57:43,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:43,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:57:43,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-11 09:57:43,276 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-11 09:57:43,277 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-11 09:57:43,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:43,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:57:43,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 09:57:43,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-04-11 09:57:43,311 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:43,313 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-11 09:57:43,315 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-11 09:57:43,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:43,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:57:43,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 09:57:43,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:48 [2018-04-11 09:57:58,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:57:58,991 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 59 treesize of output 51 [2018-04-11 09:57:58,997 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-11 09:57:58,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:57:59,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 37 treesize of output 113 [2018-04-11 09:57:59,050 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-11 09:57:59,071 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 72 xjuncts. [2018-04-11 09:57:59,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 09:57:59,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 18 dim-0 vars, and 2 xjuncts. [2018-04-11 09:57:59,296 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:97, output treesize:945 [2018-04-11 09:57:59,573 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 38 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:57:59,590 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 09:57:59,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 40 [2018-04-11 09:57:59,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-11 09:57:59,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-11 09:57:59,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1468, Unknown=7, NotChecked=0, Total=1640 [2018-04-11 09:57:59,591 INFO L87 Difference]: Start difference. First operand 239 states and 296 transitions. Second operand 41 states. [2018-04-11 09:58:02,334 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 126 DAG size of output 50 [2018-04-11 09:58:02,546 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 130 DAG size of output 53 [2018-04-11 09:58:21,124 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 92 DAG size of output 62 [2018-04-11 09:58:21,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:58:21,538 INFO L93 Difference]: Finished difference Result 903 states and 1056 transitions. [2018-04-11 09:58:21,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-11 09:58:21,539 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 35 [2018-04-11 09:58:21,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:58:21,541 INFO L225 Difference]: With dead ends: 903 [2018-04-11 09:58:21,541 INFO L226 Difference]: Without dead ends: 903 [2018-04-11 09:58:21,542 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1726 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=806, Invalid=5347, Unknown=9, NotChecked=0, Total=6162 [2018-04-11 09:58:21,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2018-04-11 09:58:21,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 257. [2018-04-11 09:58:21,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-04-11 09:58:21,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 320 transitions. [2018-04-11 09:58:21,553 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 320 transitions. Word has length 35 [2018-04-11 09:58:21,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:58:21,553 INFO L459 AbstractCegarLoop]: Abstraction has 257 states and 320 transitions. [2018-04-11 09:58:21,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-11 09:58:21,553 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 320 transitions. [2018-04-11 09:58:21,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 09:58:21,554 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:58:21,554 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:58:21,554 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:58:21,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1826876010, now seen corresponding path program 1 times [2018-04-11 09:58:21,554 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:58:21,554 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:58:21,555 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:58:21,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 09:58:21,555 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:58:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:58:21,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:58:21,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:58:21,590 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 09:58:21,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 09:58:21,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 09:58:21,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 09:58:21,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 09:58:21,590 INFO L87 Difference]: Start difference. First operand 257 states and 320 transitions. Second operand 6 states. [2018-04-11 09:58:21,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:58:21,615 INFO L93 Difference]: Finished difference Result 320 states and 395 transitions. [2018-04-11 09:58:21,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 09:58:21,618 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-04-11 09:58:21,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:58:21,619 INFO L225 Difference]: With dead ends: 320 [2018-04-11 09:58:21,619 INFO L226 Difference]: Without dead ends: 292 [2018-04-11 09:58:21,619 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-04-11 09:58:21,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-04-11 09:58:21,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 261. [2018-04-11 09:58:21,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-04-11 09:58:21,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 319 transitions. [2018-04-11 09:58:21,623 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 319 transitions. Word has length 36 [2018-04-11 09:58:21,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:58:21,623 INFO L459 AbstractCegarLoop]: Abstraction has 261 states and 319 transitions. [2018-04-11 09:58:21,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 09:58:21,623 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 319 transitions. [2018-04-11 09:58:21,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 09:58:21,624 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:58:21,624 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] [2018-04-11 09:58:21,624 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:58:21,624 INFO L82 PathProgramCache]: Analyzing trace with hash -709485801, now seen corresponding path program 1 times [2018-04-11 09:58:21,624 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:58:21,624 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:58:21,625 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:58:21,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:58:21,625 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:58:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:58:21,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:58:21,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:58:21,686 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 09:58:21,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 09:58:21,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 09:58:21,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 09:58:21,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 09:58:21,687 INFO L87 Difference]: Start difference. First operand 261 states and 319 transitions. Second operand 6 states. [2018-04-11 09:58:21,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:58:21,797 INFO L93 Difference]: Finished difference Result 260 states and 318 transitions. [2018-04-11 09:58:21,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 09:58:21,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-04-11 09:58:21,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:58:21,798 INFO L225 Difference]: With dead ends: 260 [2018-04-11 09:58:21,798 INFO L226 Difference]: Without dead ends: 192 [2018-04-11 09:58:21,798 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-11 09:58:21,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-04-11 09:58:21,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 180. [2018-04-11 09:58:21,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-11 09:58:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 205 transitions. [2018-04-11 09:58:21,800 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 205 transitions. Word has length 39 [2018-04-11 09:58:21,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:58:21,800 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 205 transitions. [2018-04-11 09:58:21,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 09:58:21,800 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 205 transitions. [2018-04-11 09:58:21,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 09:58:21,801 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:58:21,801 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:58:21,801 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:58:21,801 INFO L82 PathProgramCache]: Analyzing trace with hash -95111334, now seen corresponding path program 2 times [2018-04-11 09:58:21,801 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:58:21,801 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:58:21,802 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:58:21,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:58:21,802 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:58:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:58:21,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:58:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:58:22,113 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 09:58:22,113 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 09:58:22,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 09:58:22,136 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 09:58:22,136 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 09:58:22,138 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 09:58:22,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:58:22,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:22,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:22,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 09:58:22,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:58:22,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:22,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:22,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:22,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 09:58:22,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:22,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:22,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 09:58:22,215 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 16 treesize of output 13 [2018-04-11 09:58:22,216 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-11 09:58:22,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:22,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:22,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 09:58:22,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-04-11 09:58:22,405 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 24 treesize of output 25 [2018-04-11 09:58:22,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 09:58:22,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:22,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:22,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 09:58:22,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2018-04-11 09:58:22,482 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 22 treesize of output 18 [2018-04-11 09:58:22,487 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-11 09:58:22,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 09:58:22,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 09:58:22,495 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-11 09:58:22,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-04-11 09:58:22,576 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:58:22,593 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 09:58:22,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2018-04-11 09:58:22,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 09:58:22,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 09:58:22,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2018-04-11 09:58:22,594 INFO L87 Difference]: Start difference. First operand 180 states and 205 transitions. Second operand 28 states. [2018-04-11 09:58:23,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:58:23,986 INFO L93 Difference]: Finished difference Result 202 states and 224 transitions. [2018-04-11 09:58:23,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 09:58:23,986 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2018-04-11 09:58:23,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:58:23,987 INFO L225 Difference]: With dead ends: 202 [2018-04-11 09:58:23,987 INFO L226 Difference]: Without dead ends: 202 [2018-04-11 09:58:23,987 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=239, Invalid=1831, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 09:58:23,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-04-11 09:58:23,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 161. [2018-04-11 09:58:23,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-11 09:58:23,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 182 transitions. [2018-04-11 09:58:23,991 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 182 transitions. Word has length 39 [2018-04-11 09:58:23,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:58:23,991 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 182 transitions. [2018-04-11 09:58:23,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 09:58:23,991 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 182 transitions. [2018-04-11 09:58:23,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 09:58:23,992 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:58:23,992 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:58:23,992 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:58:23,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1346524950, now seen corresponding path program 1 times [2018-04-11 09:58:23,992 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:58:23,992 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:58:23,993 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:58:23,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 09:58:23,993 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:58:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:58:24,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:58:24,221 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:58:24,222 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 09:58:24,222 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 09:58:24,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:58:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:58:24,243 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 09:58:24,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:58:24,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:24,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:58:24,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:24,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:24,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-11 09:58:24,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:24,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:24,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 09:58:24,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:24,292 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-11 09:58:24,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:24,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:24,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:17 [2018-04-11 09:58:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:58:24,701 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 09:58:24,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2018-04-11 09:58:24,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-11 09:58:24,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-11 09:58:24,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1030, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 09:58:24,702 INFO L87 Difference]: Start difference. First operand 161 states and 182 transitions. Second operand 34 states. [2018-04-11 09:58:25,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:58:25,806 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2018-04-11 09:58:25,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 09:58:25,806 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 40 [2018-04-11 09:58:25,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:58:25,806 INFO L225 Difference]: With dead ends: 209 [2018-04-11 09:58:25,806 INFO L226 Difference]: Without dead ends: 201 [2018-04-11 09:58:25,807 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=304, Invalid=2452, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 09:58:25,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-04-11 09:58:25,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 182. [2018-04-11 09:58:25,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-11 09:58:25,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 205 transitions. [2018-04-11 09:58:25,809 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 205 transitions. Word has length 40 [2018-04-11 09:58:25,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:58:25,809 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 205 transitions. [2018-04-11 09:58:25,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-11 09:58:25,809 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 205 transitions. [2018-04-11 09:58:25,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 09:58:25,810 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:58:25,810 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:58:25,810 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:58:25,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1346515914, now seen corresponding path program 1 times [2018-04-11 09:58:25,810 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:58:25,810 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:58:25,810 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:58:25,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:58:25,811 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:58:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:58:25,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:58:26,027 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:58:26,028 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 09:58:26,028 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 09:58:26,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:58:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:58:26,052 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 09:58:26,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:58:26,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:26,058 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-11 09:58:26,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:7 [2018-04-11 09:58:26,285 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-11 09:58:26,304 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 09:58:26,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2018-04-11 09:58:26,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 09:58:26,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 09:58:26,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2018-04-11 09:58:26,305 INFO L87 Difference]: Start difference. First operand 182 states and 205 transitions. Second operand 31 states. [2018-04-11 09:58:26,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:58:26,825 INFO L93 Difference]: Finished difference Result 195 states and 216 transitions. [2018-04-11 09:58:26,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 09:58:26,825 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2018-04-11 09:58:26,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:58:26,826 INFO L225 Difference]: With dead ends: 195 [2018-04-11 09:58:26,826 INFO L226 Difference]: Without dead ends: 161 [2018-04-11 09:58:26,826 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=249, Invalid=1913, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 09:58:26,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-11 09:58:26,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-04-11 09:58:26,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-11 09:58:26,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 181 transitions. [2018-04-11 09:58:26,828 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 181 transitions. Word has length 40 [2018-04-11 09:58:26,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:58:26,828 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 181 transitions. [2018-04-11 09:58:26,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 09:58:26,828 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 181 transitions. [2018-04-11 09:58:26,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 09:58:26,829 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:58:26,829 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:58:26,829 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:58:26,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1926731901, now seen corresponding path program 4 times [2018-04-11 09:58:26,829 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:58:26,829 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:58:26,829 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:58:26,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:58:26,830 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:58:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:58:26,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:58:27,207 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 82 DAG size of output 66 [2018-04-11 09:58:27,392 WARN L151 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 65 DAG size of output 52 [2018-04-11 09:58:28,085 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:58:28,085 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 09:58:28,085 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 09:58:28,090 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 09:58:28,103 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 09:58:28,103 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 09:58:28,105 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 09:58:28,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:58:28,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:28,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:58:28,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:28,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:28,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-11 09:58:28,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:28,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:28,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 09:58:28,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:28,225 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:28,225 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:28,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 09:58:28,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:28,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:28,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-11 09:58:28,282 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-11 09:58:28,283 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-11 09:58:28,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:28,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:28,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 09:58:28,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-04-11 09:58:28,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:28,331 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-11 09:58:28,333 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-11 09:58:28,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:28,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:28,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 09:58:28,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:48 [2018-04-11 09:58:29,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:29,083 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 85 treesize of output 73 [2018-04-11 09:58:29,085 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-11 09:58:29,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:29,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:29,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:29,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:29,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:29,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:29,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:29,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:29,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:29,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:29,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:29,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:29,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:29,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:29,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:29,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:29,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 25 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 217 [2018-04-11 09:58:29,117 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 09:58:29,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 09:58:29,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 09:58:29,200 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:113, output treesize:214 [2018-04-11 09:58:29,408 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:58:29,426 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 09:58:29,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 47 [2018-04-11 09:58:29,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-11 09:58:29,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-11 09:58:29,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1992, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 09:58:29,427 INFO L87 Difference]: Start difference. First operand 161 states and 181 transitions. Second operand 48 states. [2018-04-11 09:58:30,375 WARN L151 SmtUtils]: Spent 622ms on a formula simplification. DAG size of input: 119 DAG size of output 52 [2018-04-11 09:58:32,470 WARN L151 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 167 DAG size of output 106 [2018-04-11 09:58:34,311 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 111 DAG size of output 69 [2018-04-11 09:58:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:58:40,201 INFO L93 Difference]: Finished difference Result 385 states and 430 transitions. [2018-04-11 09:58:40,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-11 09:58:40,201 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 41 [2018-04-11 09:58:40,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:58:40,202 INFO L225 Difference]: With dead ends: 385 [2018-04-11 09:58:40,202 INFO L226 Difference]: Without dead ends: 291 [2018-04-11 09:58:40,203 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1822 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=783, Invalid=5537, Unknown=0, NotChecked=0, Total=6320 [2018-04-11 09:58:40,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-04-11 09:58:40,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 197. [2018-04-11 09:58:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-11 09:58:40,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 221 transitions. [2018-04-11 09:58:40,205 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 221 transitions. Word has length 41 [2018-04-11 09:58:40,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:58:40,205 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 221 transitions. [2018-04-11 09:58:40,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-11 09:58:40,205 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 221 transitions. [2018-04-11 09:58:40,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 09:58:40,206 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:58:40,206 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] [2018-04-11 09:58:40,206 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:58:40,206 INFO L82 PathProgramCache]: Analyzing trace with hash -103177675, now seen corresponding path program 1 times [2018-04-11 09:58:40,206 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:58:40,206 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:58:40,206 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:58:40,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 09:58:40,207 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:58:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:58:40,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:58:40,465 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:58:40,465 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 09:58:40,465 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 09:58:40,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:58:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:58:40,487 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 09:58:40,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 6 treesize of output 5 [2018-04-11 09:58:40,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:40,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:58:40,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:40,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:40,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-11 09:58:40,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:40,524 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-11 09:58:40,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:40,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:40,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:40,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 09:58:40,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:40,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:40,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:17 [2018-04-11 09:58:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:58:40,891 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 09:58:40,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2018-04-11 09:58:40,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 09:58:40,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 09:58:40,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 09:58:40,892 INFO L87 Difference]: Start difference. First operand 197 states and 221 transitions. Second operand 36 states. [2018-04-11 09:58:44,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:58:44,141 INFO L93 Difference]: Finished difference Result 238 states and 263 transitions. [2018-04-11 09:58:44,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 09:58:44,142 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2018-04-11 09:58:44,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:58:44,142 INFO L225 Difference]: With dead ends: 238 [2018-04-11 09:58:44,142 INFO L226 Difference]: Without dead ends: 227 [2018-04-11 09:58:44,143 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=443, Invalid=3217, Unknown=0, NotChecked=0, Total=3660 [2018-04-11 09:58:44,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-04-11 09:58:44,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 216. [2018-04-11 09:58:44,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-04-11 09:58:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 241 transitions. [2018-04-11 09:58:44,145 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 241 transitions. Word has length 43 [2018-04-11 09:58:44,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:58:44,145 INFO L459 AbstractCegarLoop]: Abstraction has 216 states and 241 transitions. [2018-04-11 09:58:44,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 09:58:44,145 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 241 transitions. [2018-04-11 09:58:44,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 09:58:44,145 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:58:44,145 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:58:44,145 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:58:44,145 INFO L82 PathProgramCache]: Analyzing trace with hash -103186711, now seen corresponding path program 1 times [2018-04-11 09:58:44,146 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:58:44,146 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:58:44,146 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:58:44,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:58:44,146 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:58:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:58:44,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:58:44,369 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-11 09:58:44,369 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 09:58:44,369 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 09:58:44,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:58:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:58:44,394 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 09:58:44,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:58:44,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:44,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:58:44,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:44,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:44,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-04-11 09:58:44,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:44,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:44,457 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-11 09:58:44,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:44,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:44,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:44,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 09:58:44,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:44,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:44,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-11 09:58:44,748 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-11 09:58:44,766 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 09:58:44,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-04-11 09:58:44,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 09:58:44,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 09:58:44,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1214, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 09:58:44,767 INFO L87 Difference]: Start difference. First operand 216 states and 241 transitions. Second operand 37 states. [2018-04-11 09:58:45,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:58:45,695 INFO L93 Difference]: Finished difference Result 229 states and 253 transitions. [2018-04-11 09:58:45,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 09:58:45,695 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 43 [2018-04-11 09:58:45,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:58:45,696 INFO L225 Difference]: With dead ends: 229 [2018-04-11 09:58:45,696 INFO L226 Difference]: Without dead ends: 197 [2018-04-11 09:58:45,697 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=388, Invalid=2918, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 09:58:45,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-11 09:58:45,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-04-11 09:58:45,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-11 09:58:45,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 220 transitions. [2018-04-11 09:58:45,699 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 220 transitions. Word has length 43 [2018-04-11 09:58:45,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:58:45,700 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 220 transitions. [2018-04-11 09:58:45,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 09:58:45,700 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 220 transitions. [2018-04-11 09:58:45,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 09:58:45,700 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:58:45,700 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-11 09:58:45,701 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:58:45,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1997049526, now seen corresponding path program 2 times [2018-04-11 09:58:45,701 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:58:45,701 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:58:45,702 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:58:45,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 09:58:45,702 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:58:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:58:45,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:58:46,172 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:58:46,172 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 09:58:46,172 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 09:58:46,177 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 09:58:46,193 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 09:58:46,193 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 09:58:46,195 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 09:58:46,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:58:46,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:46,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:58:46,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:46,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:46,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-04-11 09:58:46,288 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:46,288 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:46,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 09:58:46,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:46,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:46,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:46,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 09:58:46,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:46,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:46,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-04-11 09:58:46,355 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-11 09:58:46,356 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-11 09:58:46,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:46,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:46,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:46,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-04-11 09:58:46,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:46,395 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-11 09:58:46,396 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-11 09:58:46,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:46,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:46,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 09:58:46,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-04-11 09:58:46,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:46,576 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-11 09:58:46,577 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-11 09:58:46,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:46,584 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-11 09:58:46,584 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 09:58:46,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 09:58:46,592 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-11 09:58:46,592 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:49, output treesize:47 [2018-04-11 09:58:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:58:46,953 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 09:58:46,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-04-11 09:58:46,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-11 09:58:46,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-11 09:58:46,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 09:58:46,954 INFO L87 Difference]: Start difference. First operand 197 states and 220 transitions. Second operand 42 states. [2018-04-11 09:58:48,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:58:48,762 INFO L93 Difference]: Finished difference Result 251 states and 276 transitions. [2018-04-11 09:58:48,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 09:58:48,762 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 46 [2018-04-11 09:58:48,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:58:48,763 INFO L225 Difference]: With dead ends: 251 [2018-04-11 09:58:48,763 INFO L226 Difference]: Without dead ends: 243 [2018-04-11 09:58:48,764 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=344, Invalid=3562, Unknown=0, NotChecked=0, Total=3906 [2018-04-11 09:58:48,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-11 09:58:48,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 223. [2018-04-11 09:58:48,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-04-11 09:58:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 247 transitions. [2018-04-11 09:58:48,766 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 247 transitions. Word has length 46 [2018-04-11 09:58:48,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:58:48,766 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 247 transitions. [2018-04-11 09:58:48,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-11 09:58:48,767 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 247 transitions. [2018-04-11 09:58:48,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 09:58:48,767 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:58:48,767 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:58:48,767 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:58:48,767 INFO L82 PathProgramCache]: Analyzing trace with hash 782026389, now seen corresponding path program 3 times [2018-04-11 09:58:48,767 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:58:48,767 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:58:48,768 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:58:48,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 09:58:48,768 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:58:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:58:48,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:58:49,008 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-04-11 09:58:49,008 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 09:58:49,008 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 09:58:49,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 09:58:49,041 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 09:58:49,041 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 09:58:49,044 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 09:58:49,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:58:49,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:49,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:58:49,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:49,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:49,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 09:58:49,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:49,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:49,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 09:58:49,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:49,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 09:58:49,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:49,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:49,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 09:58:49,099 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-11 09:58:49,100 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-11 09:58:49,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:49,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:49,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:49,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-04-11 09:58:49,128 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-11 09:58:49,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 09:58:49,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:49,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:49,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 09:58:49,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2018-04-11 09:58:49,227 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-11 09:58:49,229 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-11 09:58:49,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:49,237 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-11 09:58:49,237 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 09:58:49,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 09:58:49,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 09:58:49,244 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:15 [2018-04-11 09:58:49,359 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-11 09:58:49,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 09:58:49,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2018-04-11 09:58:49,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 09:58:49,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 09:58:49,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2018-04-11 09:58:49,380 INFO L87 Difference]: Start difference. First operand 223 states and 247 transitions. Second operand 26 states. [2018-04-11 09:58:53,609 WARN L148 SmtUtils]: Spent 4013ms on a formula simplification that was a NOOP. DAG size: 36 [2018-04-11 09:58:55,778 WARN L151 SmtUtils]: Spent 2152ms on a formula simplification. DAG size of input: 48 DAG size of output 46 [2018-04-11 09:58:56,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:58:56,117 INFO L93 Difference]: Finished difference Result 235 states and 257 transitions. [2018-04-11 09:58:56,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 09:58:56,118 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2018-04-11 09:58:56,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:58:56,118 INFO L225 Difference]: With dead ends: 235 [2018-04-11 09:58:56,118 INFO L226 Difference]: Without dead ends: 204 [2018-04-11 09:58:56,119 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=226, Invalid=1334, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 09:58:56,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-11 09:58:56,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 126. [2018-04-11 09:58:56,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-11 09:58:56,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-04-11 09:58:56,120 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 49 [2018-04-11 09:58:56,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:58:56,120 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-04-11 09:58:56,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 09:58:56,120 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-04-11 09:58:56,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 09:58:56,121 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:58:56,121 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:58:56,121 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:58:56,121 INFO L82 PathProgramCache]: Analyzing trace with hash 782017353, now seen corresponding path program 2 times [2018-04-11 09:58:56,121 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:58:56,121 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:58:56,121 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:58:56,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 09:58:56,121 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:58:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:58:56,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:58:56,546 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:58:56,547 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 09:58:56,547 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 09:58:56,551 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 09:58:56,568 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 09:58:56,568 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 09:58:56,570 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 09:58:56,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 6 treesize of output 5 [2018-04-11 09:58:56,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:56,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:58:56,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:56,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:56,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-04-11 09:58:56,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:56,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:56,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 09:58:56,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:56,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:56,628 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-11 09:58:56,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:56,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:56,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-11 09:58:56,970 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:58:56,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 09:58:56,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 42 [2018-04-11 09:58:56,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-11 09:58:56,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-11 09:58:56,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1644, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 09:58:56,990 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 43 states. [2018-04-11 09:58:58,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:58:58,139 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2018-04-11 09:58:58,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 09:58:58,140 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 49 [2018-04-11 09:58:58,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:58:58,140 INFO L225 Difference]: With dead ends: 166 [2018-04-11 09:58:58,140 INFO L226 Difference]: Without dead ends: 119 [2018-04-11 09:58:58,141 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1405 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=492, Invalid=4064, Unknown=0, NotChecked=0, Total=4556 [2018-04-11 09:58:58,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-04-11 09:58:58,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-04-11 09:58:58,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-04-11 09:58:58,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2018-04-11 09:58:58,142 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 49 [2018-04-11 09:58:58,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:58:58,142 INFO L459 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2018-04-11 09:58:58,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-11 09:58:58,142 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2018-04-11 09:58:58,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 09:58:58,142 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:58:58,142 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:58:58,142 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:58:58,143 INFO L82 PathProgramCache]: Analyzing trace with hash 2012113674, now seen corresponding path program 3 times [2018-04-11 09:58:58,143 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:58:58,143 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:58:58,143 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:58:58,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 09:58:58,143 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:58:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:58:58,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:58:58,661 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 5 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:58:58,661 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 09:58:58,661 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 09:58:58,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 09:58:58,693 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-04-11 09:58:58,693 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 09:58:58,696 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 09:58:58,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:58:58,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:58,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 6 treesize of output 5 [2018-04-11 09:58:58,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:58,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:58,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-04-11 09:58:58,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:58,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:58,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 09:58:58,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:58,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:58,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 09:58:58,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:58,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:58,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-11 09:58:58,816 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-11 09:58:58,817 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-11 09:58:58,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:58,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:58,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:58,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-04-11 09:58:58,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:58,849 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-11 09:58:58,850 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-11 09:58:58,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:58,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:58,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:58:58,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-04-11 09:58:59,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:58:59,037 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-11 09:58:59,039 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-11 09:58:59,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:58:59,046 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-11 09:58:59,047 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 09:58:59,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 09:58:59,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 09:58:59,059 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:61, output treesize:63 [2018-04-11 09:58:59,709 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:58:59,727 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 09:58:59,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 48 [2018-04-11 09:58:59,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-11 09:58:59,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-11 09:58:59,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2187, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 09:58:59,728 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand 49 states. [2018-04-11 09:59:01,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:59:01,880 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2018-04-11 09:59:01,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 09:59:01,880 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 52 [2018-04-11 09:59:01,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:59:01,881 INFO L225 Difference]: With dead ends: 152 [2018-04-11 09:59:01,881 INFO L226 Difference]: Without dead ends: 124 [2018-04-11 09:59:01,881 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=454, Invalid=4948, Unknown=0, NotChecked=0, Total=5402 [2018-04-11 09:59:01,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-11 09:59:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 119. [2018-04-11 09:59:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-04-11 09:59:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2018-04-11 09:59:01,883 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 52 [2018-04-11 09:59:01,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:59:01,883 INFO L459 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2018-04-11 09:59:01,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-11 09:59:01,883 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2018-04-11 09:59:01,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 09:59:01,884 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:59:01,884 INFO L355 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:59:01,884 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:59:01,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1208137277, now seen corresponding path program 5 times [2018-04-11 09:59:01,884 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:59:01,885 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:59:01,885 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:59:01,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 09:59:01,885 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:59:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:59:01,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:59:03,976 WARN L151 SmtUtils]: Spent 433ms on a formula simplification. DAG size of input: 166 DAG size of output 102 [2018-04-11 09:59:04,396 WARN L151 SmtUtils]: Spent 393ms on a formula simplification. DAG size of input: 145 DAG size of output 84 [2018-04-11 09:59:04,861 WARN L151 SmtUtils]: Spent 432ms on a formula simplification. DAG size of input: 145 DAG size of output 84 [2018-04-11 09:59:05,290 WARN L151 SmtUtils]: Spent 396ms on a formula simplification. DAG size of input: 148 DAG size of output 87 [2018-04-11 09:59:05,730 WARN L151 SmtUtils]: Spent 405ms on a formula simplification. DAG size of input: 165 DAG size of output 93 [2018-04-11 09:59:06,186 WARN L151 SmtUtils]: Spent 413ms on a formula simplification. DAG size of input: 168 DAG size of output 96 [2018-04-11 09:59:06,524 WARN L151 SmtUtils]: Spent 303ms on a formula simplification. DAG size of input: 129 DAG size of output 83 [2018-04-11 09:59:06,862 WARN L151 SmtUtils]: Spent 299ms on a formula simplification. DAG size of input: 132 DAG size of output 86 [2018-04-11 09:59:07,092 WARN L151 SmtUtils]: Spent 199ms on a formula simplification. DAG size of input: 106 DAG size of output 73 [2018-04-11 09:59:07,368 WARN L151 SmtUtils]: Spent 231ms on a formula simplification. DAG size of input: 109 DAG size of output 76 [2018-04-11 09:59:07,522 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 86 DAG size of output 64 [2018-04-11 09:59:07,694 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 89 DAG size of output 67 [2018-04-11 09:59:07,944 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 71 DAG size of output 58 [2018-04-11 09:59:08,355 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:59:08,355 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 09:59:08,355 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 09:59:08,360 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 09:59:08,384 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-11 09:59:08,384 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 09:59:08,386 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 09:59:08,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:59:08,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:08,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:59:08,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:08,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:59:08,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-11 09:59:08,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:08,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:08,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 09:59:08,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:08,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:08,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:08,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 09:59:08,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:08,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:59:08,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-11 09:59:08,622 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-11 09:59:08,623 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-11 09:59:08,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:08,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:59:08,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 09:59:08,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-04-11 09:59:08,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:08,682 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-11 09:59:08,683 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-11 09:59:08,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:08,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:59:08,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 09:59:08,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:48 [2018-04-11 09:59:10,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,509 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 125 treesize of output 105 [2018-04-11 09:59:10,510 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-11 09:59:10,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:10,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:10,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 63 disjoint index pairs (out of 55 index pairs), introduced 9 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 521 [2018-04-11 09:59:10,590 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 09:59:10,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 09:59:11,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 09:59:11,226 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:153, output treesize:310 [2018-04-11 09:59:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:59:11,547 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 09:59:11,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33] total 63 [2018-04-11 09:59:11,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-11 09:59:11,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-11 09:59:11,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=3466, Unknown=0, NotChecked=0, Total=4032 [2018-04-11 09:59:11,548 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 64 states. [2018-04-11 09:59:14,121 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 161 DAG size of output 154 [2018-04-11 09:59:15,950 WARN L151 SmtUtils]: Spent 349ms on a formula simplification. DAG size of input: 244 DAG size of output 220 [2018-04-11 09:59:16,229 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 158 DAG size of output 154 [2018-04-11 09:59:16,685 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 153 DAG size of output 146 [2018-04-11 09:59:16,957 WARN L151 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 156 DAG size of output 153 [2018-04-11 09:59:17,443 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 140 DAG size of output 137 [2018-04-11 09:59:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:59:19,302 INFO L93 Difference]: Finished difference Result 265 states and 283 transitions. [2018-04-11 09:59:19,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-11 09:59:19,302 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 53 [2018-04-11 09:59:19,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:59:19,303 INFO L225 Difference]: With dead ends: 265 [2018-04-11 09:59:19,303 INFO L226 Difference]: Without dead ends: 265 [2018-04-11 09:59:19,304 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4074 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=1649, Invalid=10783, Unknown=0, NotChecked=0, Total=12432 [2018-04-11 09:59:19,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-04-11 09:59:19,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 167. [2018-04-11 09:59:19,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-04-11 09:59:19,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 184 transitions. [2018-04-11 09:59:19,307 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 184 transitions. Word has length 53 [2018-04-11 09:59:19,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:59:19,307 INFO L459 AbstractCegarLoop]: Abstraction has 167 states and 184 transitions. [2018-04-11 09:59:19,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-11 09:59:19,308 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 184 transitions. [2018-04-11 09:59:19,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 09:59:19,308 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:59:19,308 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:59:19,308 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:59:19,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1144324183, now seen corresponding path program 4 times [2018-04-11 09:59:19,309 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:59:19,309 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:59:19,309 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:59:19,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 09:59:19,309 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:59:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:59:19,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:59:20,169 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 5 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:59:20,169 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 09:59:20,169 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 09:59:20,174 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 09:59:20,192 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 09:59:20,192 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 09:59:20,195 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 09:59:20,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:59:20,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:20,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:59:20,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:20,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:59:20,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-04-11 09:59:20,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:20,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:20,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 09:59:20,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:20,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:20,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:20,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 09:59:20,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:20,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:59:20,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-04-11 09:59:20,320 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-11 09:59:20,322 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-11 09:59:20,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:20,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:59:20,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:59:20,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-04-11 09:59:20,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:20,358 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-11 09:59:20,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 13 treesize of output 12 [2018-04-11 09:59:20,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:20,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:59:20,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 09:59:20,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-04-11 09:59:20,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:20,661 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 45 treesize of output 41 [2018-04-11 09:59:20,662 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-11 09:59:20,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:20,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:20,672 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 27 treesize of output 41 [2018-04-11 09:59:20,672 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 09:59:20,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 09:59:20,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 09:59:20,701 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:99 [2018-04-11 09:59:21,423 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:59:21,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 09:59:21,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 53 [2018-04-11 09:59:21,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-11 09:59:21,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-11 09:59:21,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2662, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 09:59:21,441 INFO L87 Difference]: Start difference. First operand 167 states and 184 transitions. Second operand 54 states. [2018-04-11 09:59:24,009 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 68 DAG size of output 63 [2018-04-11 09:59:24,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:59:24,424 INFO L93 Difference]: Finished difference Result 217 states and 234 transitions. [2018-04-11 09:59:24,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-11 09:59:24,424 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 55 [2018-04-11 09:59:24,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:59:24,425 INFO L225 Difference]: With dead ends: 217 [2018-04-11 09:59:24,425 INFO L226 Difference]: Without dead ends: 172 [2018-04-11 09:59:24,425 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2570 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=708, Invalid=7124, Unknown=0, NotChecked=0, Total=7832 [2018-04-11 09:59:24,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-11 09:59:24,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 167. [2018-04-11 09:59:24,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-04-11 09:59:24,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 181 transitions. [2018-04-11 09:59:24,428 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 181 transitions. Word has length 55 [2018-04-11 09:59:24,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:59:24,428 INFO L459 AbstractCegarLoop]: Abstraction has 167 states and 181 transitions. [2018-04-11 09:59:24,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-11 09:59:24,428 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 181 transitions. [2018-04-11 09:59:24,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 09:59:24,429 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:59:24,429 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 8, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:59:24,429 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:59:24,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1153548874, now seen corresponding path program 5 times [2018-04-11 09:59:24,429 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:59:24,429 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:59:24,430 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:59:24,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 09:59:24,430 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:59:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:59:24,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:59:25,056 WARN L151 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 133 DAG size of output 91 [2018-04-11 09:59:25,180 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 131 DAG size of output 89 [2018-04-11 09:59:26,298 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:59:26,298 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 09:59:26,298 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 09:59:26,305 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 09:59:26,336 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-04-11 09:59:26,336 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 09:59:26,339 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 09:59:26,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:59:26,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:26,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:59:26,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:26,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:59:26,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-04-11 09:59:26,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:26,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:26,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 09:59:26,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:26,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:26,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:26,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 09:59:26,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:26,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:59:26,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-11 09:59:26,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-04-11 09:59:26,472 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-11 09:59:26,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:26,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:59:26,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:59:26,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-04-11 09:59:26,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:26,515 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-11 09:59:26,517 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-11 09:59:26,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:26,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:59:26,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:59:26,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-04-11 09:59:27,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:27,261 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 66 treesize of output 56 [2018-04-11 09:59:27,263 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-11 09:59:27,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:27,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:27,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:27,274 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:27,274 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:27,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 92 [2018-04-11 09:59:27,285 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 09:59:27,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 09:59:27,336 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-11 09:59:27,336 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:87, output treesize:141 [2018-04-11 09:59:28,212 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:59:28,232 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 09:59:28,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32] total 62 [2018-04-11 09:59:28,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-11 09:59:28,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-11 09:59:28,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3660, Unknown=0, NotChecked=0, Total=3906 [2018-04-11 09:59:28,233 INFO L87 Difference]: Start difference. First operand 167 states and 181 transitions. Second operand 63 states. [2018-04-11 09:59:29,248 WARN L151 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 150 DAG size of output 143 [2018-04-11 09:59:29,568 WARN L151 SmtUtils]: Spent 217ms on a formula simplification. DAG size of input: 152 DAG size of output 144 [2018-04-11 09:59:29,779 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 147 DAG size of output 139 [2018-04-11 09:59:29,972 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 154 DAG size of output 143 [2018-04-11 09:59:30,201 WARN L151 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 144 DAG size of output 133 [2018-04-11 09:59:30,416 WARN L151 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 151 DAG size of output 137 [2018-04-11 09:59:30,637 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 137 DAG size of output 126 [2018-04-11 09:59:30,848 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 144 DAG size of output 130 [2018-04-11 09:59:31,054 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 132 DAG size of output 124 [2018-04-11 09:59:31,271 WARN L151 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 139 DAG size of output 128 [2018-04-11 09:59:31,486 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 125 DAG size of output 120 [2018-04-11 09:59:31,720 WARN L151 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 151 DAG size of output 131 [2018-04-11 09:59:31,953 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 110 DAG size of output 102 [2018-04-11 09:59:32,162 WARN L151 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 113 DAG size of output 104 [2018-04-11 09:59:32,689 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 113 DAG size of output 105 [2018-04-11 09:59:33,324 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 108 DAG size of output 102 [2018-04-11 09:59:33,478 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 102 DAG size of output 101 [2018-04-11 09:59:33,775 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 136 DAG size of output 129 [2018-04-11 09:59:33,988 WARN L151 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 145 DAG size of output 138 [2018-04-11 09:59:34,229 WARN L151 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 152 DAG size of output 126 [2018-04-11 09:59:34,429 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 129 DAG size of output 121 [2018-04-11 09:59:34,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 09:59:34,858 INFO L93 Difference]: Finished difference Result 200 states and 214 transitions. [2018-04-11 09:59:34,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-11 09:59:34,858 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 64 [2018-04-11 09:59:34,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 09:59:34,858 INFO L225 Difference]: With dead ends: 200 [2018-04-11 09:59:34,859 INFO L226 Difference]: Without dead ends: 200 [2018-04-11 09:59:34,859 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3101 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=765, Invalid=9135, Unknown=0, NotChecked=0, Total=9900 [2018-04-11 09:59:34,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-04-11 09:59:34,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 181. [2018-04-11 09:59:34,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-11 09:59:34,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 195 transitions. [2018-04-11 09:59:34,861 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 195 transitions. Word has length 64 [2018-04-11 09:59:34,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 09:59:34,861 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 195 transitions. [2018-04-11 09:59:34,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-11 09:59:34,861 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 195 transitions. [2018-04-11 09:59:34,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-11 09:59:34,861 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 09:59:34,862 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 9, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 09:59:34,862 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 09:59:34,862 INFO L82 PathProgramCache]: Analyzing trace with hash -2118033303, now seen corresponding path program 6 times [2018-04-11 09:59:34,862 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 09:59:34,862 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 09:59:34,862 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:59:34,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 09:59:34,862 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 09:59:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 09:59:34,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 09:59:35,713 WARN L151 SmtUtils]: Spent 242ms on a formula simplification. DAG size of input: 132 DAG size of output 98 [2018-04-11 09:59:36,036 WARN L151 SmtUtils]: Spent 305ms on a formula simplification. DAG size of input: 128 DAG size of output 94 [2018-04-11 09:59:36,325 WARN L151 SmtUtils]: Spent 271ms on a formula simplification. DAG size of input: 113 DAG size of output 80 [2018-04-11 09:59:36,591 WARN L151 SmtUtils]: Spent 246ms on a formula simplification. DAG size of input: 113 DAG size of output 80 [2018-04-11 09:59:36,903 WARN L151 SmtUtils]: Spent 264ms on a formula simplification. DAG size of input: 114 DAG size of output 81 [2018-04-11 09:59:37,082 WARN L151 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 100 DAG size of output 78 [2018-04-11 09:59:37,267 WARN L151 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 103 DAG size of output 81 [2018-04-11 09:59:37,448 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 81 DAG size of output 68 [2018-04-11 09:59:37,635 WARN L151 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 84 DAG size of output 71 [2018-04-11 09:59:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 09:59:38,440 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 09:59:38,440 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 09:59:38,446 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 09:59:38,551 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-04-11 09:59:38,551 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 09:59:38,556 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 09:59:38,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:59:38,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:38,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 09:59:38,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:38,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:59:38,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-04-11 09:59:38,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:38,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:38,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 09:59:38,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:38,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:38,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 09:59:38,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:38,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:59:38,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-11 09:59:38,749 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-11 09:59:38,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 09:59:38,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:38,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:59:38,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:59:38,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-04-11 09:59:38,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:38,795 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-11 09:59:38,797 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-11 09:59:38,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 09:59:38,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:59:38,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 09:59:38,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-04-11 09:59:42,029 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 09:59:42,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 74 [2018-04-11 09:59:42,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 29 case distinctions, treesize of input 58 treesize of output 317 [2018-04-11 09:59:42,234 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 22 Received shutdown request... [2018-04-11 09:59:56,855 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 09:59:56,855 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 09:59:56,858 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 09:59:56,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 09:59:56 BoogieIcfgContainer [2018-04-11 09:59:56,858 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 09:59:56,858 INFO L168 Benchmark]: Toolchain (without parser) took 177773.75 ms. Allocated memory was 402.1 MB in the beginning and 2.9 GB in the end (delta: 2.5 GB). Free memory was 336.4 MB in the beginning and 1.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-04-11 09:59:56,859 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 402.1 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 09:59:56,859 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.09 ms. Allocated memory is still 402.1 MB. Free memory was 334.5 MB in the beginning and 310.6 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-04-11 09:59:56,859 INFO L168 Benchmark]: Boogie Preprocessor took 31.53 ms. Allocated memory is still 402.1 MB. Free memory was 310.6 MB in the beginning and 308.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 09:59:56,860 INFO L168 Benchmark]: RCFGBuilder took 375.15 ms. Allocated memory was 402.1 MB in the beginning and 570.4 MB in the end (delta: 168.3 MB). Free memory was 308.0 MB in the beginning and 504.5 MB in the end (delta: -196.5 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. [2018-04-11 09:59:56,860 INFO L168 Benchmark]: TraceAbstraction took 177124.80 ms. Allocated memory was 570.4 MB in the beginning and 2.9 GB in the end (delta: 2.3 GB). Free memory was 504.5 MB in the beginning and 1.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-04-11 09:59:56,860 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 402.1 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 240.09 ms. Allocated memory is still 402.1 MB. Free memory was 334.5 MB in the beginning and 310.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 31.53 ms. Allocated memory is still 402.1 MB. Free memory was 310.6 MB in the beginning and 308.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 375.15 ms. Allocated memory was 402.1 MB in the beginning and 570.4 MB in the end (delta: 168.3 MB). Free memory was 308.0 MB in the beginning and 504.5 MB in the end (delta: -196.5 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 177124.80 ms. Allocated memory was 570.4 MB in the beginning and 2.9 GB in the end (delta: 2.3 GB). Free memory was 504.5 MB in the beginning and 1.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 570]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 68 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 22 conjuction. - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 68 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 22 conjuction. - TimeoutResultAtElement [Line: 570]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 68 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 22 conjuction. - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 68 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 22 conjuction. - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 68 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 22 conjuction. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 68 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 22 conjuction. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 68 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 22 conjuction. - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 68 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 22 conjuction. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 68 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 22 conjuction. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 68 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 22 conjuction. - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 68 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 22 conjuction. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 68 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 22 conjuction. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 68 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 22 conjuction. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 68 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 22 conjuction. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 68 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 22 conjuction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 64 locations, 15 error locations. TIMEOUT Result, 177.0s OverallTime, 35 OverallIterations, 12 TraceHistogramMax, 102.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1412 SDtfs, 6296 SDslu, 15187 SDs, 0 SdLazy, 18329 SolverSat, 2089 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 40.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1867 GetRequests, 535 SyntacticMatches, 11 SemanticMatches, 1321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24013 ImplicationChecksByTransitivity, 104.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=279occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 2306 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 50.7s InterpolantComputationTime, 1989 NumberOfCodeBlocks, 1987 NumberOfCodeBlocksAsserted, 94 NumberOfCheckSat, 1934 ConstructedInterpolants, 264 QuantifiedInterpolants, 2122447 SizeOfPredicates, 333 NumberOfNonLiveVariables, 3917 ConjunctsInSsa, 1281 ConjunctsInUnsatCore, 55 InterpolantComputations, 13 PerfectInterpolantSequences, 61/1580 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_09-59-56-865.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_09-59-56-865.csv Completed graceful shutdown