java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-01_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 14:00:36,314 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 14:00:36,316 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 14:00:36,329 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 14:00:36,329 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 14:00:36,330 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 14:00:36,330 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 14:00:36,332 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 14:00:36,334 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 14:00:36,335 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 14:00:36,335 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 14:00:36,335 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 14:00:36,336 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 14:00:36,337 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 14:00:36,338 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 14:00:36,340 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 14:00:36,341 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 14:00:36,343 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 14:00:36,344 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 14:00:36,345 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 14:00:36,346 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 14:00:36,347 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 14:00:36,347 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 14:00:36,348 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 14:00:36,348 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 14:00:36,349 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 14:00:36,350 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 14:00:36,350 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 14:00:36,351 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 14:00:36,351 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 14:00:36,352 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 14:00:36,352 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-10 14:00:36,364 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 14:00:36,364 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 14:00:36,365 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 14:00:36,366 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 14:00:36,366 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 14:00:36,366 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 14:00:36,366 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 14:00:36,366 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 14:00:36,367 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 14:00:36,367 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 14:00:36,367 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 14:00:36,367 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 14:00:36,367 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 14:00:36,367 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 14:00:36,367 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 14:00:36,368 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 14:00:36,368 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 14:00:36,368 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 14:00:36,368 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 14:00:36,368 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 14:00:36,368 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 14:00:36,368 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 14:00:36,369 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 14:00:36,369 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-04-10 14:00:36,403 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 14:00:36,414 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 14:00:36,417 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 14:00:36,418 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 14:00:36,419 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 14:00:36,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,711 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG0be50feb5 [2018-04-10 14:00:36,862 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 14:00:36,862 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 14:00:36,862 INFO L168 CDTParser]: Scanning dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,869 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 14:00:36,869 INFO L215 ultiparseSymbolTable]: [2018-04-10 14:00:36,869 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 14:00:36,869 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,869 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 14:00:36,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____ino_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____syscall_slong_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____u_quad_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____pid_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__u_long in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____ino64_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____gid_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__int64_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__suseconds_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____quad_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____sigset_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____off_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__fd_mask in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____fsid_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__SLL in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____key_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__ushort in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____u_long in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__dev_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,872 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____int16_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,872 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____clockid_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,872 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,872 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__id_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,872 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____useconds_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,872 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__sigset_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,872 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,872 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____blkcnt_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,872 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_cond_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,872 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__quad_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,873 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____u_int in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,873 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__u_char in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,873 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__blkcnt_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,873 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__u_int16_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,873 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____caddr_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,873 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____blksize_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,873 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__blksize_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,873 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____dev_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,873 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,873 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____qaddr_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,874 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__fd_set in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,874 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____int64_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,874 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__ulong in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,874 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__loff_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,874 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__u_quad_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,874 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____uint8_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,874 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____rlim64_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,874 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____daddr_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,874 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__clock_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,874 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__mode_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,874 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____uint16_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,874 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__daddr_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,874 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,874 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____int8_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,874 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____clock_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,874 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____loff_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,874 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__fsid_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____time_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____timer_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__key_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____u_short in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__idtype_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____mode_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__int32_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____rlim_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__caddr_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__u_int64_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__ino_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pid_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__int8_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____blkcnt64_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__ldiv_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__gid_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__time_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__u_short in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__div_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__off_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__register_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____socklen_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__lldiv_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__uid_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____uint32_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_once_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_key_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____intptr_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__size_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_attr_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____off64_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____sig_atomic_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____uint64_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__int16_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__wchar_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__uint in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____fsword_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____u_char in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__nlink_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____uid_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__ssize_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____nlink_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____pthread_slist_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____suseconds_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__clockid_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__u_int in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__u_int32_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____id_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____ssize_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__timer_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__u_int8_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____fd_mask in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____int32_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:36,893 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG0be50feb5 [2018-04-10 14:00:36,896 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 14:00:36,897 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 14:00:36,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 14:00:36,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 14:00:36,903 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 14:00:36,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:00:36" (1/1) ... [2018-04-10 14:00:36,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c38fc40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:00:36, skipping insertion in model container [2018-04-10 14:00:36,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:00:36" (1/1) ... [2018-04-10 14:00:36,916 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:00:36,944 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:00:37,091 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:00:37,129 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:00:37,135 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-10 14:00:37,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:00:37 WrapperNode [2018-04-10 14:00:37,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 14:00:37,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 14:00:37,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 14:00:37,171 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 14:00:37,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:00:37" (1/1) ... [2018-04-10 14:00:37,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:00:37" (1/1) ... [2018-04-10 14:00:37,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:00:37" (1/1) ... [2018-04-10 14:00:37,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:00:37" (1/1) ... [2018-04-10 14:00:37,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:00:37" (1/1) ... [2018-04-10 14:00:37,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:00:37" (1/1) ... [2018-04-10 14:00:37,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:00:37" (1/1) ... [2018-04-10 14:00:37,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 14:00:37,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 14:00:37,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 14:00:37,222 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 14:00:37,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:00:37" (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-10 14:00:37,318 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 14:00:37,318 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 14:00:37,318 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 14:00:37,318 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-10 14:00:37,318 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-10 14:00:37,318 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-10 14:00:37,318 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-10 14:00:37,318 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-10 14:00:37,318 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-10 14:00:37,318 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-10 14:00:37,319 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-10 14:00:37,319 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-10 14:00:37,319 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-10 14:00:37,319 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-10 14:00:37,319 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-10 14:00:37,319 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-10 14:00:37,319 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-10 14:00:37,319 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-10 14:00:37,319 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-10 14:00:37,319 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-10 14:00:37,319 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-10 14:00:37,319 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-10 14:00:37,319 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-10 14:00:37,319 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-10 14:00:37,319 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-10 14:00:37,319 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-10 14:00:37,320 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-10 14:00:37,320 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-10 14:00:37,320 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-10 14:00:37,320 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-10 14:00:37,320 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-10 14:00:37,320 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-10 14:00:37,320 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-10 14:00:37,320 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-10 14:00:37,320 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-10 14:00:37,320 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-10 14:00:37,320 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-10 14:00:37,320 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-10 14:00:37,320 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-10 14:00:37,320 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-10 14:00:37,320 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-10 14:00:37,320 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-10 14:00:37,320 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-10 14:00:37,320 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-10 14:00:37,321 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-10 14:00:37,321 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-10 14:00:37,321 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-10 14:00:37,321 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-10 14:00:37,321 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-10 14:00:37,321 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-10 14:00:37,321 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-10 14:00:37,321 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-10 14:00:37,321 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-10 14:00:37,321 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-10 14:00:37,321 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-10 14:00:37,321 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-10 14:00:37,321 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-10 14:00:37,321 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-10 14:00:37,321 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-10 14:00:37,321 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-10 14:00:37,321 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-10 14:00:37,322 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-10 14:00:37,322 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-10 14:00:37,322 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-10 14:00:37,322 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-10 14:00:37,322 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-10 14:00:37,322 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-10 14:00:37,322 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-10 14:00:37,322 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-10 14:00:37,322 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-10 14:00:37,322 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-10 14:00:37,322 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-10 14:00:37,322 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-10 14:00:37,322 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-10 14:00:37,322 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-10 14:00:37,322 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-10 14:00:37,322 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-10 14:00:37,322 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-10 14:00:37,322 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-10 14:00:37,322 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-10 14:00:37,323 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-10 14:00:37,323 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-10 14:00:37,323 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-10 14:00:37,323 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-10 14:00:37,323 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-10 14:00:37,323 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-10 14:00:37,323 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-10 14:00:37,323 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-10 14:00:37,323 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-10 14:00:37,323 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-10 14:00:37,323 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-10 14:00:37,323 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-10 14:00:37,323 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-10 14:00:37,323 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-10 14:00:37,323 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-10 14:00:37,323 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-10 14:00:37,323 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-10 14:00:37,323 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-10 14:00:37,324 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-10 14:00:37,324 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-10 14:00:37,324 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-10 14:00:37,324 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-10 14:00:37,324 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-10 14:00:37,324 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-10 14:00:37,324 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-10 14:00:37,324 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-10 14:00:37,324 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 14:00:37,324 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 14:00:37,324 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 14:00:37,324 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 14:00:37,324 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-10 14:00:37,324 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-10 14:00:37,324 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 14:00:37,324 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 14:00:37,324 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 14:00:37,844 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 14:00:37,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:00:37 BoogieIcfgContainer [2018-04-10 14:00:37,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 14:00:37,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 14:00:37,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 14:00:37,848 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 14:00:37,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 02:00:36" (1/3) ... [2018-04-10 14:00:37,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58244785 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:00:37, skipping insertion in model container [2018-04-10 14:00:37,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:00:37" (2/3) ... [2018-04-10 14:00:37,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58244785 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:00:37, skipping insertion in model container [2018-04-10 14:00:37,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:00:37" (3/3) ... [2018-04-10 14:00:37,850 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:00:37,856 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 14:00:37,862 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2018-04-10 14:00:37,889 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 14:00:37,890 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 14:00:37,890 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 14:00:37,890 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 14:00:37,890 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 14:00:37,890 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 14:00:37,890 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 14:00:37,890 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 14:00:37,890 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 14:00:37,891 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 14:00:37,903 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-04-10 14:00:37,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 14:00:37,911 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:37,912 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:37,913 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:37,916 INFO L82 PathProgramCache]: Analyzing trace with hash -383126915, now seen corresponding path program 1 times [2018-04-10 14:00:37,917 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:37,918 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:37,954 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:37,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:37,954 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:37,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:38,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-10 14:00:38,042 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:38,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:00:38,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:00:38,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:00:38,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:00:38,058 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 4 states. [2018-04-10 14:00:38,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:38,289 INFO L93 Difference]: Finished difference Result 226 states and 237 transitions. [2018-04-10 14:00:38,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:00:38,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 14:00:38,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:38,300 INFO L225 Difference]: With dead ends: 226 [2018-04-10 14:00:38,300 INFO L226 Difference]: Without dead ends: 222 [2018-04-10 14:00:38,302 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-10 14:00:38,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-10 14:00:38,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 189. [2018-04-10 14:00:38,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-10 14:00:38,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 200 transitions. [2018-04-10 14:00:38,338 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 200 transitions. Word has length 8 [2018-04-10 14:00:38,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:38,339 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 200 transitions. [2018-04-10 14:00:38,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:00:38,339 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 200 transitions. [2018-04-10 14:00:38,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 14:00:38,339 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:38,339 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:38,339 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:38,340 INFO L82 PathProgramCache]: Analyzing trace with hash -383126914, now seen corresponding path program 1 times [2018-04-10 14:00:38,340 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:38,340 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:38,341 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:38,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:38,342 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:38,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:38,396 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-10 14:00:38,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:38,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:00:38,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:00:38,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:00:38,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:00:38,398 INFO L87 Difference]: Start difference. First operand 189 states and 200 transitions. Second operand 4 states. [2018-04-10 14:00:38,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:38,556 INFO L93 Difference]: Finished difference Result 214 states and 224 transitions. [2018-04-10 14:00:38,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 14:00:38,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 14:00:38,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:38,557 INFO L225 Difference]: With dead ends: 214 [2018-04-10 14:00:38,558 INFO L226 Difference]: Without dead ends: 214 [2018-04-10 14:00:38,558 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-10 14:00:38,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-10 14:00:38,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 201. [2018-04-10 14:00:38,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-04-10 14:00:38,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 219 transitions. [2018-04-10 14:00:38,566 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 219 transitions. Word has length 8 [2018-04-10 14:00:38,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:38,567 INFO L459 AbstractCegarLoop]: Abstraction has 201 states and 219 transitions. [2018-04-10 14:00:38,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:00:38,567 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 219 transitions. [2018-04-10 14:00:38,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 14:00:38,567 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:38,567 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-10 14:00:38,567 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:38,568 INFO L82 PathProgramCache]: Analyzing trace with hash -627546445, now seen corresponding path program 1 times [2018-04-10 14:00:38,568 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:38,568 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:38,569 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:38,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:38,569 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:38,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:00:38,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:38,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:00:38,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:00:38,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:00:38,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:00:38,627 INFO L87 Difference]: Start difference. First operand 201 states and 219 transitions. Second operand 5 states. [2018-04-10 14:00:38,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:38,914 INFO L93 Difference]: Finished difference Result 343 states and 369 transitions. [2018-04-10 14:00:38,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:00:38,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-10 14:00:38,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:38,916 INFO L225 Difference]: With dead ends: 343 [2018-04-10 14:00:38,916 INFO L226 Difference]: Without dead ends: 343 [2018-04-10 14:00:38,916 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:00:38,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-04-10 14:00:38,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 200. [2018-04-10 14:00:38,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-10 14:00:38,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 218 transitions. [2018-04-10 14:00:38,925 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 218 transitions. Word has length 18 [2018-04-10 14:00:38,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:38,926 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 218 transitions. [2018-04-10 14:00:38,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:00:38,926 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 218 transitions. [2018-04-10 14:00:38,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 14:00:38,926 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:38,926 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-10 14:00:38,927 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:38,927 INFO L82 PathProgramCache]: Analyzing trace with hash -627546444, now seen corresponding path program 1 times [2018-04-10 14:00:38,927 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:38,927 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:38,928 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:38,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:38,928 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:38,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:38,993 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-10 14:00:38,993 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:38,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:00:38,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:00:38,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:00:38,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:00:38,994 INFO L87 Difference]: Start difference. First operand 200 states and 218 transitions. Second operand 5 states. [2018-04-10 14:00:39,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:39,216 INFO L93 Difference]: Finished difference Result 373 states and 408 transitions. [2018-04-10 14:00:39,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:00:39,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-10 14:00:39,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:39,217 INFO L225 Difference]: With dead ends: 373 [2018-04-10 14:00:39,217 INFO L226 Difference]: Without dead ends: 373 [2018-04-10 14:00:39,218 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:00:39,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-04-10 14:00:39,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 199. [2018-04-10 14:00:39,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-10 14:00:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 217 transitions. [2018-04-10 14:00:39,224 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 217 transitions. Word has length 18 [2018-04-10 14:00:39,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:39,225 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 217 transitions. [2018-04-10 14:00:39,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:00:39,225 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 217 transitions. [2018-04-10 14:00:39,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-10 14:00:39,225 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:39,225 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-10 14:00:39,227 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:39,227 INFO L82 PathProgramCache]: Analyzing trace with hash 756513409, now seen corresponding path program 1 times [2018-04-10 14:00:39,227 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:39,227 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:39,228 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:39,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:39,228 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:39,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:39,336 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-10 14:00:39,336 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:39,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:00:39,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:00:39,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:00:39,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:00:39,337 INFO L87 Difference]: Start difference. First operand 199 states and 217 transitions. Second operand 8 states. [2018-04-10 14:00:39,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:39,771 INFO L93 Difference]: Finished difference Result 345 states and 370 transitions. [2018-04-10 14:00:39,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:00:39,772 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-04-10 14:00:39,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:39,776 INFO L225 Difference]: With dead ends: 345 [2018-04-10 14:00:39,776 INFO L226 Difference]: Without dead ends: 345 [2018-04-10 14:00:39,777 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-10 14:00:39,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-04-10 14:00:39,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 198. [2018-04-10 14:00:39,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-10 14:00:39,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 216 transitions. [2018-04-10 14:00:39,787 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 216 transitions. Word has length 21 [2018-04-10 14:00:39,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:39,788 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 216 transitions. [2018-04-10 14:00:39,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:00:39,788 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 216 transitions. [2018-04-10 14:00:39,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-10 14:00:39,788 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:39,788 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-10 14:00:39,789 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:39,790 INFO L82 PathProgramCache]: Analyzing trace with hash 756513410, now seen corresponding path program 1 times [2018-04-10 14:00:39,790 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:39,790 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:39,791 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:39,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:39,792 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:39,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:39,898 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-10 14:00:39,898 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:39,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:00:39,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:00:39,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:00:39,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:00:39,899 INFO L87 Difference]: Start difference. First operand 198 states and 216 transitions. Second operand 8 states. [2018-04-10 14:00:40,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:40,478 INFO L93 Difference]: Finished difference Result 346 states and 371 transitions. [2018-04-10 14:00:40,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:00:40,478 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-04-10 14:00:40,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:40,479 INFO L225 Difference]: With dead ends: 346 [2018-04-10 14:00:40,479 INFO L226 Difference]: Without dead ends: 346 [2018-04-10 14:00:40,480 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-10 14:00:40,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-04-10 14:00:40,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 197. [2018-04-10 14:00:40,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-10 14:00:40,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 215 transitions. [2018-04-10 14:00:40,485 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 215 transitions. Word has length 21 [2018-04-10 14:00:40,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:40,485 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 215 transitions. [2018-04-10 14:00:40,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:00:40,485 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 215 transitions. [2018-04-10 14:00:40,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-10 14:00:40,486 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:40,486 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] [2018-04-10 14:00:40,486 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:40,487 INFO L82 PathProgramCache]: Analyzing trace with hash 375229354, now seen corresponding path program 1 times [2018-04-10 14:00:40,487 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:40,487 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:40,488 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:40,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:40,488 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:40,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:40,536 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-10 14:00:40,536 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:40,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:00:40,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:00:40,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:00:40,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:00:40,537 INFO L87 Difference]: Start difference. First operand 197 states and 215 transitions. Second operand 5 states. [2018-04-10 14:00:40,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:40,630 INFO L93 Difference]: Finished difference Result 293 states and 316 transitions. [2018-04-10 14:00:40,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:00:40,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-04-10 14:00:40,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:40,631 INFO L225 Difference]: With dead ends: 293 [2018-04-10 14:00:40,632 INFO L226 Difference]: Without dead ends: 293 [2018-04-10 14:00:40,632 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:00:40,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-04-10 14:00:40,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 201. [2018-04-10 14:00:40,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-04-10 14:00:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 219 transitions. [2018-04-10 14:00:40,637 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 219 transitions. Word has length 27 [2018-04-10 14:00:40,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:40,637 INFO L459 AbstractCegarLoop]: Abstraction has 201 states and 219 transitions. [2018-04-10 14:00:40,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:00:40,637 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 219 transitions. [2018-04-10 14:00:40,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-10 14:00:40,638 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:40,638 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] [2018-04-10 14:00:40,638 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:40,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1824203793, now seen corresponding path program 1 times [2018-04-10 14:00:40,638 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:40,638 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:40,639 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:40,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:40,640 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:40,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:40,709 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-10 14:00:40,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:40,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:00:40,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:00:40,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:00:40,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:00:40,710 INFO L87 Difference]: Start difference. First operand 201 states and 219 transitions. Second operand 4 states. [2018-04-10 14:00:40,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:40,816 INFO L93 Difference]: Finished difference Result 203 states and 219 transitions. [2018-04-10 14:00:40,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 14:00:40,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-04-10 14:00:40,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:40,817 INFO L225 Difference]: With dead ends: 203 [2018-04-10 14:00:40,817 INFO L226 Difference]: Without dead ends: 203 [2018-04-10 14:00:40,817 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:00:40,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-04-10 14:00:40,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 192. [2018-04-10 14:00:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-10 14:00:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 210 transitions. [2018-04-10 14:00:40,820 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 210 transitions. Word has length 29 [2018-04-10 14:00:40,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:40,820 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 210 transitions. [2018-04-10 14:00:40,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:00:40,820 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 210 transitions. [2018-04-10 14:00:40,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-10 14:00:40,821 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:40,821 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] [2018-04-10 14:00:40,821 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:40,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1824203792, now seen corresponding path program 1 times [2018-04-10 14:00:40,822 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:40,822 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:40,823 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:40,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:40,823 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:40,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:40,937 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-10 14:00:40,938 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:40,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:00:40,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:00:40,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:00:40,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:00:40,939 INFO L87 Difference]: Start difference. First operand 192 states and 210 transitions. Second operand 5 states. [2018-04-10 14:00:41,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:41,091 INFO L93 Difference]: Finished difference Result 251 states and 265 transitions. [2018-04-10 14:00:41,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:00:41,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-10 14:00:41,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:41,092 INFO L225 Difference]: With dead ends: 251 [2018-04-10 14:00:41,092 INFO L226 Difference]: Without dead ends: 251 [2018-04-10 14:00:41,093 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:00:41,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-04-10 14:00:41,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 222. [2018-04-10 14:00:41,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-04-10 14:00:41,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 250 transitions. [2018-04-10 14:00:41,097 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 250 transitions. Word has length 29 [2018-04-10 14:00:41,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:41,098 INFO L459 AbstractCegarLoop]: Abstraction has 222 states and 250 transitions. [2018-04-10 14:00:41,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:00:41,098 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 250 transitions. [2018-04-10 14:00:41,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 14:00:41,098 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:41,098 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-10 14:00:41,098 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:41,098 INFO L82 PathProgramCache]: Analyzing trace with hash -713185966, now seen corresponding path program 1 times [2018-04-10 14:00:41,099 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:41,099 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:41,100 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:41,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:41,100 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:41,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:41,129 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-10 14:00:41,130 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:41,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:00:41,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:00:41,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:00:41,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:00:41,130 INFO L87 Difference]: Start difference. First operand 222 states and 250 transitions. Second operand 5 states. [2018-04-10 14:00:41,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:41,338 INFO L93 Difference]: Finished difference Result 314 states and 354 transitions. [2018-04-10 14:00:41,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:00:41,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-04-10 14:00:41,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:41,340 INFO L225 Difference]: With dead ends: 314 [2018-04-10 14:00:41,340 INFO L226 Difference]: Without dead ends: 314 [2018-04-10 14:00:41,340 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:00:41,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-04-10 14:00:41,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 221. [2018-04-10 14:00:41,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-10 14:00:41,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 248 transitions. [2018-04-10 14:00:41,346 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 248 transitions. Word has length 31 [2018-04-10 14:00:41,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:41,346 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 248 transitions. [2018-04-10 14:00:41,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:00:41,347 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 248 transitions. [2018-04-10 14:00:41,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 14:00:41,347 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:41,347 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:41,348 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:41,348 INFO L82 PathProgramCache]: Analyzing trace with hash -713185965, now seen corresponding path program 1 times [2018-04-10 14:00:41,348 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:41,348 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:41,349 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:41,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:41,349 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:41,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:41,418 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-10 14:00:41,419 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:41,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:00:41,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:00:41,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:00:41,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:00:41,419 INFO L87 Difference]: Start difference. First operand 221 states and 248 transitions. Second operand 5 states. [2018-04-10 14:00:41,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:41,588 INFO L93 Difference]: Finished difference Result 344 states and 390 transitions. [2018-04-10 14:00:41,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:00:41,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-04-10 14:00:41,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:41,589 INFO L225 Difference]: With dead ends: 344 [2018-04-10 14:00:41,589 INFO L226 Difference]: Without dead ends: 344 [2018-04-10 14:00:41,590 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:00:41,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-04-10 14:00:41,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 220. [2018-04-10 14:00:41,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-10 14:00:41,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 246 transitions. [2018-04-10 14:00:41,594 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 246 transitions. Word has length 31 [2018-04-10 14:00:41,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:41,594 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 246 transitions. [2018-04-10 14:00:41,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:00:41,595 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 246 transitions. [2018-04-10 14:00:41,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-10 14:00:41,595 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:41,595 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:41,595 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:41,595 INFO L82 PathProgramCache]: Analyzing trace with hash -389297068, now seen corresponding path program 1 times [2018-04-10 14:00:41,596 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:41,596 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:41,596 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:41,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:41,596 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:41,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:41,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:00:41,678 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:41,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 14:00:41,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 14:00:41,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 14:00:41,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:00:41,679 INFO L87 Difference]: Start difference. First operand 220 states and 246 transitions. Second operand 9 states. [2018-04-10 14:00:41,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:41,973 INFO L93 Difference]: Finished difference Result 229 states and 254 transitions. [2018-04-10 14:00:41,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 14:00:41,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-04-10 14:00:41,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:41,975 INFO L225 Difference]: With dead ends: 229 [2018-04-10 14:00:41,975 INFO L226 Difference]: Without dead ends: 229 [2018-04-10 14:00:41,975 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:00:41,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-04-10 14:00:41,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 219. [2018-04-10 14:00:41,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-04-10 14:00:41,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 245 transitions. [2018-04-10 14:00:41,980 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 245 transitions. Word has length 35 [2018-04-10 14:00:41,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:41,980 INFO L459 AbstractCegarLoop]: Abstraction has 219 states and 245 transitions. [2018-04-10 14:00:41,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 14:00:41,980 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 245 transitions. [2018-04-10 14:00:41,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-10 14:00:41,981 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:41,981 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:41,981 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:41,981 INFO L82 PathProgramCache]: Analyzing trace with hash -389297067, now seen corresponding path program 1 times [2018-04-10 14:00:41,981 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:41,981 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:41,982 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:41,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:41,983 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:41,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:42,101 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-10 14:00:42,101 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:42,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 14:00:42,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 14:00:42,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 14:00:42,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-10 14:00:42,102 INFO L87 Difference]: Start difference. First operand 219 states and 245 transitions. Second operand 10 states. [2018-04-10 14:00:42,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:42,586 INFO L93 Difference]: Finished difference Result 221 states and 246 transitions. [2018-04-10 14:00:42,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 14:00:42,586 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-04-10 14:00:42,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:42,587 INFO L225 Difference]: With dead ends: 221 [2018-04-10 14:00:42,587 INFO L226 Difference]: Without dead ends: 221 [2018-04-10 14:00:42,587 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-04-10 14:00:42,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-10 14:00:42,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 200. [2018-04-10 14:00:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-10 14:00:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 225 transitions. [2018-04-10 14:00:42,590 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 225 transitions. Word has length 35 [2018-04-10 14:00:42,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:42,590 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 225 transitions. [2018-04-10 14:00:42,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 14:00:42,590 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 225 transitions. [2018-04-10 14:00:42,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-10 14:00:42,591 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:42,591 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:42,591 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:42,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1622508317, now seen corresponding path program 1 times [2018-04-10 14:00:42,592 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:42,592 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:42,593 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:42,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:42,593 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:42,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:42,647 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-10 14:00:42,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:42,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:00:42,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:00:42,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:00:42,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:00:42,648 INFO L87 Difference]: Start difference. First operand 200 states and 225 transitions. Second operand 5 states. [2018-04-10 14:00:42,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:42,718 INFO L93 Difference]: Finished difference Result 226 states and 239 transitions. [2018-04-10 14:00:42,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:00:42,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-04-10 14:00:42,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:42,719 INFO L225 Difference]: With dead ends: 226 [2018-04-10 14:00:42,719 INFO L226 Difference]: Without dead ends: 226 [2018-04-10 14:00:42,719 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:00:42,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-04-10 14:00:42,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 200. [2018-04-10 14:00:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-10 14:00:42,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 223 transitions. [2018-04-10 14:00:42,722 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 223 transitions. Word has length 37 [2018-04-10 14:00:42,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:42,722 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 223 transitions. [2018-04-10 14:00:42,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:00:42,722 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 223 transitions. [2018-04-10 14:00:42,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-10 14:00:42,723 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:42,723 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:42,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1211459762, now seen corresponding path program 1 times [2018-04-10 14:00:42,723 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:42,723 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:42,724 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:42,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:42,724 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:42,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:42,885 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-10 14:00:42,885 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:42,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-10 14:00:42,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 14:00:42,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 14:00:42,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-10 14:00:42,886 INFO L87 Difference]: Start difference. First operand 200 states and 223 transitions. Second operand 10 states. [2018-04-10 14:00:43,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:43,275 INFO L93 Difference]: Finished difference Result 295 states and 318 transitions. [2018-04-10 14:00:43,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 14:00:43,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-04-10 14:00:43,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:43,276 INFO L225 Difference]: With dead ends: 295 [2018-04-10 14:00:43,276 INFO L226 Difference]: Without dead ends: 295 [2018-04-10 14:00:43,277 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2018-04-10 14:00:43,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-04-10 14:00:43,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 216. [2018-04-10 14:00:43,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-04-10 14:00:43,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 240 transitions. [2018-04-10 14:00:43,281 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 240 transitions. Word has length 43 [2018-04-10 14:00:43,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:43,281 INFO L459 AbstractCegarLoop]: Abstraction has 216 states and 240 transitions. [2018-04-10 14:00:43,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 14:00:43,281 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 240 transitions. [2018-04-10 14:00:43,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-10 14:00:43,282 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:43,282 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:43,282 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:43,282 INFO L82 PathProgramCache]: Analyzing trace with hash -392541986, now seen corresponding path program 1 times [2018-04-10 14:00:43,283 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:43,283 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:43,284 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:43,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:43,284 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:43,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:43,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:00:43,365 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:00:43,365 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:00:43,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:43,408 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:00:43,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:00:43,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:00:43,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:43,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:43,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:00:43,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:00:43,485 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:43,486 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:43,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:43,491 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-10 14:00:43,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 14:00:43,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:43,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:00:43,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:43,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:43,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 14:00:43,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:43,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:00:43,547 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:43,559 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:43,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:43,569 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:39 [2018-04-10 14:00:43,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-10 14:00:43,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:43,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:43,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:43,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-10 14:00:43,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:43,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:43,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-10 14:00:43,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:43,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:43,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:43,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-10 14:00:43,627 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:43,634 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:43,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:43,642 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2018-04-10 14:00:43,700 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 33 treesize of output 25 [2018-04-10 14:00:43,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:43,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:43,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:43,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-10 14:00:43,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:43,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:43,714 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 33 treesize of output 25 [2018-04-10 14:00:43,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:43,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:43,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:43,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-10 14:00:43,718 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:43,722 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:43,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:43,726 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:71, output treesize:7 [2018-04-10 14:00:43,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:00:43,761 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:00:43,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 12 [2018-04-10 14:00:43,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 14:00:43,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 14:00:43,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-04-10 14:00:43,761 INFO L87 Difference]: Start difference. First operand 216 states and 240 transitions. Second operand 12 states. [2018-04-10 14:00:44,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:44,341 INFO L93 Difference]: Finished difference Result 359 states and 384 transitions. [2018-04-10 14:00:44,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 14:00:44,341 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-04-10 14:00:44,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:44,342 INFO L225 Difference]: With dead ends: 359 [2018-04-10 14:00:44,342 INFO L226 Difference]: Without dead ends: 359 [2018-04-10 14:00:44,343 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=431, Unknown=0, NotChecked=0, Total=600 [2018-04-10 14:00:44,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-04-10 14:00:44,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 250. [2018-04-10 14:00:44,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-10 14:00:44,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 283 transitions. [2018-04-10 14:00:44,348 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 283 transitions. Word has length 45 [2018-04-10 14:00:44,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:44,348 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 283 transitions. [2018-04-10 14:00:44,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 14:00:44,349 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 283 transitions. [2018-04-10 14:00:44,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 14:00:44,349 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:44,349 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:44,349 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:44,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1698086673, now seen corresponding path program 1 times [2018-04-10 14:00:44,350 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:44,350 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:44,351 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:44,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:44,351 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:44,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:44,388 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-10 14:00:44,388 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:44,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:00:44,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:00:44,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:00:44,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:00:44,389 INFO L87 Difference]: Start difference. First operand 250 states and 283 transitions. Second operand 5 states. [2018-04-10 14:00:44,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:44,634 INFO L93 Difference]: Finished difference Result 368 states and 416 transitions. [2018-04-10 14:00:44,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:00:44,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-04-10 14:00:44,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:44,635 INFO L225 Difference]: With dead ends: 368 [2018-04-10 14:00:44,636 INFO L226 Difference]: Without dead ends: 368 [2018-04-10 14:00:44,636 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:00:44,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-04-10 14:00:44,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 249. [2018-04-10 14:00:44,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-04-10 14:00:44,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 282 transitions. [2018-04-10 14:00:44,642 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 282 transitions. Word has length 47 [2018-04-10 14:00:44,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:44,642 INFO L459 AbstractCegarLoop]: Abstraction has 249 states and 282 transitions. [2018-04-10 14:00:44,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:00:44,643 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 282 transitions. [2018-04-10 14:00:44,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 14:00:44,643 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:44,643 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:44,643 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:44,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1698086674, now seen corresponding path program 1 times [2018-04-10 14:00:44,643 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:44,644 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:44,644 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:44,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:44,645 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:44,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:44,711 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-10 14:00:44,711 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:44,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:00:44,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:00:44,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:00:44,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:00:44,712 INFO L87 Difference]: Start difference. First operand 249 states and 282 transitions. Second operand 5 states. [2018-04-10 14:00:44,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:44,881 INFO L93 Difference]: Finished difference Result 401 states and 455 transitions. [2018-04-10 14:00:44,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:00:44,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-04-10 14:00:44,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:44,882 INFO L225 Difference]: With dead ends: 401 [2018-04-10 14:00:44,883 INFO L226 Difference]: Without dead ends: 401 [2018-04-10 14:00:44,883 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:00:44,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-04-10 14:00:44,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 248. [2018-04-10 14:00:44,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-10 14:00:44,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 281 transitions. [2018-04-10 14:00:44,887 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 281 transitions. Word has length 47 [2018-04-10 14:00:44,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:44,887 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 281 transitions. [2018-04-10 14:00:44,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:00:44,888 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 281 transitions. [2018-04-10 14:00:44,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-10 14:00:44,888 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:44,888 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:44,888 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:44,888 INFO L82 PathProgramCache]: Analyzing trace with hash 234398632, now seen corresponding path program 1 times [2018-04-10 14:00:44,889 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:44,889 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:44,889 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:44,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:44,890 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:44,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:44,982 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-10 14:00:44,982 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:44,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-10 14:00:44,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 14:00:44,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 14:00:44,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-04-10 14:00:44,983 INFO L87 Difference]: Start difference. First operand 248 states and 281 transitions. Second operand 11 states. [2018-04-10 14:00:45,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:45,448 INFO L93 Difference]: Finished difference Result 486 states and 529 transitions. [2018-04-10 14:00:45,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 14:00:45,448 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-04-10 14:00:45,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:45,449 INFO L225 Difference]: With dead ends: 486 [2018-04-10 14:00:45,449 INFO L226 Difference]: Without dead ends: 486 [2018-04-10 14:00:45,449 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2018-04-10 14:00:45,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-04-10 14:00:45,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 254. [2018-04-10 14:00:45,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-04-10 14:00:45,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 286 transitions. [2018-04-10 14:00:45,452 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 286 transitions. Word has length 48 [2018-04-10 14:00:45,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:45,452 INFO L459 AbstractCegarLoop]: Abstraction has 254 states and 286 transitions. [2018-04-10 14:00:45,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 14:00:45,452 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 286 transitions. [2018-04-10 14:00:45,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-10 14:00:45,452 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:45,453 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:45,453 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:45,453 INFO L82 PathProgramCache]: Analyzing trace with hash 234398633, now seen corresponding path program 1 times [2018-04-10 14:00:45,453 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:45,453 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:45,454 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:45,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:45,454 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:45,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:45,721 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-10 14:00:45,721 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:45,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-10 14:00:45,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 14:00:45,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 14:00:45,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:00:45,722 INFO L87 Difference]: Start difference. First operand 254 states and 286 transitions. Second operand 14 states. [2018-04-10 14:00:46,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:46,681 INFO L93 Difference]: Finished difference Result 545 states and 584 transitions. [2018-04-10 14:00:46,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 14:00:46,681 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-04-10 14:00:46,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:46,682 INFO L225 Difference]: With dead ends: 545 [2018-04-10 14:00:46,682 INFO L226 Difference]: Without dead ends: 545 [2018-04-10 14:00:46,682 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=291, Invalid=899, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 14:00:46,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-04-10 14:00:46,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 261. [2018-04-10 14:00:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-04-10 14:00:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 292 transitions. [2018-04-10 14:00:46,686 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 292 transitions. Word has length 48 [2018-04-10 14:00:46,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:46,686 INFO L459 AbstractCegarLoop]: Abstraction has 261 states and 292 transitions. [2018-04-10 14:00:46,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 14:00:46,686 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 292 transitions. [2018-04-10 14:00:46,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-10 14:00:46,686 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:46,686 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:46,686 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:46,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1575403103, now seen corresponding path program 1 times [2018-04-10 14:00:46,686 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:46,687 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:46,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:46,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:46,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:46,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:46,769 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-10 14:00:46,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:46,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:00:46,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:00:46,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:00:46,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:00:46,769 INFO L87 Difference]: Start difference. First operand 261 states and 292 transitions. Second operand 8 states. [2018-04-10 14:00:47,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:47,031 INFO L93 Difference]: Finished difference Result 281 states and 314 transitions. [2018-04-10 14:00:47,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 14:00:47,032 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-04-10 14:00:47,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:47,033 INFO L225 Difference]: With dead ends: 281 [2018-04-10 14:00:47,033 INFO L226 Difference]: Without dead ends: 281 [2018-04-10 14:00:47,033 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-10 14:00:47,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-04-10 14:00:47,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 260. [2018-04-10 14:00:47,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-04-10 14:00:47,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 291 transitions. [2018-04-10 14:00:47,037 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 291 transitions. Word has length 50 [2018-04-10 14:00:47,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:47,038 INFO L459 AbstractCegarLoop]: Abstraction has 260 states and 291 transitions. [2018-04-10 14:00:47,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:00:47,038 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 291 transitions. [2018-04-10 14:00:47,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-10 14:00:47,038 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:47,039 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:47,039 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:47,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1575403104, now seen corresponding path program 1 times [2018-04-10 14:00:47,039 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:47,039 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:47,040 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:47,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:47,040 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:47,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:47,166 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-10 14:00:47,166 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:47,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:00:47,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:00:47,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:00:47,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:00:47,167 INFO L87 Difference]: Start difference. First operand 260 states and 291 transitions. Second operand 8 states. [2018-04-10 14:00:47,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:47,460 INFO L93 Difference]: Finished difference Result 280 states and 313 transitions. [2018-04-10 14:00:47,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 14:00:47,462 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-04-10 14:00:47,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:47,463 INFO L225 Difference]: With dead ends: 280 [2018-04-10 14:00:47,463 INFO L226 Difference]: Without dead ends: 280 [2018-04-10 14:00:47,463 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-10 14:00:47,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-04-10 14:00:47,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 259. [2018-04-10 14:00:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-04-10 14:00:47,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 290 transitions. [2018-04-10 14:00:47,465 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 290 transitions. Word has length 50 [2018-04-10 14:00:47,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:47,465 INFO L459 AbstractCegarLoop]: Abstraction has 259 states and 290 transitions. [2018-04-10 14:00:47,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:00:47,466 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 290 transitions. [2018-04-10 14:00:47,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-10 14:00:47,466 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:47,466 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:47,466 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:47,466 INFO L82 PathProgramCache]: Analyzing trace with hash -746323642, now seen corresponding path program 1 times [2018-04-10 14:00:47,466 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:47,466 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:47,467 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:47,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:47,467 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:47,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:47,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 14:00:47,531 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:47,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:00:47,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 14:00:47,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 14:00:47,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:00:47,532 INFO L87 Difference]: Start difference. First operand 259 states and 290 transitions. Second operand 7 states. [2018-04-10 14:00:47,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:47,638 INFO L93 Difference]: Finished difference Result 286 states and 317 transitions. [2018-04-10 14:00:47,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:00:47,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-04-10 14:00:47,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:47,639 INFO L225 Difference]: With dead ends: 286 [2018-04-10 14:00:47,639 INFO L226 Difference]: Without dead ends: 286 [2018-04-10 14:00:47,639 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-04-10 14:00:47,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-04-10 14:00:47,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 271. [2018-04-10 14:00:47,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-04-10 14:00:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 302 transitions. [2018-04-10 14:00:47,642 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 302 transitions. Word has length 54 [2018-04-10 14:00:47,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:47,642 INFO L459 AbstractCegarLoop]: Abstraction has 271 states and 302 transitions. [2018-04-10 14:00:47,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 14:00:47,642 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 302 transitions. [2018-04-10 14:00:47,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-10 14:00:47,643 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:47,643 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:00:47,643 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:47,643 INFO L82 PathProgramCache]: Analyzing trace with hash -871381849, now seen corresponding path program 1 times [2018-04-10 14:00:47,643 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:47,643 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:47,644 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:47,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:47,644 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:47,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:47,713 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:00:47,713 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:00:47,713 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:00:47,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:47,745 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:00:47,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 14:00:47,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 14:00:47,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:47,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:47,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:47,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-04-10 14:00:47,873 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 15 treesize of output 11 [2018-04-10 14:00:47,878 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 11 treesize of output 8 [2018-04-10 14:00:47,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:00:47,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:00:47,908 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 24 treesize of output 18 [2018-04-10 14:00:47,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:47,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:47,915 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 1 case distinctions, treesize of input 18 treesize of output 21 [2018-04-10 14:00:47,915 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 14:00:47,922 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:00:47,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:00:47,932 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-04-10 14:00:48,010 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:00:48,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:00:48,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2018-04-10 14:00:48,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 14:00:48,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 14:00:48,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-04-10 14:00:48,037 INFO L87 Difference]: Start difference. First operand 271 states and 302 transitions. Second operand 17 states. [2018-04-10 14:00:48,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:48,773 INFO L93 Difference]: Finished difference Result 408 states and 431 transitions. [2018-04-10 14:00:48,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 14:00:48,773 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2018-04-10 14:00:48,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:48,774 INFO L225 Difference]: With dead ends: 408 [2018-04-10 14:00:48,774 INFO L226 Difference]: Without dead ends: 408 [2018-04-10 14:00:48,774 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=976, Unknown=2, NotChecked=0, Total=1190 [2018-04-10 14:00:48,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-04-10 14:00:48,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 302. [2018-04-10 14:00:48,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-04-10 14:00:48,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 340 transitions. [2018-04-10 14:00:48,778 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 340 transitions. Word has length 58 [2018-04-10 14:00:48,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:48,778 INFO L459 AbstractCegarLoop]: Abstraction has 302 states and 340 transitions. [2018-04-10 14:00:48,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 14:00:48,778 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 340 transitions. [2018-04-10 14:00:48,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-10 14:00:48,779 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:48,779 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:48,779 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:48,779 INFO L82 PathProgramCache]: Analyzing trace with hash 2093652140, now seen corresponding path program 1 times [2018-04-10 14:00:48,779 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:48,779 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:48,780 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:48,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:48,780 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:48,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:48,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 14:00:48,984 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:48,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-04-10 14:00:48,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 14:00:48,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 14:00:48,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-04-10 14:00:48,985 INFO L87 Difference]: Start difference. First operand 302 states and 340 transitions. Second operand 16 states. [2018-04-10 14:00:50,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:50,009 INFO L93 Difference]: Finished difference Result 565 states and 616 transitions. [2018-04-10 14:00:50,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 14:00:50,009 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-04-10 14:00:50,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:50,012 INFO L225 Difference]: With dead ends: 565 [2018-04-10 14:00:50,012 INFO L226 Difference]: Without dead ends: 565 [2018-04-10 14:00:50,013 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=1316, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 14:00:50,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-04-10 14:00:50,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 312. [2018-04-10 14:00:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-04-10 14:00:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 352 transitions. [2018-04-10 14:00:50,020 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 352 transitions. Word has length 59 [2018-04-10 14:00:50,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:50,020 INFO L459 AbstractCegarLoop]: Abstraction has 312 states and 352 transitions. [2018-04-10 14:00:50,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 14:00:50,021 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 352 transitions. [2018-04-10 14:00:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-10 14:00:50,021 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:50,021 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:50,021 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:50,022 INFO L82 PathProgramCache]: Analyzing trace with hash 2093652141, now seen corresponding path program 1 times [2018-04-10 14:00:50,022 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:50,022 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:50,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:50,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:50,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:50,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 14:00:50,349 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:50,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-10 14:00:50,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 14:00:50,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 14:00:50,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-04-10 14:00:50,350 INFO L87 Difference]: Start difference. First operand 312 states and 352 transitions. Second operand 17 states. [2018-04-10 14:00:51,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:51,239 INFO L93 Difference]: Finished difference Result 558 states and 609 transitions. [2018-04-10 14:00:51,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 14:00:51,240 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2018-04-10 14:00:51,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:51,241 INFO L225 Difference]: With dead ends: 558 [2018-04-10 14:00:51,241 INFO L226 Difference]: Without dead ends: 558 [2018-04-10 14:00:51,241 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=368, Invalid=1114, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 14:00:51,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2018-04-10 14:00:51,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 319. [2018-04-10 14:00:51,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-04-10 14:00:51,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 358 transitions. [2018-04-10 14:00:51,245 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 358 transitions. Word has length 59 [2018-04-10 14:00:51,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:51,245 INFO L459 AbstractCegarLoop]: Abstraction has 319 states and 358 transitions. [2018-04-10 14:00:51,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 14:00:51,246 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 358 transitions. [2018-04-10 14:00:51,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-10 14:00:51,246 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:51,246 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:51,246 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:51,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1243032287, now seen corresponding path program 1 times [2018-04-10 14:00:51,247 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:51,247 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:51,247 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:51,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:51,248 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:51,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:51,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 14:00:51,316 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:00:51,316 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:00:51,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:51,361 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:00:51,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 14:00:51,415 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:00:51,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2018-04-10 14:00:51,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:00:51,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:00:51,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=36, Unknown=4, NotChecked=0, Total=56 [2018-04-10 14:00:51,416 INFO L87 Difference]: Start difference. First operand 319 states and 358 transitions. Second operand 8 states. [2018-04-10 14:00:51,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:51,590 INFO L93 Difference]: Finished difference Result 360 states and 399 transitions. [2018-04-10 14:00:51,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 14:00:51,590 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2018-04-10 14:00:51,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:51,591 INFO L225 Difference]: With dead ends: 360 [2018-04-10 14:00:51,591 INFO L226 Difference]: Without dead ends: 328 [2018-04-10 14:00:51,591 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=72, Unknown=4, NotChecked=0, Total=110 [2018-04-10 14:00:51,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-04-10 14:00:51,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 327. [2018-04-10 14:00:51,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-04-10 14:00:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 366 transitions. [2018-04-10 14:00:51,595 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 366 transitions. Word has length 59 [2018-04-10 14:00:51,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:51,595 INFO L459 AbstractCegarLoop]: Abstraction has 327 states and 366 transitions. [2018-04-10 14:00:51,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:00:51,595 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 366 transitions. [2018-04-10 14:00:51,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-10 14:00:51,596 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:51,596 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:51,596 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:51,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1110895995, now seen corresponding path program 1 times [2018-04-10 14:00:51,596 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:51,597 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:51,597 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:51,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:51,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:51,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:51,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 14:00:51,657 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:51,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:00:51,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 14:00:51,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 14:00:51,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:00:51,657 INFO L87 Difference]: Start difference. First operand 327 states and 366 transitions. Second operand 7 states. [2018-04-10 14:00:51,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:51,859 INFO L93 Difference]: Finished difference Result 351 states and 385 transitions. [2018-04-10 14:00:51,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:00:51,860 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2018-04-10 14:00:51,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:51,860 INFO L225 Difference]: With dead ends: 351 [2018-04-10 14:00:51,860 INFO L226 Difference]: Without dead ends: 351 [2018-04-10 14:00:51,861 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-04-10 14:00:51,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-04-10 14:00:51,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 327. [2018-04-10 14:00:51,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-04-10 14:00:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 365 transitions. [2018-04-10 14:00:51,864 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 365 transitions. Word has length 64 [2018-04-10 14:00:51,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:51,864 INFO L459 AbstractCegarLoop]: Abstraction has 327 states and 365 transitions. [2018-04-10 14:00:51,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 14:00:51,864 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 365 transitions. [2018-04-10 14:00:51,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-10 14:00:51,864 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:51,864 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:51,865 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:51,865 INFO L82 PathProgramCache]: Analyzing trace with hash 277588261, now seen corresponding path program 1 times [2018-04-10 14:00:51,865 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:51,865 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:51,865 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:51,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:51,865 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:51,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:51,905 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:00:51,905 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:51,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 14:00:51,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:00:51,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:00:51,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:00:51,906 INFO L87 Difference]: Start difference. First operand 327 states and 365 transitions. Second operand 6 states. [2018-04-10 14:00:52,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:52,002 INFO L93 Difference]: Finished difference Result 318 states and 350 transitions. [2018-04-10 14:00:52,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:00:52,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-04-10 14:00:52,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:52,003 INFO L225 Difference]: With dead ends: 318 [2018-04-10 14:00:52,003 INFO L226 Difference]: Without dead ends: 318 [2018-04-10 14:00:52,003 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:00:52,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-04-10 14:00:52,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-04-10 14:00:52,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-04-10 14:00:52,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 350 transitions. [2018-04-10 14:00:52,007 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 350 transitions. Word has length 64 [2018-04-10 14:00:52,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:52,007 INFO L459 AbstractCegarLoop]: Abstraction has 318 states and 350 transitions. [2018-04-10 14:00:52,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:00:52,007 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 350 transitions. [2018-04-10 14:00:52,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-10 14:00:52,008 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:52,008 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:52,008 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:52,008 INFO L82 PathProgramCache]: Analyzing trace with hash -572572864, now seen corresponding path program 1 times [2018-04-10 14:00:52,008 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:52,008 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:52,009 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:52,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:52,009 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:52,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:52,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-10 14:00:52,128 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:52,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-10 14:00:52,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 14:00:52,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 14:00:52,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-04-10 14:00:52,129 INFO L87 Difference]: Start difference. First operand 318 states and 350 transitions. Second operand 10 states. [2018-04-10 14:00:52,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:52,402 INFO L93 Difference]: Finished difference Result 454 states and 504 transitions. [2018-04-10 14:00:52,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 14:00:52,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2018-04-10 14:00:52,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:52,403 INFO L225 Difference]: With dead ends: 454 [2018-04-10 14:00:52,403 INFO L226 Difference]: Without dead ends: 454 [2018-04-10 14:00:52,403 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2018-04-10 14:00:52,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-04-10 14:00:52,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 288. [2018-04-10 14:00:52,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-04-10 14:00:52,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 318 transitions. [2018-04-10 14:00:52,406 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 318 transitions. Word has length 66 [2018-04-10 14:00:52,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:52,406 INFO L459 AbstractCegarLoop]: Abstraction has 288 states and 318 transitions. [2018-04-10 14:00:52,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 14:00:52,406 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 318 transitions. [2018-04-10 14:00:52,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-10 14:00:52,407 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:52,407 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:52,407 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:52,407 INFO L82 PathProgramCache]: Analyzing trace with hash -167614952, now seen corresponding path program 1 times [2018-04-10 14:00:52,407 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:52,407 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:52,408 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:52,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:52,408 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:52,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:52,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 14:00:52,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:52,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 14:00:52,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 14:00:52,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 14:00:52,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:00:52,520 INFO L87 Difference]: Start difference. First operand 288 states and 318 transitions. Second operand 9 states. [2018-04-10 14:00:52,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:52,857 INFO L93 Difference]: Finished difference Result 455 states and 505 transitions. [2018-04-10 14:00:52,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 14:00:52,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2018-04-10 14:00:52,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:52,859 INFO L225 Difference]: With dead ends: 455 [2018-04-10 14:00:52,859 INFO L226 Difference]: Without dead ends: 455 [2018-04-10 14:00:52,860 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-04-10 14:00:52,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-04-10 14:00:52,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 291. [2018-04-10 14:00:52,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-04-10 14:00:52,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 321 transitions. [2018-04-10 14:00:52,865 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 321 transitions. Word has length 69 [2018-04-10 14:00:52,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:52,865 INFO L459 AbstractCegarLoop]: Abstraction has 291 states and 321 transitions. [2018-04-10 14:00:52,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 14:00:52,866 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 321 transitions. [2018-04-10 14:00:52,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-10 14:00:52,866 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:52,866 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:52,867 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:52,867 INFO L82 PathProgramCache]: Analyzing trace with hash 309824900, now seen corresponding path program 1 times [2018-04-10 14:00:52,867 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:52,867 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:52,868 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:52,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:52,868 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:52,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:52,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:00:52,903 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:00:52,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:00:52,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:00:52,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:00:52,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:00:52,904 INFO L87 Difference]: Start difference. First operand 291 states and 321 transitions. Second operand 5 states. [2018-04-10 14:00:52,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:52,962 INFO L93 Difference]: Finished difference Result 307 states and 338 transitions. [2018-04-10 14:00:52,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:00:52,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-04-10 14:00:52,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:52,963 INFO L225 Difference]: With dead ends: 307 [2018-04-10 14:00:52,963 INFO L226 Difference]: Without dead ends: 307 [2018-04-10 14:00:52,963 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:00:52,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-04-10 14:00:52,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 295. [2018-04-10 14:00:52,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-04-10 14:00:52,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 325 transitions. [2018-04-10 14:00:52,966 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 325 transitions. Word has length 69 [2018-04-10 14:00:52,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:52,967 INFO L459 AbstractCegarLoop]: Abstraction has 295 states and 325 transitions. [2018-04-10 14:00:52,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:00:52,967 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 325 transitions. [2018-04-10 14:00:52,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-04-10 14:00:52,967 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:52,968 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:52,968 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:52,968 INFO L82 PathProgramCache]: Analyzing trace with hash 2136016223, now seen corresponding path program 1 times [2018-04-10 14:00:52,968 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:52,968 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:52,969 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:52,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:52,969 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:52,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:53,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:00:53,430 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:00:53,430 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:00:53,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:53,453 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:00:53,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 14:00:53,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 14:00:53,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:53,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 14:00:53,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 10 treesize of output 9 [2018-04-10 14:00:53,518 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:53,520 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:53,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:53,525 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-04-10 14:00:53,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:53,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:53,567 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-10 14:00:53,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:53,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:53,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:35 [2018-04-10 14:00:53,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-10 14:00:53,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:53,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:00:53,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:53,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:53,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-10 14:00:53,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:53,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:00:53,621 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:53,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:53,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:53,633 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:39 [2018-04-10 14:00:53,683 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:53,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-04-10 14:00:53,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:00:53,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:53,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:53,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:53,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 56 [2018-04-10 14:00:53,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 14 treesize of output 13 [2018-04-10 14:00:53,708 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:53,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:53,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:00:53,720 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:81, output treesize:65 [2018-04-10 14:00:53,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2018-04-10 14:00:53,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:00:53,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:00:53,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:00:53,904 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:00:53,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 74 [2018-04-10 14:00:53,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-04-10 14:00:53,908 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:53,917 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:53,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 79 [2018-04-10 14:00:53,925 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:00:53,925 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 20 treesize of output 28 [2018-04-10 14:00:53,925 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:53,935 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:53,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:00:53,957 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:88, output treesize:145 [2018-04-10 14:00:54,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-04-10 14:00:54,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:54,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 14:00:54,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:54,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:54,047 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 42 treesize of output 37 [2018-04-10 14:00:54,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:54,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 14:00:54,049 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:54,064 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:54,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:00:54,073 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:97, output treesize:81 [2018-04-10 14:00:54,186 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 58 [2018-04-10 14:00:54,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:54,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 30 [2018-04-10 14:00:54,190 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:00:54,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:54,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 14:00:54,199 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:54,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:00:54,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-04-10 14:00:54,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-10 14:00:54,217 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:54,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:54,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 14:00:54,224 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:54,226 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:54,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:54,231 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:99, output treesize:7 [2018-04-10 14:00:54,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:00:54,289 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:00:54,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 33 [2018-04-10 14:00:54,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-10 14:00:54,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-10 14:00:54,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=910, Unknown=1, NotChecked=0, Total=1056 [2018-04-10 14:00:54,290 INFO L87 Difference]: Start difference. First operand 295 states and 325 transitions. Second operand 33 states. [2018-04-10 14:00:56,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:56,217 INFO L93 Difference]: Finished difference Result 614 states and 666 transitions. [2018-04-10 14:00:56,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-10 14:00:56,217 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 71 [2018-04-10 14:00:56,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:56,218 INFO L225 Difference]: With dead ends: 614 [2018-04-10 14:00:56,218 INFO L226 Difference]: Without dead ends: 614 [2018-04-10 14:00:56,219 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=912, Invalid=3915, Unknown=3, NotChecked=0, Total=4830 [2018-04-10 14:00:56,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-04-10 14:00:56,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 343. [2018-04-10 14:00:56,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-04-10 14:00:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 376 transitions. [2018-04-10 14:00:56,222 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 376 transitions. Word has length 71 [2018-04-10 14:00:56,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:56,222 INFO L459 AbstractCegarLoop]: Abstraction has 343 states and 376 transitions. [2018-04-10 14:00:56,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-10 14:00:56,222 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 376 transitions. [2018-04-10 14:00:56,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-10 14:00:56,222 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:56,223 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:56,223 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:56,223 INFO L82 PathProgramCache]: Analyzing trace with hash -398625105, now seen corresponding path program 1 times [2018-04-10 14:00:56,223 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:56,223 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:56,223 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:56,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:56,223 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:56,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:56,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:00:56,517 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:00:56,517 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:00:56,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:56,548 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:00:56,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-04-10 14:00:56,678 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 20 treesize of output 19 [2018-04-10 14:00:56,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:56,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2018-04-10 14:00:56,696 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 14:00:56,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:00:56,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:00:56,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:00:56,724 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:56,726 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:56,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:00:56,739 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:49, output treesize:82 [2018-04-10 14:00:56,802 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 52 treesize of output 47 [2018-04-10 14:00:56,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:56,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:00:56,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:56,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:56,844 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 48 treesize of output 43 [2018-04-10 14:00:56,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:56,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:00:56,846 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:56,852 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:56,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 85 [2018-04-10 14:00:56,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:56,889 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 83 treesize of output 94 [2018-04-10 14:00:56,889 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:56,920 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:56,942 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 80 treesize of output 67 [2018-04-10 14:00:56,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:56,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 14:00:56,944 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:56,953 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:56,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:00:56,970 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:141, output treesize:117 [2018-04-10 14:00:57,060 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 58 treesize of output 52 [2018-04-10 14:00:57,062 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:57,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-10 14:00:57,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:57,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:57,093 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 38 treesize of output 32 [2018-04-10 14:00:57,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:57,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-10 14:00:57,097 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:57,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:57,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 86 treesize of output 74 [2018-04-10 14:00:57,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:57,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2018-04-10 14:00:57,127 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:57,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:57,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:57,156 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 1 case distinctions, treesize of input 66 treesize of output 63 [2018-04-10 14:00:57,157 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-10 14:00:57,192 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 58 treesize of output 47 [2018-04-10 14:00:57,192 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:57,220 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 14:00:57,257 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 46 treesize of output 48 [2018-04-10 14:00:57,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2018-04-10 14:00:57,263 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:57,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:57,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-04-10 14:00:57,282 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:57,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:57,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:57,305 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 1 case distinctions, treesize of input 40 treesize of output 43 [2018-04-10 14:00:57,305 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-10 14:00:57,331 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 14:00:57,332 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 47 treesize of output 41 [2018-04-10 14:00:57,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:00:57,334 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:57,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:57,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 14:00:57,342 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:57,346 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:57,365 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 47 treesize of output 49 [2018-04-10 14:00:57,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2018-04-10 14:00:57,367 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:57,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:57,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:57,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2018-04-10 14:00:57,388 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:57,402 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:57,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-10 14:00:57,429 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 9 variables, input treesize:145, output treesize:56 [2018-04-10 14:00:57,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:00:57,508 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:00:57,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-04-10 14:00:57,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 14:00:57,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 14:00:57,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2018-04-10 14:00:57,509 INFO L87 Difference]: Start difference. First operand 343 states and 376 transitions. Second operand 26 states. [2018-04-10 14:00:59,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:00:59,065 INFO L93 Difference]: Finished difference Result 683 states and 736 transitions. [2018-04-10 14:00:59,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 14:00:59,065 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 73 [2018-04-10 14:00:59,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:00:59,067 INFO L225 Difference]: With dead ends: 683 [2018-04-10 14:00:59,067 INFO L226 Difference]: Without dead ends: 683 [2018-04-10 14:00:59,067 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=668, Invalid=2300, Unknown=2, NotChecked=0, Total=2970 [2018-04-10 14:00:59,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-04-10 14:00:59,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 417. [2018-04-10 14:00:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-04-10 14:00:59,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 461 transitions. [2018-04-10 14:00:59,071 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 461 transitions. Word has length 73 [2018-04-10 14:00:59,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:00:59,071 INFO L459 AbstractCegarLoop]: Abstraction has 417 states and 461 transitions. [2018-04-10 14:00:59,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 14:00:59,071 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 461 transitions. [2018-04-10 14:00:59,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-10 14:00:59,071 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:00:59,072 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:00:59,072 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:00:59,072 INFO L82 PathProgramCache]: Analyzing trace with hash -398625104, now seen corresponding path program 1 times [2018-04-10 14:00:59,072 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:00:59,072 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:00:59,072 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:59,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:59,072 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:00:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:59,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:00:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:00:59,431 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:00:59,431 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:00:59,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:00:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:00:59,460 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:00:59,464 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-10 14:00:59,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:59,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:59,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 14:00:59,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:59,527 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-10 14:00:59,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:59,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:59,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:59,539 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-10 14:00:59,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:59,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:59,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-04-10 14:00:59,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:00:59,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:00:59,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:59,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:59,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:00:59,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:00:59,575 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:59,576 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:59,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:59,583 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-04-10 14:00:59,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:59,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2018-04-10 14:00:59,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 14 treesize of output 13 [2018-04-10 14:00:59,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:59,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:59,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:59,652 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-10 14:00:59,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:00:59,660 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:59,663 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:59,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:00:59,674 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:84, output treesize:68 [2018-04-10 14:00:59,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2018-04-10 14:00:59,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-04-10 14:00:59,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:00:59,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:00:59,839 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:00:59,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 87 [2018-04-10 14:00:59,847 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:00:59,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-10 14:00:59,848 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:59,858 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:59,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 100 [2018-04-10 14:00:59,896 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:00:59,897 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 20 treesize of output 38 [2018-04-10 14:00:59,897 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:59,908 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:00:59,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:00:59,934 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:101, output treesize:199 [2018-04-10 14:00:59,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 103 [2018-04-10 14:00:59,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:00:59,989 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 28 treesize of output 47 [2018-04-10 14:00:59,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:00:59,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:00,010 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 80 treesize of output 75 [2018-04-10 14:01:00,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:00,012 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 28 treesize of output 47 [2018-04-10 14:01:00,012 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:00,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:00,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:00,029 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:140, output treesize:100 [2018-04-10 14:01:00,093 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 89 treesize of output 67 [2018-04-10 14:01:00,095 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 47 treesize of output 34 [2018-04-10 14:01:00,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:00,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:00,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-10 14:01:00,104 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:00,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:00,116 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 39 treesize of output 31 [2018-04-10 14:01:00,117 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 27 treesize of output 16 [2018-04-10 14:01:00,118 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:00,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:00,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 14:01:00,122 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:00,123 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:00,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:00,128 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:114, output treesize:18 [2018-04-10 14:01:00,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:01:00,273 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:01:00,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 29 [2018-04-10 14:01:00,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-10 14:01:00,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-10 14:01:00,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2018-04-10 14:01:00,273 INFO L87 Difference]: Start difference. First operand 417 states and 461 transitions. Second operand 30 states. [2018-04-10 14:01:02,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:01:02,829 INFO L93 Difference]: Finished difference Result 831 states and 896 transitions. [2018-04-10 14:01:02,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-10 14:01:02,829 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 73 [2018-04-10 14:01:02,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:01:02,831 INFO L225 Difference]: With dead ends: 831 [2018-04-10 14:01:02,831 INFO L226 Difference]: Without dead ends: 831 [2018-04-10 14:01:02,831 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1397 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1050, Invalid=3642, Unknown=0, NotChecked=0, Total=4692 [2018-04-10 14:01:02,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-04-10 14:01:02,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 516. [2018-04-10 14:01:02,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-04-10 14:01:02,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 577 transitions. [2018-04-10 14:01:02,836 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 577 transitions. Word has length 73 [2018-04-10 14:01:02,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:01:02,836 INFO L459 AbstractCegarLoop]: Abstraction has 516 states and 577 transitions. [2018-04-10 14:01:02,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-10 14:01:02,836 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 577 transitions. [2018-04-10 14:01:02,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-10 14:01:02,836 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:01:02,836 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:01:02,836 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:01:02,837 INFO L82 PathProgramCache]: Analyzing trace with hash 692807353, now seen corresponding path program 1 times [2018-04-10 14:01:02,837 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:01:02,837 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:01:02,837 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:01:02,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:01:02,837 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:01:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:01:02,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:01:03,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:01:03,173 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:01:03,174 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:01:03,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:01:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:01:03,196 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:01:03,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:03,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:03,217 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-10 14:01:03,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:03,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:03,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-10 14:01:03,237 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 13 treesize of output 10 [2018-04-10 14:01:03,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 14:01:03,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:03,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:03,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:03,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-10 14:01:03,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-10 14:01:03,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:01:03,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:03,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:03,288 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-10 14:01:03,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-10 14:01:03,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2018-04-10 14:01:03,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-10 14:01:03,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:03,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:03,349 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-10 14:01:03,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:58 [2018-04-10 14:01:07,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:07,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:07,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:07,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 58 [2018-04-10 14:01:07,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:07,424 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-10 14:01:07,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:70 [2018-04-10 14:01:07,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2018-04-10 14:01:07,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:07,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 70 [2018-04-10 14:01:07,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:07,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:07,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:07,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-04-10 14:01:07,607 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:07,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:07,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 120 [2018-04-10 14:01:07,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:01:07,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:07,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:07,636 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-10 14:01:07,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:95 [2018-04-10 14:01:07,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 107 [2018-04-10 14:01:07,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:01:07,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:01:07,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:01:07,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:01:07,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:182 [2018-04-10 14:01:08,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 93 [2018-04-10 14:01:08,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:08,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 14:01:08,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:08,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:08,030 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-10 14:01:08,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:108, output treesize:100 [2018-04-10 14:01:08,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 64 [2018-04-10 14:01:08,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2018-04-10 14:01:08,164 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:08,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:08,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 14:01:08,179 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:08,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 14:01:08,186 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:08,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:08,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:08,196 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:28 [2018-04-10 14:01:08,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:01:08,323 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:01:08,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 38 [2018-04-10 14:01:08,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-10 14:01:08,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-10 14:01:08,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1240, Unknown=3, NotChecked=0, Total=1482 [2018-04-10 14:01:08,324 INFO L87 Difference]: Start difference. First operand 516 states and 577 transitions. Second operand 39 states. [2018-04-10 14:01:29,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:01:29,947 INFO L93 Difference]: Finished difference Result 990 states and 1102 transitions. [2018-04-10 14:01:29,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-10 14:01:29,947 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-04-10 14:01:29,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:01:29,949 INFO L225 Difference]: With dead ends: 990 [2018-04-10 14:01:29,949 INFO L226 Difference]: Without dead ends: 990 [2018-04-10 14:01:29,949 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=1079, Invalid=4309, Unknown=14, NotChecked=0, Total=5402 [2018-04-10 14:01:29,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2018-04-10 14:01:29,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 532. [2018-04-10 14:01:29,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-04-10 14:01:29,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 596 transitions. [2018-04-10 14:01:29,954 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 596 transitions. Word has length 76 [2018-04-10 14:01:29,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:01:29,954 INFO L459 AbstractCegarLoop]: Abstraction has 532 states and 596 transitions. [2018-04-10 14:01:29,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-10 14:01:29,954 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 596 transitions. [2018-04-10 14:01:29,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-10 14:01:29,955 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:01:29,955 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:01:29,955 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:01:29,955 INFO L82 PathProgramCache]: Analyzing trace with hash 692807354, now seen corresponding path program 1 times [2018-04-10 14:01:29,955 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:01:29,955 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:01:29,956 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:01:29,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:01:29,956 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:01:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:01:29,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:01:30,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:01:30,573 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:01:30,573 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:01:30,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:01:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:01:30,595 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:01:30,630 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-10 14:01:30,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:30,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:30,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:30,638 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-10 14:01:30,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:30,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:30,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-10 14:01:30,665 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 13 treesize of output 10 [2018-04-10 14:01:30,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 14:01:30,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:30,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:30,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 14:01:30,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 14:01:30,679 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:30,680 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:30,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:30,686 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:53 [2018-04-10 14:01:30,737 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 33 treesize of output 34 [2018-04-10 14:01:30,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:01:30,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:30,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:30,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2018-04-10 14:01:30,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:01:30,756 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:30,761 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:30,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:30,769 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:99, output treesize:79 [2018-04-10 14:01:30,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 95 [2018-04-10 14:01:30,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-10 14:01:30,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:30,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:30,867 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 48 treesize of output 41 [2018-04-10 14:01:30,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-10 14:01:30,870 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:30,874 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:30,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:30,884 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:129, output treesize:109 [2018-04-10 14:01:36,949 WARN L151 SmtUtils]: Spent 2019ms on a formula simplification. DAG size of input: 44 DAG size of output 37 [2018-04-10 14:01:36,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:37,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-10 14:01:37,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:37,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:37,020 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:37,020 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:37,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-10 14:01:37,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:37,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:37,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:92 [2018-04-10 14:01:37,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 44 [2018-04-10 14:01:37,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:37,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:01:37,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:37,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:37,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 74 [2018-04-10 14:01:37,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:37,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 85 [2018-04-10 14:01:37,103 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:37,110 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:37,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:37,126 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:114, output treesize:104 [2018-04-10 14:01:37,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:37,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:37,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 71 [2018-04-10 14:01:37,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:01:37,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:37,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:37,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:37,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:37,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 148 [2018-04-10 14:01:37,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:01:37,249 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:37,260 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:37,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:37,274 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:146, output treesize:130 [2018-04-10 14:01:37,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 75 [2018-04-10 14:01:37,452 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:01:37,452 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 20 treesize of output 28 [2018-04-10 14:01:37,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:37,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:37,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 146 [2018-04-10 14:01:37,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:01:37,492 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 14:01:37,512 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:01:37,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:01:37,552 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:153, output treesize:261 [2018-04-10 14:01:37,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 76 [2018-04-10 14:01:37,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:37,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 14:01:37,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:37,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:37,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 132 [2018-04-10 14:01:37,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:37,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 14:01:37,697 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:37,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:37,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:37,730 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:162, output treesize:146 [2018-04-10 14:01:37,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 105 [2018-04-10 14:01:37,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 54 [2018-04-10 14:01:37,916 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:37,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:37,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 14:01:37,931 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:37,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 14:01:37,942 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:37,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:37,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 46 [2018-04-10 14:01:37,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:37,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 14:01:37,969 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:37,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-10 14:01:37,976 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:37,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 14:01:37,980 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:37,981 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:37,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:37,988 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:164, output treesize:18 [2018-04-10 14:01:38,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:01:38,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:01:38,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 40 [2018-04-10 14:01:38,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-10 14:01:38,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-10 14:01:38,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1427, Unknown=2, NotChecked=0, Total=1640 [2018-04-10 14:01:38,118 INFO L87 Difference]: Start difference. First operand 532 states and 596 transitions. Second operand 41 states. [2018-04-10 14:01:40,492 WARN L151 SmtUtils]: Spent 2036ms on a formula simplification. DAG size of input: 65 DAG size of output 52 [2018-04-10 14:01:41,148 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 116 DAG size of output 87 [2018-04-10 14:01:44,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:01:44,025 INFO L93 Difference]: Finished difference Result 1140 states and 1267 transitions. [2018-04-10 14:01:44,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-10 14:01:44,025 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 76 [2018-04-10 14:01:44,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:01:44,027 INFO L225 Difference]: With dead ends: 1140 [2018-04-10 14:01:44,027 INFO L226 Difference]: Without dead ends: 1140 [2018-04-10 14:01:44,028 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2075 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1318, Invalid=5987, Unknown=5, NotChecked=0, Total=7310 [2018-04-10 14:01:44,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2018-04-10 14:01:44,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 539. [2018-04-10 14:01:44,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-04-10 14:01:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 602 transitions. [2018-04-10 14:01:44,033 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 602 transitions. Word has length 76 [2018-04-10 14:01:44,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:01:44,033 INFO L459 AbstractCegarLoop]: Abstraction has 539 states and 602 transitions. [2018-04-10 14:01:44,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-10 14:01:44,033 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 602 transitions. [2018-04-10 14:01:44,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-10 14:01:44,033 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:01:44,033 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:01:44,034 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:01:44,034 INFO L82 PathProgramCache]: Analyzing trace with hash 246978595, now seen corresponding path program 1 times [2018-04-10 14:01:44,034 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:01:44,034 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:01:44,034 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:01:44,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:01:44,034 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:01:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:01:44,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:01:44,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 14:01:44,344 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:01:44,344 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:01:44,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:01:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:01:44,366 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:01:44,438 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-10 14:01:44,442 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-10 14:01:44,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:01:44,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:01:44,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:01:44,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-10 14:01:44,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:01:44,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:01:44,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 23 [2018-04-10 14:01:44,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 14:01:44,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 14:01:44,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2018-04-10 14:01:44,544 INFO L87 Difference]: Start difference. First operand 539 states and 602 transitions. Second operand 23 states. [2018-04-10 14:01:47,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:01:47,631 INFO L93 Difference]: Finished difference Result 737 states and 807 transitions. [2018-04-10 14:01:47,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-10 14:01:47,632 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 79 [2018-04-10 14:01:47,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:01:47,633 INFO L225 Difference]: With dead ends: 737 [2018-04-10 14:01:47,633 INFO L226 Difference]: Without dead ends: 638 [2018-04-10 14:01:47,634 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=521, Invalid=3639, Unknown=0, NotChecked=0, Total=4160 [2018-04-10 14:01:47,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-04-10 14:01:47,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 586. [2018-04-10 14:01:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2018-04-10 14:01:47,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 672 transitions. [2018-04-10 14:01:47,637 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 672 transitions. Word has length 79 [2018-04-10 14:01:47,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:01:47,637 INFO L459 AbstractCegarLoop]: Abstraction has 586 states and 672 transitions. [2018-04-10 14:01:47,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 14:01:47,637 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 672 transitions. [2018-04-10 14:01:47,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-10 14:01:47,638 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:01:47,638 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:01:47,638 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:01:47,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1394186197, now seen corresponding path program 1 times [2018-04-10 14:01:47,638 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:01:47,638 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:01:47,639 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:01:47,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:01:47,639 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:01:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:01:47,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:01:48,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:01:48,402 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:01:48,402 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:01:48,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:01:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:01:48,435 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:01:48,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:48,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:48,483 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-10 14:01:48,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:48,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:48,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-10 14:01:48,510 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 13 treesize of output 10 [2018-04-10 14:01:48,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 14:01:48,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:48,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:48,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:48,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-10 14:01:48,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-10 14:01:48,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 14 treesize of output 13 [2018-04-10 14:01:48,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:48,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:48,576 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-10 14:01:48,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-10 14:01:48,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2018-04-10 14:01:48,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-10 14:01:48,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:48,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:48,657 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-10 14:01:48,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:58 [2018-04-10 14:01:52,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:52,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:52,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:52,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 58 [2018-04-10 14:01:52,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:52,758 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-10 14:01:52,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:70 [2018-04-10 14:01:52,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2018-04-10 14:01:52,807 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:52,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 70 [2018-04-10 14:01:52,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:52,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:52,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:52,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-04-10 14:01:52,921 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:52,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:52,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 120 [2018-04-10 14:01:52,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:01:52,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:52,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:52,956 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-10 14:01:52,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:95 [2018-04-10 14:01:53,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 107 [2018-04-10 14:01:53,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:01:53,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:01:53,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:01:53,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:01:53,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:182 [2018-04-10 14:01:53,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:53,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:53,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:53,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:53,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 97 [2018-04-10 14:01:53,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:53,273 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-10 14:01:53,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:97, output treesize:113 [2018-04-10 14:01:53,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:53,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 111 [2018-04-10 14:01:53,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:53,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:01:53,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:53,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:53,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:53,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:126, output treesize:137 [2018-04-10 14:01:53,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:53,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 163 [2018-04-10 14:01:53,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:01:53,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:53,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:53,536 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-10 14:01:53,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:160, output treesize:150 [2018-04-10 14:01:53,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 160 [2018-04-10 14:01:53,704 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 26 treesize of output 37 [2018-04-10 14:01:53,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:53,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:01:53,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:53,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:204, output treesize:190 [2018-04-10 14:01:57,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 113 [2018-04-10 14:01:57,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:01:57,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 28 [2018-04-10 14:01:57,340 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:57,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 14:01:57,354 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:57,366 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 13 treesize of output 1 [2018-04-10 14:01:57,366 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:01:57,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 31 [2018-04-10 14:01:57,376 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:57,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:57,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 14:01:57,390 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:184, output treesize:45 [2018-04-10 14:01:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:01:57,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:01:57,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 53 [2018-04-10 14:01:57,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-10 14:01:57,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-10 14:01:57,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=2404, Unknown=9, NotChecked=0, Total=2862 [2018-04-10 14:01:57,541 INFO L87 Difference]: Start difference. First operand 586 states and 672 transitions. Second operand 54 states. [2018-04-10 14:02:32,756 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 101 DAG size of output 94 [2018-04-10 14:02:38,959 WARN L151 SmtUtils]: Spent 4125ms on a formula simplification. DAG size of input: 107 DAG size of output 100 [2018-04-10 14:02:49,177 WARN L151 SmtUtils]: Spent 4155ms on a formula simplification. DAG size of input: 103 DAG size of output 96 [2018-04-10 14:02:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:02:58,574 INFO L93 Difference]: Finished difference Result 1399 states and 1615 transitions. [2018-04-10 14:02:58,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-10 14:02:58,575 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 81 [2018-04-10 14:02:58,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:02:58,577 INFO L225 Difference]: With dead ends: 1399 [2018-04-10 14:02:58,577 INFO L226 Difference]: Without dead ends: 1399 [2018-04-10 14:02:58,579 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3268 ImplicationChecksByTransitivity, 55.9s TimeCoverageRelationStatistics Valid=2470, Invalid=10152, Unknown=34, NotChecked=0, Total=12656 [2018-04-10 14:02:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2018-04-10 14:02:58,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 586. [2018-04-10 14:02:58,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2018-04-10 14:02:58,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 671 transitions. [2018-04-10 14:02:58,591 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 671 transitions. Word has length 81 [2018-04-10 14:02:58,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:02:58,591 INFO L459 AbstractCegarLoop]: Abstraction has 586 states and 671 transitions. [2018-04-10 14:02:58,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-10 14:02:58,591 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 671 transitions. [2018-04-10 14:02:58,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-10 14:02:58,591 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:02:58,592 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:02:58,592 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:02:58,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1394186196, now seen corresponding path program 1 times [2018-04-10 14:02:58,592 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:02:58,592 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:02:58,592 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:02:58,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:02:58,593 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:02:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:02:58,610 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:02:59,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:02:59,482 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:02:59,482 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:02:59,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:02:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:02:59,516 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:02:59,546 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-10 14:02:59,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:59,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:02:59,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:02:59,553 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-10 14:02:59,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:59,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:59,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-04-10 14:02:59,585 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 13 treesize of output 10 [2018-04-10 14:02:59,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 14:02:59,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:59,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:59,595 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 13 treesize of output 10 [2018-04-10 14:02:59,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 14:02:59,596 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:59,597 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:59,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:59,603 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:50 [2018-04-10 14:02:59,636 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 33 treesize of output 34 [2018-04-10 14:02:59,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:02:59,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:59,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:59,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2018-04-10 14:02:59,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:02:59,652 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:59,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:59,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:02:59,665 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:96, output treesize:76 [2018-04-10 14:02:59,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 95 [2018-04-10 14:02:59,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-10 14:02:59,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:59,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:59,764 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 48 treesize of output 41 [2018-04-10 14:02:59,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-10 14:02:59,766 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:02:59,771 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:02:59,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:02:59,781 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:126, output treesize:106 [2018-04-10 14:03:05,836 WARN L151 SmtUtils]: Spent 2022ms on a formula simplification. DAG size of input: 43 DAG size of output 36 [2018-04-10 14:03:05,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:05,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-10 14:03:05,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:05,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:05,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:05,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:05,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 58 [2018-04-10 14:03:05,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:05,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:03:05,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:110 [2018-04-10 14:03:05,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 83 [2018-04-10 14:03:05,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:05,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 96 [2018-04-10 14:03:05,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:05,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:06,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 44 [2018-04-10 14:03:06,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:06,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:03:06,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:06,021 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:06,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:03:06,037 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:132, output treesize:126 [2018-04-10 14:03:06,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:06,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:06,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 176 [2018-04-10 14:03:06,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:03:06,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:06,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:06,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:06,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:06,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 71 [2018-04-10 14:03:06,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:03:06,216 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:06,221 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:06,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:03:06,239 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:168, output treesize:152 [2018-04-10 14:03:06,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 75 [2018-04-10 14:03:06,437 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:03:06,438 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 20 treesize of output 28 [2018-04-10 14:03:06,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:06,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:06,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 166 [2018-04-10 14:03:06,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:03:06,483 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 14:03:06,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:03:06,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:03:06,552 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:175, output treesize:305 [2018-04-10 14:03:06,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:06,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:06,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:06,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:06,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 55 [2018-04-10 14:03:06,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:06,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-04-10 14:03:06,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:06,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:03:06,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:152, output treesize:143 [2018-04-10 14:03:06,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:06,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 137 [2018-04-10 14:03:06,799 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:06,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:03:06,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:06,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:06,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 75 [2018-04-10 14:03:06,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:06,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 14:03:06,850 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:06,858 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:06,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:03:06,881 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:169, output treesize:167 [2018-04-10 14:03:07,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 122 [2018-04-10 14:03:07,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:03:07,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:07,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:07,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:07,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 202 [2018-04-10 14:03:07,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:03:07,077 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:07,097 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:07,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:03:07,118 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:213, output treesize:193 [2018-04-10 14:03:07,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 145 [2018-04-10 14:03:07,301 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 26 treesize of output 37 [2018-04-10 14:03:07,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:07,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:07,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 214 [2018-04-10 14:03:07,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-04-10 14:03:07,359 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:07,379 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:07,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 14:03:07,405 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:284, output treesize:256 [2018-04-10 14:03:11,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 157 [2018-04-10 14:03:11,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:11,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 44 [2018-04-10 14:03:11,656 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:03:11,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 14:03:11,675 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:11,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 47 [2018-04-10 14:03:11,693 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:03:11,710 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 13 treesize of output 1 [2018-04-10 14:03:11,710 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:11,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:03:11,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 59 [2018-04-10 14:03:11,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:03:11,741 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:11,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 14:03:11,750 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:11,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:03:11,755 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:11,759 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 13 treesize of output 1 [2018-04-10 14:03:11,759 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:11,760 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:11,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:03:11,767 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:253, output treesize:31 [2018-04-10 14:03:11,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:03:11,932 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:03:11,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 48 [2018-04-10 14:03:11,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-10 14:03:11,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-10 14:03:11,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=2078, Unknown=4, NotChecked=0, Total=2352 [2018-04-10 14:03:11,933 INFO L87 Difference]: Start difference. First operand 586 states and 671 transitions. Second operand 49 states. [2018-04-10 14:03:14,372 WARN L151 SmtUtils]: Spent 2027ms on a formula simplification. DAG size of input: 57 DAG size of output 49 [2018-04-10 14:03:15,167 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 136 DAG size of output 92 [2018-04-10 14:03:15,482 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 159 DAG size of output 92 [2018-04-10 14:03:16,180 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 108 DAG size of output 96 [2018-04-10 14:03:16,379 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 114 DAG size of output 100 [2018-04-10 14:03:20,762 WARN L151 SmtUtils]: Spent 4185ms on a formula simplification. DAG size of input: 152 DAG size of output 134 [2018-04-10 14:03:24,980 WARN L151 SmtUtils]: Spent 4176ms on a formula simplification. DAG size of input: 147 DAG size of output 131 [2018-04-10 14:03:25,194 WARN L151 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 151 DAG size of output 135 [2018-04-10 14:03:25,469 WARN L151 SmtUtils]: Spent 182ms on a formula simplification. DAG size of input: 149 DAG size of output 135 [2018-04-10 14:03:29,702 WARN L151 SmtUtils]: Spent 4186ms on a formula simplification. DAG size of input: 145 DAG size of output 131 [2018-04-10 14:03:30,237 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 188 DAG size of output 101 [2018-04-10 14:03:31,084 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 207 DAG size of output 107 [2018-04-10 14:03:31,273 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 207 DAG size of output 107 [2018-04-10 14:03:34,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:03:34,070 INFO L93 Difference]: Finished difference Result 1399 states and 1611 transitions. [2018-04-10 14:03:34,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-10 14:03:34,070 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 81 [2018-04-10 14:03:34,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:03:34,072 INFO L225 Difference]: With dead ends: 1399 [2018-04-10 14:03:34,073 INFO L226 Difference]: Without dead ends: 1399 [2018-04-10 14:03:34,073 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2438 ImplicationChecksByTransitivity, 30.7s TimeCoverageRelationStatistics Valid=1502, Invalid=8000, Unknown=4, NotChecked=0, Total=9506 [2018-04-10 14:03:34,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2018-04-10 14:03:34,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 563. [2018-04-10 14:03:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-04-10 14:03:34,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 643 transitions. [2018-04-10 14:03:34,078 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 643 transitions. Word has length 81 [2018-04-10 14:03:34,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:03:34,078 INFO L459 AbstractCegarLoop]: Abstraction has 563 states and 643 transitions. [2018-04-10 14:03:34,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-10 14:03:34,078 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 643 transitions. [2018-04-10 14:03:34,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-10 14:03:34,079 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:03:34,079 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:03:34,079 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:03:34,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1486032057, now seen corresponding path program 1 times [2018-04-10 14:03:34,079 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:03:34,079 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:03:34,080 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:03:34,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:03:34,080 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:03:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:03:34,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:03:34,788 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:03:34,788 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:03:34,788 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:03:34,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:03:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:03:34,815 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:03:34,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:34,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:34,839 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-10 14:03:34,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:34,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:34,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:03:34,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:03:34,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:03:34,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:34,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:34,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:03:34,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:03:34,867 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:34,868 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:34,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:34,872 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-04-10 14:03:34,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:34,910 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-10 14:03:34,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:03:34,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:34,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:34,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:34,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2018-04-10 14:03:34,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:03:34,925 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:34,929 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:34,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:03:34,934 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:48 [2018-04-10 14:03:35,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 45 [2018-04-10 14:03:35,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 39 [2018-04-10 14:03:35,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:03:35,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:03:35,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 73 [2018-04-10 14:03:35,069 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:03:35,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-04-10 14:03:35,070 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:35,082 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:35,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2018-04-10 14:03:35,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-04-10 14:03:35,092 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 14:03:35,104 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:03:35,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:03:35,125 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:81, output treesize:135 [2018-04-10 14:03:35,170 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 88 treesize of output 83 [2018-04-10 14:03:35,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:35,172 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 28 treesize of output 47 [2018-04-10 14:03:35,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:35,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:35,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 71 [2018-04-10 14:03:35,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:35,198 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 28 treesize of output 47 [2018-04-10 14:03:35,198 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:35,206 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:35,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:35,212 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:96, output treesize:80 [2018-04-10 14:03:35,327 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 86 [2018-04-10 14:03:35,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:35,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-04-10 14:03:35,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:35,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-04-10 14:03:35,335 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:03:35,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:03:35,346 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 52 treesize of output 40 [2018-04-10 14:03:35,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:35,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-04-10 14:03:35,347 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:35,352 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 16 treesize of output 7 [2018-04-10 14:03:35,352 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:35,354 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:35,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:35,356 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:114, output treesize:7 [2018-04-10 14:03:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:03:35,409 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:03:35,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 35 [2018-04-10 14:03:35,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 14:03:35,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 14:03:35,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1095, Unknown=2, NotChecked=0, Total=1190 [2018-04-10 14:03:35,410 INFO L87 Difference]: Start difference. First operand 563 states and 643 transitions. Second operand 35 states. [2018-04-10 14:03:37,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:03:37,590 INFO L93 Difference]: Finished difference Result 783 states and 884 transitions. [2018-04-10 14:03:37,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 14:03:37,590 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 82 [2018-04-10 14:03:37,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:03:37,592 INFO L225 Difference]: With dead ends: 783 [2018-04-10 14:03:37,592 INFO L226 Difference]: Without dead ends: 783 [2018-04-10 14:03:37,592 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=543, Invalid=3487, Unknown=2, NotChecked=0, Total=4032 [2018-04-10 14:03:37,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-04-10 14:03:37,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 617. [2018-04-10 14:03:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-04-10 14:03:37,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 701 transitions. [2018-04-10 14:03:37,595 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 701 transitions. Word has length 82 [2018-04-10 14:03:37,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:03:37,595 INFO L459 AbstractCegarLoop]: Abstraction has 617 states and 701 transitions. [2018-04-10 14:03:37,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 14:03:37,596 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 701 transitions. [2018-04-10 14:03:37,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-10 14:03:37,596 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:03:37,596 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:03:37,596 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:03:37,596 INFO L82 PathProgramCache]: Analyzing trace with hash 337170069, now seen corresponding path program 1 times [2018-04-10 14:03:37,596 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:03:37,596 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:03:37,597 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:03:37,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:03:37,597 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:03:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:03:37,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:03:37,843 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-10 14:03:37,843 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:03:37,843 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:03:37,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:03:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:03:37,880 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:03:38,063 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-10 14:03:38,065 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:03:38,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 14:03:38,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:38,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:38,077 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-10 14:03:38,079 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:03:38,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 14:03:38,080 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:38,082 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:38,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:38,096 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:46, output treesize:7 [2018-04-10 14:03:38,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:03:38,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:03:38,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2018-04-10 14:03:38,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 14:03:38,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 14:03:38,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2018-04-10 14:03:38,171 INFO L87 Difference]: Start difference. First operand 617 states and 701 transitions. Second operand 26 states. [2018-04-10 14:03:40,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:03:40,553 INFO L93 Difference]: Finished difference Result 767 states and 834 transitions. [2018-04-10 14:03:40,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-10 14:03:40,553 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 82 [2018-04-10 14:03:40,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:03:40,554 INFO L225 Difference]: With dead ends: 767 [2018-04-10 14:03:40,554 INFO L226 Difference]: Without dead ends: 767 [2018-04-10 14:03:40,555 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1138, Invalid=5342, Unknown=0, NotChecked=0, Total=6480 [2018-04-10 14:03:40,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2018-04-10 14:03:40,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 602. [2018-04-10 14:03:40,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-04-10 14:03:40,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 678 transitions. [2018-04-10 14:03:40,558 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 678 transitions. Word has length 82 [2018-04-10 14:03:40,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:03:40,559 INFO L459 AbstractCegarLoop]: Abstraction has 602 states and 678 transitions. [2018-04-10 14:03:40,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 14:03:40,559 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 678 transitions. [2018-04-10 14:03:40,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-10 14:03:40,559 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:03:40,559 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:03:40,559 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:03:40,559 INFO L82 PathProgramCache]: Analyzing trace with hash 2031816585, now seen corresponding path program 2 times [2018-04-10 14:03:40,559 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:03:40,559 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:03:40,560 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:03:40,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:03:40,560 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:03:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:03:40,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:03:40,922 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:03:40,922 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:03:40,922 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:03:40,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:03:40,947 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:03:40,947 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:03:40,949 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:03:40,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:40,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:40,984 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-10 14:03:40,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:40,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:40,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-04-10 14:03:41,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:03:41,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:03:41,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:41,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:41,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:03:41,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:03:41,018 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:41,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:41,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:41,025 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2018-04-10 14:03:41,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:41,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2018-04-10 14:03:41,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:03:41,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:41,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:41,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:41,089 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-10 14:03:41,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:03:41,090 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:41,093 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:41,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:03:41,100 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:54 [2018-04-10 14:03:41,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2018-04-10 14:03:41,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-04-10 14:03:41,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:03:41,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:03:41,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 91 [2018-04-10 14:03:41,214 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:03:41,214 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 20 treesize of output 38 [2018-04-10 14:03:41,215 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:41,222 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:41,224 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:03:41,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 78 [2018-04-10 14:03:41,227 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:03:41,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-10 14:03:41,227 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:41,235 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:41,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:03:41,256 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:87, output treesize:171 [2018-04-10 14:03:41,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 79 [2018-04-10 14:03:41,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:41,301 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 28 treesize of output 47 [2018-04-10 14:03:41,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:41,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:41,319 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 80 treesize of output 75 [2018-04-10 14:03:41,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:41,329 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 28 treesize of output 47 [2018-04-10 14:03:41,329 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:41,336 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:41,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:41,343 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:102, output treesize:86 [2018-04-10 14:03:41,465 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:03:41,466 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 0 case distinctions, treesize of input 103 treesize of output 95 [2018-04-10 14:03:41,468 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:03:41,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 43 [2018-04-10 14:03:41,468 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:03:41,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:41,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:41,477 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:03:41,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 54 [2018-04-10 14:03:41,478 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:41,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:03:41,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2018-04-10 14:03:41,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:41,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:41,498 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:03:41,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 38 [2018-04-10 14:03:41,499 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:41,505 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:03:41,505 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 16 treesize of output 10 [2018-04-10 14:03:41,505 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:41,507 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:41,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:41,512 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:122, output treesize:7 [2018-04-10 14:03:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 8 refuted. 10 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:03:41,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:03:41,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 31 [2018-04-10 14:03:41,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-10 14:03:41,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-10 14:03:41,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=823, Unknown=6, NotChecked=0, Total=930 [2018-04-10 14:03:41,565 INFO L87 Difference]: Start difference. First operand 602 states and 678 transitions. Second operand 31 states. [2018-04-10 14:03:44,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:03:44,243 INFO L93 Difference]: Finished difference Result 806 states and 889 transitions. [2018-04-10 14:03:44,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-10 14:03:44,243 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 84 [2018-04-10 14:03:44,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:03:44,245 INFO L225 Difference]: With dead ends: 806 [2018-04-10 14:03:44,245 INFO L226 Difference]: Without dead ends: 806 [2018-04-10 14:03:44,245 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=672, Invalid=3340, Unknown=20, NotChecked=0, Total=4032 [2018-04-10 14:03:44,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-04-10 14:03:44,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 654. [2018-04-10 14:03:44,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-04-10 14:03:44,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 742 transitions. [2018-04-10 14:03:44,250 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 742 transitions. Word has length 84 [2018-04-10 14:03:44,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:03:44,250 INFO L459 AbstractCegarLoop]: Abstraction has 654 states and 742 transitions. [2018-04-10 14:03:44,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-10 14:03:44,250 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 742 transitions. [2018-04-10 14:03:44,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-10 14:03:44,250 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:03:44,251 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:03:44,251 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:03:44,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1072416019, now seen corresponding path program 1 times [2018-04-10 14:03:44,251 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:03:44,251 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:03:44,251 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:03:44,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:03:44,251 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:03:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:03:44,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:03:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:03:44,881 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:03:44,881 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:03:44,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:03:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:03:44,907 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:03:44,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:44,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:44,928 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-10 14:03:44,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:44,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:44,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:03:44,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:03:44,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:03:44,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:44,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:44,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:03:44,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:03:44,965 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:44,966 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:44,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:44,970 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-04-10 14:03:45,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:45,007 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-10 14:03:45,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:03:45,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:45,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:45,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:45,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2018-04-10 14:03:45,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:03:45,022 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:45,026 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:45,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:03:45,032 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-04-10 14:03:45,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 45 [2018-04-10 14:03:45,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 39 [2018-04-10 14:03:45,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:03:45,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:03:45,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2018-04-10 14:03:45,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-04-10 14:03:45,166 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 14:03:45,179 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:03:45,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 73 [2018-04-10 14:03:45,184 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:03:45,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-04-10 14:03:45,185 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:45,192 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:45,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:03:45,223 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:91, output treesize:155 [2018-04-10 14:03:45,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:45,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:45,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:45,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:45,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42 [2018-04-10 14:03:45,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:45,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:45,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:83 [2018-04-10 14:03:45,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 60 [2018-04-10 14:03:45,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:45,320 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 24 treesize of output 39 [2018-04-10 14:03:45,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:45,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:45,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:45,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2018-04-10 14:03:45,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:45,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 14:03:45,369 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:45,379 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:45,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:45,395 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:109, output treesize:101 [2018-04-10 14:03:45,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 87 [2018-04-10 14:03:45,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:03:45,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:45,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:45,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:03:45,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 116 [2018-04-10 14:03:45,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:03:45,533 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:45,546 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:45,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:03:45,562 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:147, output treesize:127 [2018-04-10 14:03:45,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 176 [2018-04-10 14:03:45,669 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 30 treesize of output 45 [2018-04-10 14:03:45,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:45,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:45,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 181 [2018-04-10 14:03:45,708 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 30 treesize of output 45 [2018-04-10 14:03:45,708 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:03:45,720 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:03:45,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:03:45,737 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:243, output treesize:207 Received shutdown request... [2018-04-10 14:03:49,790 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-10 14:03:49,790 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 14:03:49,793 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 14:03:49,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 02:03:49 BoogieIcfgContainer [2018-04-10 14:03:49,794 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 14:03:49,794 INFO L168 Benchmark]: Toolchain (without parser) took 192898.06 ms. Allocated memory was 393.7 MB in the beginning and 797.4 MB in the end (delta: 403.7 MB). Free memory was 330.2 MB in the beginning and 390.0 MB in the end (delta: -59.8 MB). Peak memory consumption was 343.9 MB. Max. memory is 5.3 GB. [2018-04-10 14:03:49,795 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 393.7 MB. Free memory is still 356.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 14:03:49,795 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.55 ms. Allocated memory is still 393.7 MB. Free memory was 330.2 MB in the beginning and 302.5 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. [2018-04-10 14:03:49,795 INFO L168 Benchmark]: Boogie Preprocessor took 51.07 ms. Allocated memory is still 393.7 MB. Free memory was 302.5 MB in the beginning and 299.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-10 14:03:49,795 INFO L168 Benchmark]: RCFGBuilder took 622.95 ms. Allocated memory was 393.7 MB in the beginning and 596.6 MB in the end (delta: 202.9 MB). Free memory was 299.8 MB in the beginning and 504.1 MB in the end (delta: -204.2 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. [2018-04-10 14:03:49,795 INFO L168 Benchmark]: TraceAbstraction took 191948.31 ms. Allocated memory was 596.6 MB in the beginning and 797.4 MB in the end (delta: 200.8 MB). Free memory was 504.1 MB in the beginning and 390.0 MB in the end (delta: 114.1 MB). Peak memory consumption was 314.9 MB. Max. memory is 5.3 GB. [2018-04-10 14:03:49,796 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.17 ms. Allocated memory is still 393.7 MB. Free memory is still 356.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 272.55 ms. Allocated memory is still 393.7 MB. Free memory was 330.2 MB in the beginning and 302.5 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 51.07 ms. Allocated memory is still 393.7 MB. Free memory was 302.5 MB in the beginning and 299.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 622.95 ms. Allocated memory was 393.7 MB in the beginning and 596.6 MB in the end (delta: 202.9 MB). Free memory was 299.8 MB in the beginning and 504.1 MB in the end (delta: -204.2 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 191948.31 ms. Allocated memory was 596.6 MB in the beginning and 797.4 MB in the end (delta: 200.8 MB). Free memory was 504.1 MB in the beginning and 390.0 MB in the end (delta: 114.1 MB). Peak memory consumption was 314.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1004]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1020]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1020). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 994]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1045]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1045). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1028]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1047]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1047). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1051]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1051). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1040]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1004]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1046]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1046). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1045]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1045). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1003]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1040]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1047]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1047). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1028]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1004]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 994]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1004]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1046]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1046). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1051]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1051). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1003]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1020]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1020). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 51. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 199 locations, 71 error locations. TIMEOUT Result, 191.9s OverallTime, 44 OverallIterations, 3 TraceHistogramMax, 137.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6719 SDtfs, 34613 SDslu, 44043 SDs, 0 SdLazy, 37874 SolverSat, 2984 SolverUnsat, 230 SolverUnknown, 0 SolverNotchecked, 38.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2183 GetRequests, 902 SyntacticMatches, 55 SemanticMatches, 1226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18496 ImplicationChecksByTransitivity, 134.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=654occurred in iteration=43, 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.2s AutomataMinimizationTime, 43 MinimizatonAttempts, 7158 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 46.6s InterpolantComputationTime, 3225 NumberOfCodeBlocks, 3225 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 3168 ConstructedInterpolants, 362 QuantifiedInterpolants, 5747801 SizeOfPredicates, 216 NumberOfNonLiveVariables, 3254 ConjunctsInSsa, 570 ConjunctsInUnsatCore, 57 InterpolantComputations, 29 PerfectInterpolantSequences, 57/181 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_14-03-49-801.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_14-03-49-801.csv Completed graceful shutdown