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_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 04:54:16,287 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 04:54:16,289 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 04:54:16,300 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 04:54:16,301 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 04:54:16,301 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 04:54:16,302 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 04:54:16,303 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 04:54:16,305 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 04:54:16,306 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 04:54:16,307 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 04:54:16,307 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 04:54:16,308 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 04:54:16,308 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 04:54:16,309 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 04:54:16,311 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 04:54:16,312 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 04:54:16,314 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 04:54:16,315 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 04:54:16,316 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 04:54:16,317 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 04:54:16,318 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 04:54:16,318 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 04:54:16,319 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 04:54:16,319 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 04:54:16,320 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 04:54:16,320 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 04:54:16,321 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 04:54:16,321 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 04:54:16,321 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 04:54:16,322 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 04:54:16,322 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-13 04:54:16,331 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 04:54:16,331 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 04:54:16,332 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 04:54:16,332 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 04:54:16,332 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 04:54:16,332 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 04:54:16,332 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 04:54:16,333 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 04:54:16,333 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 04:54:16,333 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 04:54:16,333 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 04:54:16,333 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 04:54:16,333 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 04:54:16,333 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 04:54:16,333 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 04:54:16,333 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 04:54:16,333 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 04:54:16,334 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 04:54:16,334 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 04:54:16,334 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 04:54:16,334 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 04:54:16,334 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 04:54:16,334 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 04:54:16,334 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 04:54:16,360 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 04:54:16,368 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 04:54:16,371 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 04:54:16,372 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 04:54:16,372 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 04:54:16,372 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,739 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGa528818dc [2018-04-13 04:54:16,868 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 04:54:16,869 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 04:54:16,869 INFO L168 CDTParser]: Scanning subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,876 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 04:54:16,876 INFO L215 ultiparseSymbolTable]: [2018-04-13 04:54:16,876 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 04:54:16,876 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,877 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,877 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,877 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__ ('') in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,877 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 04:54:16,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____intptr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____ssize_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____timer_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____mode_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__int32_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____u_short in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____socklen_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__key_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__size_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__off_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____int32_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____rlim_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____rlim64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_int in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__register_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_int64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__ldiv_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__ino_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____time_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__int8_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____u_char in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____suseconds_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____caddr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____dev_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____qaddr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__int16_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__lldiv_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__wchar_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____blksize_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__blksize_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__uid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____uint32_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____int8_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_char in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____u_long in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____int16_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__div_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__caddr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__mode_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__fd_set in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____sigset_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__gid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_short in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__ulong in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____fsid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_long in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____ino_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____ino64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____u_quad_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____pid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,882 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,882 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____off_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,882 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,882 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____gid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,882 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__clock_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,882 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____uint16_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,882 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____loff_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,882 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__suseconds_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,882 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,882 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__quad_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,882 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_int16_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,883 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,883 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__daddr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,883 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__fsid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,883 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____key_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,883 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____clockid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,883 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____daddr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,883 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____clock_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,883 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,883 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,883 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____useconds_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,883 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__int64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,883 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____quad_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_quad_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__ushort in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____uint8_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____off64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__loff_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____int64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_int32_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____id_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____fd_mask in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____u_int in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_int8_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__time_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____nlink_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__clockid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__timer_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__dev_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__sigset_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__id_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____uint64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__fd_mask in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____fsword_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__ssize_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____uid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__nlink_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__uint in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:16,898 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGa528818dc [2018-04-13 04:54:16,902 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 04:54:16,903 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 04:54:16,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 04:54:16,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 04:54:16,909 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 04:54:16,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:54:16" (1/1) ... [2018-04-13 04:54:16,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@774c60ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:16, skipping insertion in model container [2018-04-13 04:54:16,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:54:16" (1/1) ... [2018-04-13 04:54:16,928 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 04:54:16,950 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 04:54:17,071 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 04:54:17,106 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 04:54:17,111 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-13 04:54:17,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:17 WrapperNode [2018-04-13 04:54:17,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 04:54:17,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 04:54:17,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 04:54:17,137 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 04:54:17,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:17" (1/1) ... [2018-04-13 04:54:17,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:17" (1/1) ... [2018-04-13 04:54:17,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:17" (1/1) ... [2018-04-13 04:54:17,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:17" (1/1) ... [2018-04-13 04:54:17,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:17" (1/1) ... [2018-04-13 04:54:17,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:17" (1/1) ... [2018-04-13 04:54:17,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:17" (1/1) ... [2018-04-13 04:54:17,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 04:54:17,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 04:54:17,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 04:54:17,174 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 04:54:17,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:17" (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-13 04:54:17,265 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 04:54:17,265 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 04:54:17,265 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 04:54:17,265 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 04:54:17,265 INFO L136 BoogieDeclarations]: Found implementation of procedure subseq [2018-04-13 04:54:17,265 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 04:54:17,265 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 04:54:17,265 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 04:54:17,265 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 04:54:17,266 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 04:54:17,266 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 04:54:17,266 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 04:54:17,266 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 04:54:17,266 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 04:54:17,266 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 04:54:17,266 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 04:54:17,266 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 04:54:17,266 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 04:54:17,266 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 04:54:17,266 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 04:54:17,267 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 04:54:17,267 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 04:54:17,267 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 04:54:17,267 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 04:54:17,267 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 04:54:17,267 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 04:54:17,267 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 04:54:17,267 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 04:54:17,268 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 04:54:17,268 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 04:54:17,268 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 04:54:17,268 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 04:54:17,268 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 04:54:17,268 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 04:54:17,268 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 04:54:17,268 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 04:54:17,268 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 04:54:17,269 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 04:54:17,269 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 04:54:17,269 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 04:54:17,269 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 04:54:17,269 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 04:54:17,269 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 04:54:17,269 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 04:54:17,269 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 04:54:17,269 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 04:54:17,270 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 04:54:17,270 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 04:54:17,270 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 04:54:17,270 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 04:54:17,270 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 04:54:17,270 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 04:54:17,270 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 04:54:17,270 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 04:54:17,270 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 04:54:17,271 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 04:54:17,271 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 04:54:17,271 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 04:54:17,271 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 04:54:17,271 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 04:54:17,271 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 04:54:17,271 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 04:54:17,271 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 04:54:17,271 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 04:54:17,271 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 04:54:17,272 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 04:54:17,272 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 04:54:17,272 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 04:54:17,272 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 04:54:17,272 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 04:54:17,272 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 04:54:17,272 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 04:54:17,272 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 04:54:17,272 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 04:54:17,272 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 04:54:17,272 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 04:54:17,273 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 04:54:17,273 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 04:54:17,273 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 04:54:17,273 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 04:54:17,273 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 04:54:17,273 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 04:54:17,273 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 04:54:17,273 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 04:54:17,273 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 04:54:17,273 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 04:54:17,274 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 04:54:17,274 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 04:54:17,274 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 04:54:17,274 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 04:54:17,274 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 04:54:17,274 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 04:54:17,274 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 04:54:17,274 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 04:54:17,274 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 04:54:17,274 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 04:54:17,274 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 04:54:17,275 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 04:54:17,275 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 04:54:17,275 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 04:54:17,275 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 04:54:17,275 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 04:54:17,275 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 04:54:17,275 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 04:54:17,275 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 04:54:17,275 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 04:54:17,275 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 04:54:17,275 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 04:54:17,276 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 04:54:17,276 INFO L128 BoogieDeclarations]: Found specification of procedure subseq [2018-04-13 04:54:17,276 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 04:54:17,276 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 04:54:17,276 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 04:54:17,276 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 04:54:17,276 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 04:54:17,276 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 04:54:17,277 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 04:54:17,277 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 04:54:17,539 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 04:54:17,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:54:17 BoogieIcfgContainer [2018-04-13 04:54:17,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 04:54:17,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 04:54:17,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 04:54:17,542 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 04:54:17,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 04:54:16" (1/3) ... [2018-04-13 04:54:17,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e7974f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:54:17, skipping insertion in model container [2018-04-13 04:54:17,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:17" (2/3) ... [2018-04-13 04:54:17,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e7974f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:54:17, skipping insertion in model container [2018-04-13 04:54:17,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:54:17" (3/3) ... [2018-04-13 04:54:17,545 INFO L107 eAbstractionObserver]: Analyzing ICFG subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:17,553 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 04:54:17,559 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-04-13 04:54:17,588 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 04:54:17,589 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 04:54:17,589 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 04:54:17,589 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 04:54:17,589 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 04:54:17,589 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 04:54:17,589 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 04:54:17,589 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 04:54:17,589 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 04:54:17,590 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 04:54:17,597 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-04-13 04:54:17,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 04:54:17,603 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:54:17,603 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:54:17,603 INFO L408 AbstractCegarLoop]: === Iteration 1 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:54:17,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1220202854, now seen corresponding path program 1 times [2018-04-13 04:54:17,607 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:54:17,607 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:54:17,636 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:17,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:17,636 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:17,681 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:54:17,694 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:54:17,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:54:17,694 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:54:17,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:17,729 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:54:17,758 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-13 04:54:17,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:17,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:17,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 04:54:17,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 04:54:17,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:17,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:54:17,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-13 04:54:17,792 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-13 04:54:17,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:54:17,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 04:54:17,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 04:54:17,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 04:54:17,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 04:54:17,804 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2018-04-13 04:54:17,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:54:17,871 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-04-13 04:54:17,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 04:54:17,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-13 04:54:17,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:54:17,877 INFO L225 Difference]: With dead ends: 54 [2018-04-13 04:54:17,877 INFO L226 Difference]: Without dead ends: 51 [2018-04-13 04:54:17,878 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:54:17,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-13 04:54:17,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-13 04:54:17,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-13 04:54:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-04-13 04:54:17,906 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-04-13 04:54:17,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:54:17,906 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-04-13 04:54:17,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 04:54:17,906 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-04-13 04:54:17,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 04:54:17,907 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:54:17,907 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:54:17,907 INFO L408 AbstractCegarLoop]: === Iteration 2 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:54:17,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1220202855, now seen corresponding path program 1 times [2018-04-13 04:54:17,907 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:54:17,907 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:54:17,908 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:17,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:17,908 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:17,920 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:54:17,926 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:54:17,926 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:54:17,926 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:54:17,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:17,951 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:54:17,979 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-13 04:54:17,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:17,988 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-13 04:54:17,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:17,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:17,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:54:18,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:54:18,013 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-13 04:54:18,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:18,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:54:18,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:54:18,025 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-13 04:54:18,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:18,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:18,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 04:54:18,040 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-13 04:54:18,040 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:54:18,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 04:54:18,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 04:54:18,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 04:54:18,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:54:18,042 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 6 states. [2018-04-13 04:54:18,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:54:18,117 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-04-13 04:54:18,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:54:18,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-13 04:54:18,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:54:18,120 INFO L225 Difference]: With dead ends: 68 [2018-04-13 04:54:18,120 INFO L226 Difference]: Without dead ends: 68 [2018-04-13 04:54:18,121 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-13 04:54:18,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-04-13 04:54:18,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-04-13 04:54:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-13 04:54:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-04-13 04:54:18,130 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 13 [2018-04-13 04:54:18,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:54:18,130 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-04-13 04:54:18,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 04:54:18,130 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-04-13 04:54:18,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 04:54:18,130 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:54:18,131 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:54:18,131 INFO L408 AbstractCegarLoop]: === Iteration 3 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:54:18,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1299757079, now seen corresponding path program 1 times [2018-04-13 04:54:18,131 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:54:18,131 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:54:18,132 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:18,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:18,132 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:18,143 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:54:18,146 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:54:18,146 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:54:18,146 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:54:18,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:18,171 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:54:18,180 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-13 04:54:18,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:18,186 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-13 04:54:18,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:18,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:18,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:54:18,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:54:18,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:54:18,212 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-13 04:54:18,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:18,220 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-13 04:54:18,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:18,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:18,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 04:54:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:54:18,237 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:54:18,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 04:54:18,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 04:54:18,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 04:54:18,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:54:18,238 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 6 states. [2018-04-13 04:54:18,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:54:18,329 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-04-13 04:54:18,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:54:18,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-13 04:54:18,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:54:18,329 INFO L225 Difference]: With dead ends: 56 [2018-04-13 04:54:18,330 INFO L226 Difference]: Without dead ends: 56 [2018-04-13 04:54:18,331 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-13 04:54:18,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-04-13 04:54:18,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2018-04-13 04:54:18,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-13 04:54:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-04-13 04:54:18,335 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 13 [2018-04-13 04:54:18,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:54:18,336 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-04-13 04:54:18,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 04:54:18,336 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-04-13 04:54:18,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 04:54:18,336 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:54:18,336 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:54:18,336 INFO L408 AbstractCegarLoop]: === Iteration 4 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:54:18,336 INFO L82 PathProgramCache]: Analyzing trace with hash -828417196, now seen corresponding path program 1 times [2018-04-13 04:54:18,336 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:54:18,336 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:54:18,337 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:18,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:18,337 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:18,346 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:54:18,364 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-13 04:54:18,365 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:54:18,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 04:54:18,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 04:54:18,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 04:54:18,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 04:54:18,365 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 4 states. [2018-04-13 04:54:18,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:54:18,399 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-04-13 04:54:18,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 04:54:18,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-13 04:54:18,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:54:18,400 INFO L225 Difference]: With dead ends: 49 [2018-04-13 04:54:18,400 INFO L226 Difference]: Without dead ends: 49 [2018-04-13 04:54:18,400 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-13 04:54:18,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-13 04:54:18,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-04-13 04:54:18,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-13 04:54:18,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-04-13 04:54:18,402 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2018-04-13 04:54:18,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:54:18,402 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-04-13 04:54:18,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 04:54:18,402 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-04-13 04:54:18,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 04:54:18,403 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:54:18,403 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:54:18,403 INFO L408 AbstractCegarLoop]: === Iteration 5 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:54:18,403 INFO L82 PathProgramCache]: Analyzing trace with hash -828417195, now seen corresponding path program 1 times [2018-04-13 04:54:18,403 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:54:18,403 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:54:18,403 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:18,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:18,404 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:18,413 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:54:18,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:54:18,446 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:54:18,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 04:54:18,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 04:54:18,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 04:54:18,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:54:18,447 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-04-13 04:54:18,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:54:18,471 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-04-13 04:54:18,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:54:18,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-13 04:54:18,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:54:18,472 INFO L225 Difference]: With dead ends: 48 [2018-04-13 04:54:18,472 INFO L226 Difference]: Without dead ends: 48 [2018-04-13 04:54:18,472 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-13 04:54:18,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-13 04:54:18,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-04-13 04:54:18,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-04-13 04:54:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-04-13 04:54:18,474 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 14 [2018-04-13 04:54:18,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:54:18,474 INFO L459 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-04-13 04:54:18,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 04:54:18,474 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-04-13 04:54:18,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-13 04:54:18,475 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:54:18,475 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:54:18,475 INFO L408 AbstractCegarLoop]: === Iteration 6 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:54:18,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1848934114, now seen corresponding path program 1 times [2018-04-13 04:54:18,475 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:54:18,475 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:54:18,476 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:18,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:18,476 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:18,485 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:54:18,507 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-13 04:54:18,507 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:54:18,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 04:54:18,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 04:54:18,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 04:54:18,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:54:18,508 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 5 states. [2018-04-13 04:54:18,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:54:18,561 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-04-13 04:54:18,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 04:54:18,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-13 04:54:18,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:54:18,562 INFO L225 Difference]: With dead ends: 46 [2018-04-13 04:54:18,562 INFO L226 Difference]: Without dead ends: 46 [2018-04-13 04:54:18,562 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-13 04:54:18,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-04-13 04:54:18,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-04-13 04:54:18,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-04-13 04:54:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-04-13 04:54:18,564 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 18 [2018-04-13 04:54:18,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:54:18,564 INFO L459 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-04-13 04:54:18,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 04:54:18,564 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-04-13 04:54:18,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-13 04:54:18,564 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:54:18,564 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:54:18,564 INFO L408 AbstractCegarLoop]: === Iteration 7 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:54:18,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1848934115, now seen corresponding path program 1 times [2018-04-13 04:54:18,565 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:54:18,565 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:54:18,565 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:18,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:18,565 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:18,573 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:54:18,641 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-13 04:54:18,641 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:54:18,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 04:54:18,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 04:54:18,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 04:54:18,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-13 04:54:18,642 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 8 states. [2018-04-13 04:54:18,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:54:18,718 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-04-13 04:54:18,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 04:54:18,719 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-04-13 04:54:18,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:54:18,720 INFO L225 Difference]: With dead ends: 67 [2018-04-13 04:54:18,720 INFO L226 Difference]: Without dead ends: 67 [2018-04-13 04:54:18,721 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-04-13 04:54:18,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-04-13 04:54:18,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2018-04-13 04:54:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-13 04:54:18,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-04-13 04:54:18,723 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 18 [2018-04-13 04:54:18,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:54:18,723 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2018-04-13 04:54:18,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 04:54:18,723 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-04-13 04:54:18,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-13 04:54:18,723 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:54:18,723 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:54:18,724 INFO L408 AbstractCegarLoop]: === Iteration 8 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:54:18,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1359365041, now seen corresponding path program 1 times [2018-04-13 04:54:18,724 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:54:18,724 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:54:18,724 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:18,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:18,724 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:18,734 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:54:18,753 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-13 04:54:18,754 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:54:18,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 04:54:18,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 04:54:18,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 04:54:18,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:54:18,755 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 5 states. [2018-04-13 04:54:18,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:54:18,800 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2018-04-13 04:54:18,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 04:54:18,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-04-13 04:54:18,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:54:18,801 INFO L225 Difference]: With dead ends: 54 [2018-04-13 04:54:18,801 INFO L226 Difference]: Without dead ends: 54 [2018-04-13 04:54:18,802 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-13 04:54:18,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-13 04:54:18,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-13 04:54:18,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-13 04:54:18,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-04-13 04:54:18,805 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 21 [2018-04-13 04:54:18,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:54:18,805 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-04-13 04:54:18,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 04:54:18,805 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-04-13 04:54:18,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-13 04:54:18,806 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:54:18,806 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:54:18,806 INFO L408 AbstractCegarLoop]: === Iteration 9 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:54:18,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1359365040, now seen corresponding path program 1 times [2018-04-13 04:54:18,806 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:54:18,806 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:54:18,810 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:18,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:18,810 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:18,827 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:54:18,893 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-13 04:54:18,894 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:54:18,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 04:54:18,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 04:54:18,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 04:54:18,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-13 04:54:18,895 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 8 states. [2018-04-13 04:54:18,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:54:18,972 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2018-04-13 04:54:18,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 04:54:18,972 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-04-13 04:54:18,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:54:18,973 INFO L225 Difference]: With dead ends: 70 [2018-04-13 04:54:18,973 INFO L226 Difference]: Without dead ends: 70 [2018-04-13 04:54:18,973 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-13 04:54:18,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-04-13 04:54:18,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2018-04-13 04:54:18,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-13 04:54:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-04-13 04:54:18,976 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 21 [2018-04-13 04:54:18,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:54:18,976 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-04-13 04:54:18,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 04:54:18,976 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-04-13 04:54:18,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-13 04:54:18,977 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:54:18,977 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:54:18,977 INFO L408 AbstractCegarLoop]: === Iteration 10 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:54:18,977 INFO L82 PathProgramCache]: Analyzing trace with hash 613400062, now seen corresponding path program 1 times [2018-04-13 04:54:18,977 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:54:18,977 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:54:18,978 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:18,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:18,978 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:18,986 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:54:19,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:54:19,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:54:19,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 04:54:19,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 04:54:19,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 04:54:19,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 04:54:19,002 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 3 states. [2018-04-13 04:54:19,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:54:19,006 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-04-13 04:54:19,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 04:54:19,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-04-13 04:54:19,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:54:19,007 INFO L225 Difference]: With dead ends: 67 [2018-04-13 04:54:19,007 INFO L226 Difference]: Without dead ends: 67 [2018-04-13 04:54:19,008 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-13 04:54:19,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-04-13 04:54:19,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-04-13 04:54:19,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-04-13 04:54:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2018-04-13 04:54:19,011 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 27 [2018-04-13 04:54:19,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:54:19,011 INFO L459 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2018-04-13 04:54:19,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 04:54:19,011 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2018-04-13 04:54:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 04:54:19,011 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:54:19,011 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:54:19,011 INFO L408 AbstractCegarLoop]: === Iteration 11 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:54:19,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1638706655, now seen corresponding path program 1 times [2018-04-13 04:54:19,012 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:54:19,012 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:54:19,012 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:19,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:19,012 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:19,024 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:54:19,026 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:54:19,027 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:54:19,027 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:54:19,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:19,056 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:54:19,076 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-13 04:54:19,078 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-13 04:54:19,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:19,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:19,085 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-13 04:54:19,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-04-13 04:54:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:54:19,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:54:19,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-13 04:54:19,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 04:54:19,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 04:54:19,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-13 04:54:19,197 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 10 states. [2018-04-13 04:54:19,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:54:19,405 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2018-04-13 04:54:19,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 04:54:19,405 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-04-13 04:54:19,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:54:19,406 INFO L225 Difference]: With dead ends: 93 [2018-04-13 04:54:19,406 INFO L226 Difference]: Without dead ends: 93 [2018-04-13 04:54:19,406 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-04-13 04:54:19,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-04-13 04:54:19,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-04-13 04:54:19,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-13 04:54:19,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2018-04-13 04:54:19,410 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 29 [2018-04-13 04:54:19,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:54:19,410 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2018-04-13 04:54:19,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 04:54:19,411 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2018-04-13 04:54:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 04:54:19,411 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:54:19,411 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:54:19,411 INFO L408 AbstractCegarLoop]: === Iteration 12 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:54:19,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1419851937, now seen corresponding path program 1 times [2018-04-13 04:54:19,412 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:54:19,412 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:54:19,412 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:19,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:19,413 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:19,424 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:54:19,427 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:54:19,427 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:54:19,428 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:54:19,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:19,454 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:54:19,461 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-13 04:54:19,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:19,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:19,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 04:54:19,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:54:19,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:54:19,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-13 04:54:19,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:19,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:19,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-13 04:54:19,514 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 14 treesize of output 11 [2018-04-13 04:54:19,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 11 treesize of output 10 [2018-04-13 04:54:19,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:19,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:19,528 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-13 04:54:19,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-13 04:54:19,549 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 25 treesize of output 26 [2018-04-13 04:54:19,552 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-13 04:54:19,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:19,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:19,563 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-13 04:54:19,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:36 [2018-04-13 04:54:19,943 WARN L148 SmtUtils]: Spent 244ms on a formula simplification that was a NOOP. DAG size: 39 [2018-04-13 04:54:20,000 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 43 treesize of output 37 [2018-04-13 04:54:20,003 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 04:54:20,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-04-13 04:54:20,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:20,026 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 20 treesize of output 12 [2018-04-13 04:54:20,026 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:20,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:20,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:20,040 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:64, output treesize:8 [2018-04-13 04:54:20,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:54:20,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:54:20,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-04-13 04:54:20,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 04:54:20,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 04:54:20,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-04-13 04:54:20,064 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand 17 states. [2018-04-13 04:54:21,094 WARN L151 SmtUtils]: Spent 797ms on a formula simplification. DAG size of input: 57 DAG size of output 57 [2018-04-13 04:54:21,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:54:21,359 INFO L93 Difference]: Finished difference Result 151 states and 172 transitions. [2018-04-13 04:54:21,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 04:54:21,359 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-04-13 04:54:21,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:54:21,359 INFO L225 Difference]: With dead ends: 151 [2018-04-13 04:54:21,360 INFO L226 Difference]: Without dead ends: 151 [2018-04-13 04:54:21,360 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2018-04-13 04:54:21,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-04-13 04:54:21,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 121. [2018-04-13 04:54:21,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-04-13 04:54:21,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 144 transitions. [2018-04-13 04:54:21,365 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 144 transitions. Word has length 29 [2018-04-13 04:54:21,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:54:21,365 INFO L459 AbstractCegarLoop]: Abstraction has 121 states and 144 transitions. [2018-04-13 04:54:21,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 04:54:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 144 transitions. [2018-04-13 04:54:21,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 04:54:21,366 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:54:21,366 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:54:21,366 INFO L408 AbstractCegarLoop]: === Iteration 13 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:54:21,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1069677025, now seen corresponding path program 1 times [2018-04-13 04:54:21,366 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:54:21,367 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:54:21,367 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:21,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:21,367 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:21,377 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:54:21,380 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:54:21,381 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:54:21,381 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:54:21,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:21,403 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:54:21,408 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-13 04:54:21,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:21,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:21,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 04:54:21,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:54:21,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:54:21,422 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-13 04:54:21,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:21,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:21,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-13 04:54:21,436 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 14 treesize of output 11 [2018-04-13 04:54:21,438 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-13 04:54:21,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:21,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:21,447 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-13 04:54:21,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-04-13 04:54:21,463 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 25 treesize of output 26 [2018-04-13 04:54:21,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 11 treesize of output 10 [2018-04-13 04:54:21,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:21,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:21,476 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-13 04:54:21,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:40 [2018-04-13 04:54:22,014 WARN L148 SmtUtils]: Spent 388ms on a formula simplification that was a NOOP. DAG size: 41 [2018-04-13 04:54:22,077 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 43 treesize of output 37 [2018-04-13 04:54:22,083 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 14 treesize of output 11 [2018-04-13 04:54:22,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:54:22,092 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 20 treesize of output 12 [2018-04-13 04:54:22,092 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:22,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:54:22,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:54:22,112 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:68, output treesize:66 [2018-04-13 04:54:22,175 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-13 04:54:22,176 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:54:22,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 04:54:22,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 04:54:22,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 04:54:22,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-04-13 04:54:22,177 INFO L87 Difference]: Start difference. First operand 121 states and 144 transitions. Second operand 17 states. [2018-04-13 04:54:23,210 WARN L151 SmtUtils]: Spent 827ms on a formula simplification. DAG size of input: 61 DAG size of output 61 [2018-04-13 04:54:24,750 WARN L151 SmtUtils]: Spent 733ms on a formula simplification. DAG size of input: 44 DAG size of output 44 [2018-04-13 04:54:25,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:54:25,429 INFO L93 Difference]: Finished difference Result 179 states and 212 transitions. [2018-04-13 04:54:25,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 04:54:25,429 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-04-13 04:54:25,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:54:25,430 INFO L225 Difference]: With dead ends: 179 [2018-04-13 04:54:25,430 INFO L226 Difference]: Without dead ends: 179 [2018-04-13 04:54:25,431 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=168, Invalid=888, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 04:54:25,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-04-13 04:54:25,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 132. [2018-04-13 04:54:25,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-13 04:54:25,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 160 transitions. [2018-04-13 04:54:25,436 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 160 transitions. Word has length 29 [2018-04-13 04:54:25,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:54:25,436 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 160 transitions. [2018-04-13 04:54:25,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 04:54:25,437 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 160 transitions. [2018-04-13 04:54:25,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-13 04:54:25,437 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:54:25,437 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:54:25,437 INFO L408 AbstractCegarLoop]: === Iteration 14 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:54:25,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1886060033, now seen corresponding path program 1 times [2018-04-13 04:54:25,437 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:54:25,437 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:54:25,438 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:25,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:25,438 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:25,446 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:54:25,448 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:54:25,448 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:54:25,448 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:54:25,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:25,464 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:54:25,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:54:25,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-13 04:54:25,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:54:25,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-13 04:54:25,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:25,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:25,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 04:54:25,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-13 04:54:25,516 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc12.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc12.base| 1))) (and (= (select .cse0 |c_main_#t~malloc13.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc13.base| 1) |main_#t~malloc12.base| 0)) (= 0 (select |c_old(#valid)| |main_#t~malloc12.base|))))) is different from true [2018-04-13 04:54:25,520 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc12.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc12.base| 1))) (and (= (select .cse0 |main_#t~malloc13.base|) 0) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc13.base| 1) |main_#t~malloc12.base| 0) |main_#t~malloc13.base| 0)) (= 0 (select |c_old(#valid)| |main_#t~malloc12.base|))))) is different from true [2018-04-13 04:54:25,524 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-13 04:54:25,525 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:54:25,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 04:54:25,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 04:54:25,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 04:54:25,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-13 04:54:25,526 INFO L87 Difference]: Start difference. First operand 132 states and 160 transitions. Second operand 8 states. [2018-04-13 04:54:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:54:25,586 INFO L93 Difference]: Finished difference Result 131 states and 159 transitions. [2018-04-13 04:54:25,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 04:54:25,587 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-04-13 04:54:25,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:54:25,587 INFO L225 Difference]: With dead ends: 131 [2018-04-13 04:54:25,587 INFO L226 Difference]: Without dead ends: 96 [2018-04-13 04:54:25,587 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=30, Unknown=2, NotChecked=22, Total=72 [2018-04-13 04:54:25,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-04-13 04:54:25,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-04-13 04:54:25,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-04-13 04:54:25,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2018-04-13 04:54:25,590 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 31 [2018-04-13 04:54:25,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:54:25,590 INFO L459 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2018-04-13 04:54:25,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 04:54:25,590 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2018-04-13 04:54:25,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 04:54:25,590 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:54:25,591 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:54:25,591 INFO L408 AbstractCegarLoop]: === Iteration 15 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:54:25,591 INFO L82 PathProgramCache]: Analyzing trace with hash -196130602, now seen corresponding path program 1 times [2018-04-13 04:54:25,591 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:54:25,591 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:54:25,591 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:25,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:25,591 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:25,599 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:54:25,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:54:25,712 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:54:25,712 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:54:25,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:25,732 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:54:25,749 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-13 04:54:25,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:25,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:25,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 04:54:25,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:54:25,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:54:25,781 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-13 04:54:25,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:25,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:25,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-13 04:54:25,811 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 14 treesize of output 11 [2018-04-13 04:54:25,813 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-13 04:54:25,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:25,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:25,822 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-13 04:54:25,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-13 04:54:25,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-13 04:54:25,863 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-13 04:54:25,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:25,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:25,874 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-13 04:54:25,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:36 [2018-04-13 04:54:25,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-04-13 04:54:25,951 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 04:54:25,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-04-13 04:54:25,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:25,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-13 04:54:25,958 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:25,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:25,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:25,966 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2018-04-13 04:54:25,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-13 04:54:25,996 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:54:25,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [11] total 23 [2018-04-13 04:54:25,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 04:54:25,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 04:54:25,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-04-13 04:54:25,997 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand 23 states. [2018-04-13 04:54:26,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:54:26,573 INFO L93 Difference]: Finished difference Result 106 states and 124 transitions. [2018-04-13 04:54:26,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 04:54:26,573 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2018-04-13 04:54:26,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:54:26,574 INFO L225 Difference]: With dead ends: 106 [2018-04-13 04:54:26,574 INFO L226 Difference]: Without dead ends: 91 [2018-04-13 04:54:26,574 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=227, Invalid=1579, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 04:54:26,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-04-13 04:54:26,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2018-04-13 04:54:26,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-13 04:54:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2018-04-13 04:54:26,577 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 32 [2018-04-13 04:54:26,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:54:26,577 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2018-04-13 04:54:26,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 04:54:26,577 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2018-04-13 04:54:26,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-13 04:54:26,578 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:54:26,578 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:54:26,578 INFO L408 AbstractCegarLoop]: === Iteration 16 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:54:26,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1917342621, now seen corresponding path program 2 times [2018-04-13 04:54:26,579 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:54:26,579 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:54:26,579 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:26,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:26,580 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:26,590 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:54:26,593 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:54:26,593 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:54:26,593 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:54:26,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:54:26,616 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:54:26,616 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:54:26,620 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:54:26,629 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-13 04:54:26,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:26,635 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-13 04:54:26,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:26,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:26,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:54:26,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:54:26,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:54:26,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-13 04:54:26,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:26,657 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-13 04:54:26,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:26,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:26,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 04:54:26,679 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-13 04:54:26,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:54:26,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:26,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:26,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:26,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:32 [2018-04-13 04:54:26,705 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 29 treesize of output 30 [2018-04-13 04:54:26,707 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-13 04:54:26,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:26,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:26,718 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-13 04:54:26,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:39 [2018-04-13 04:54:28,875 WARN L148 SmtUtils]: Spent 2023ms on a formula simplification that was a NOOP. DAG size: 37 [2018-04-13 04:54:28,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2018-04-13 04:54:28,961 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 44 treesize of output 34 [2018-04-13 04:54:28,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:29,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-04-13 04:54:29,007 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:29,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-04-13 04:54:29,032 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:29,060 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 37 treesize of output 27 [2018-04-13 04:54:29,060 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:29,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2018-04-13 04:54:29,091 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-04-13 04:54:29,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2018-04-13 04:54:29,142 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-04-13 04:54:29,203 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 32 treesize of output 30 [2018-04-13 04:54:29,203 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-13 04:54:29,246 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 27 treesize of output 25 [2018-04-13 04:54:29,246 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-13 04:54:29,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-13 04:54:29,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-13 04:54:29,320 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:63, output treesize:77 [2018-04-13 04:54:29,375 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-13 04:54:29,375 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:54:29,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 04:54:29,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 04:54:29,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 04:54:29,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-04-13 04:54:29,376 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand 19 states. [2018-04-13 04:54:31,780 WARN L151 SmtUtils]: Spent 2065ms on a formula simplification. DAG size of input: 40 DAG size of output 36 [2018-04-13 04:54:35,940 WARN L151 SmtUtils]: Spent 4079ms on a formula simplification. DAG size of input: 53 DAG size of output 49 [2018-04-13 04:54:36,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:54:36,301 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-04-13 04:54:36,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 04:54:36,301 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2018-04-13 04:54:36,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:54:36,302 INFO L225 Difference]: With dead ends: 113 [2018-04-13 04:54:36,302 INFO L226 Difference]: Without dead ends: 113 [2018-04-13 04:54:36,302 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=146, Invalid=910, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 04:54:36,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-04-13 04:54:36,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97. [2018-04-13 04:54:36,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-04-13 04:54:36,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2018-04-13 04:54:36,304 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 40 [2018-04-13 04:54:36,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:54:36,304 INFO L459 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2018-04-13 04:54:36,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 04:54:36,304 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2018-04-13 04:54:36,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-13 04:54:36,304 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:54:36,304 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:54:36,304 INFO L408 AbstractCegarLoop]: === Iteration 17 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:54:36,305 INFO L82 PathProgramCache]: Analyzing trace with hash -783966512, now seen corresponding path program 1 times [2018-04-13 04:54:36,305 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:54:36,305 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:54:36,305 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:36,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:54:36,305 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:36,312 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:54:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:54:36,639 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:54:36,639 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:54:36,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:36,671 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:54:36,676 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-13 04:54:36,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:36,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:36,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 04:54:36,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 04:54:36,720 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-13 04:54:36,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:36,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:36,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:36,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-13 04:54:37,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 43 [2018-04-13 04:54:37,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:54:37,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2018-04-13 04:54:37,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:37,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2018-04-13 04:54:37,199 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:37,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:54:37,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 66 [2018-04-13 04:54:37,232 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 6 xjuncts. [2018-04-13 04:54:37,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 04:54:37,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-13 04:54:37,316 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:239 [2018-04-13 04:54:37,457 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:54:37,457 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:54:37,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 31 [2018-04-13 04:54:37,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-13 04:54:37,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-13 04:54:37,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2018-04-13 04:54:37,459 INFO L87 Difference]: Start difference. First operand 97 states and 115 transitions. Second operand 32 states. [2018-04-13 04:54:38,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:54:38,454 INFO L93 Difference]: Finished difference Result 138 states and 166 transitions. [2018-04-13 04:54:38,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 04:54:38,454 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 43 [2018-04-13 04:54:38,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:54:38,455 INFO L225 Difference]: With dead ends: 138 [2018-04-13 04:54:38,455 INFO L226 Difference]: Without dead ends: 136 [2018-04-13 04:54:38,456 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=328, Invalid=2024, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 04:54:38,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-13 04:54:38,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 129. [2018-04-13 04:54:38,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-13 04:54:38,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2018-04-13 04:54:38,458 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 43 [2018-04-13 04:54:38,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:54:38,458 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2018-04-13 04:54:38,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-13 04:54:38,458 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2018-04-13 04:54:38,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-13 04:54:38,459 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:54:38,459 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:54:38,459 INFO L408 AbstractCegarLoop]: === Iteration 18 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:54:38,459 INFO L82 PathProgramCache]: Analyzing trace with hash -774589279, now seen corresponding path program 3 times [2018-04-13 04:54:38,459 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:54:38,459 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:54:38,459 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:38,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:38,460 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:38,467 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:54:38,475 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:54:38,475 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:54:38,475 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:54:38,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:54:38,509 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 04:54:38,509 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:54:38,512 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:54:38,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:54:38,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:38,522 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-13 04:54:38,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:38,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:38,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:54:38,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:54:38,537 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-13 04:54:38,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:38,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:54:38,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:54:38,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-13 04:54:38,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:38,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:38,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-13 04:54:38,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 04:54:38,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 04:54:38,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:38,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:38,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:38,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-13 04:54:38,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-13 04:54:38,583 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-13 04:54:38,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:38,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:38,588 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-13 04:54:38,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-04-13 04:54:41,338 WARN L148 SmtUtils]: Spent 2031ms on a formula simplification that was a NOOP. DAG size: 37 [2018-04-13 04:54:41,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2018-04-13 04:54:41,428 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 44 treesize of output 36 [2018-04-13 04:54:41,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:41,472 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 40 treesize of output 30 [2018-04-13 04:54:41,472 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:41,499 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 44 treesize of output 34 [2018-04-13 04:54:41,499 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:41,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2018-04-13 04:54:41,538 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-04-13 04:54:41,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-04-13 04:54:41,580 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:41,632 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 27 treesize of output 25 [2018-04-13 04:54:41,633 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-13 04:54:41,681 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 32 treesize of output 30 [2018-04-13 04:54:41,681 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-13 04:54:41,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2018-04-13 04:54:41,732 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-04-13 04:54:41,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-13 04:54:41,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-13 04:54:41,805 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:60, output treesize:68 [2018-04-13 04:54:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-13 04:54:41,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:54:41,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 04:54:41,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 04:54:41,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 04:54:41,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-04-13 04:54:41,857 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 17 states. [2018-04-13 04:54:46,137 WARN L151 SmtUtils]: Spent 4053ms on a formula simplification. DAG size of input: 50 DAG size of output 46 [2018-04-13 04:54:51,968 WARN L151 SmtUtils]: Spent 5389ms on a formula simplification. DAG size of input: 54 DAG size of output 46 [2018-04-13 04:54:52,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:54:52,121 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2018-04-13 04:54:52,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 04:54:52,122 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 51 [2018-04-13 04:54:52,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:54:52,122 INFO L225 Difference]: With dead ends: 132 [2018-04-13 04:54:52,123 INFO L226 Difference]: Without dead ends: 132 [2018-04-13 04:54:52,123 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=214, Invalid=976, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 04:54:52,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-13 04:54:52,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 63. [2018-04-13 04:54:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-04-13 04:54:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-04-13 04:54:52,126 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 51 [2018-04-13 04:54:52,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:54:52,126 INFO L459 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-04-13 04:54:52,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 04:54:52,126 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-04-13 04:54:52,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-13 04:54:52,126 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:54:52,126 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:54:52,126 INFO L408 AbstractCegarLoop]: === Iteration 19 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:54:52,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1070056914, now seen corresponding path program 2 times [2018-04-13 04:54:52,127 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:54:52,127 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:54:52,127 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:52,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:54:52,127 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:52,137 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:54:52,312 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-04-13 04:54:52,312 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:54:52,312 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:54:52,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:54:52,338 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:54:52,338 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:54:52,342 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:54:52,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 04:54:52,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:52,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:52,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 04:54:52,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 04:54:52,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 04:54:52,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:52,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:52,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:52,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-13 04:54:52,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2018-04-13 04:54:52,771 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 31 treesize of output 23 [2018-04-13 04:54:52,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:52,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-13 04:54:52,783 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:52,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 35 [2018-04-13 04:54:52,801 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-04-13 04:54:52,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 04:54:52,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-13 04:54:52,847 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:115 [2018-04-13 04:54:52,931 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:54:52,931 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:54:52,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 30 [2018-04-13 04:54:52,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-13 04:54:52,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-13 04:54:52,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=794, Unknown=0, NotChecked=0, Total=930 [2018-04-13 04:54:52,932 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 31 states. [2018-04-13 04:54:55,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:54:55,619 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2018-04-13 04:54:55,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-13 04:54:55,619 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 54 [2018-04-13 04:54:55,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:54:55,620 INFO L225 Difference]: With dead ends: 110 [2018-04-13 04:54:55,620 INFO L226 Difference]: Without dead ends: 104 [2018-04-13 04:54:55,621 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2618 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1339, Invalid=7217, Unknown=0, NotChecked=0, Total=8556 [2018-04-13 04:54:55,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-13 04:54:55,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 74. [2018-04-13 04:54:55,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-13 04:54:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-04-13 04:54:55,622 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 54 [2018-04-13 04:54:55,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:54:55,623 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-04-13 04:54:55,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-13 04:54:55,623 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-04-13 04:54:55,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-13 04:54:55,623 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:54:55,623 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:54:55,623 INFO L408 AbstractCegarLoop]: === Iteration 20 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:54:55,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1788411886, now seen corresponding path program 1 times [2018-04-13 04:54:55,624 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:54:55,624 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:54:55,624 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:55,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:54:55,624 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:54:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:55,632 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:54:55,808 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 11 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:54:55,809 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:54:55,809 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:54:55,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:54:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:54:55,839 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:54:55,883 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-13 04:54:55,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:55,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:55,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 04:54:55,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 04:54:55,926 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-13 04:54:55,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:54:55,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:55,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:54:55,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-13 04:54:56,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 04:54:56,206 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 15 treesize of output 12 [2018-04-13 04:54:56,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:54:56,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:54:56,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:54:56,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-04-13 04:54:56,329 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:54:56,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:54:56,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 30 [2018-04-13 04:54:56,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-13 04:54:56,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-13 04:54:56,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2018-04-13 04:54:56,330 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 31 states. [2018-04-13 04:54:57,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:54:57,355 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2018-04-13 04:54:57,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 04:54:57,356 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 65 [2018-04-13 04:54:57,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:54:57,356 INFO L225 Difference]: With dead ends: 154 [2018-04-13 04:54:57,356 INFO L226 Difference]: Without dead ends: 0 [2018-04-13 04:54:57,357 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=472, Invalid=3188, Unknown=0, NotChecked=0, Total=3660 [2018-04-13 04:54:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-13 04:54:57,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-13 04:54:57,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-13 04:54:57,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-13 04:54:57,357 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2018-04-13 04:54:57,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:54:57,357 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-13 04:54:57,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-13 04:54:57,357 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-13 04:54:57,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-13 04:54:57,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 04:54:57 BoogieIcfgContainer [2018-04-13 04:54:57,360 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 04:54:57,360 INFO L168 Benchmark]: Toolchain (without parser) took 40458.02 ms. Allocated memory was 383.8 MB in the beginning and 793.8 MB in the end (delta: 410.0 MB). Free memory was 317.6 MB in the beginning and 628.1 MB in the end (delta: -310.5 MB). Peak memory consumption was 99.5 MB. Max. memory is 5.3 GB. [2018-04-13 04:54:57,361 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 383.8 MB. Free memory is still 345.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 04:54:57,361 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.05 ms. Allocated memory is still 383.8 MB. Free memory was 317.6 MB in the beginning and 293.8 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-13 04:54:57,361 INFO L168 Benchmark]: Boogie Preprocessor took 35.98 ms. Allocated memory is still 383.8 MB. Free memory was 293.8 MB in the beginning and 291.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-13 04:54:57,362 INFO L168 Benchmark]: RCFGBuilder took 365.79 ms. Allocated memory was 383.8 MB in the beginning and 574.6 MB in the end (delta: 190.8 MB). Free memory was 291.2 MB in the beginning and 507.3 MB in the end (delta: -216.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. [2018-04-13 04:54:57,362 INFO L168 Benchmark]: TraceAbstraction took 39820.31 ms. Allocated memory was 574.6 MB in the beginning and 793.8 MB in the end (delta: 219.2 MB). Free memory was 507.3 MB in the beginning and 628.1 MB in the end (delta: -120.8 MB). Peak memory consumption was 98.3 MB. Max. memory is 5.3 GB. [2018-04-13 04:54:57,363 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.09 ms. Allocated memory is still 383.8 MB. Free memory is still 345.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 233.05 ms. Allocated memory is still 383.8 MB. Free memory was 317.6 MB in the beginning and 293.8 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.98 ms. Allocated memory is still 383.8 MB. Free memory was 293.8 MB in the beginning and 291.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 365.79 ms. Allocated memory was 383.8 MB in the beginning and 574.6 MB in the end (delta: 190.8 MB). Free memory was 291.2 MB in the beginning and 507.3 MB in the end (delta: -216.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 39820.31 ms. Allocated memory was 574.6 MB in the beginning and 793.8 MB in the end (delta: 219.2 MB). Free memory was 507.3 MB in the beginning and 628.1 MB in the end (delta: -120.8 MB). Peak memory consumption was 98.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 61 locations, 15 error locations. SAFE Result, 39.7s OverallTime, 20 OverallIterations, 5 TraceHistogramMax, 27.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 738 SDtfs, 1619 SDslu, 3455 SDs, 0 SdLazy, 4664 SolverSat, 411 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 727 GetRequests, 293 SyntacticMatches, 4 SemanticMatches, 430 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4987 ImplicationChecksByTransitivity, 32.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=13, 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.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 248 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 1017 NumberOfCodeBlocks, 1017 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 745 ConstructedInterpolants, 160 QuantifiedInterpolants, 480706 SizeOfPredicates, 134 NumberOfNonLiveVariables, 1926 ConjunctsInSsa, 420 ConjunctsInUnsatCore, 24 InterpolantComputations, 14 PerfectInterpolantSequences, 62/382 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_04-54-57-369.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_04-54-57-369.csv Received shutdown request...