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/sll-01_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 14:14:54,480 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 14:14:54,481 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 14:14:54,494 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 14:14:54,494 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 14:14:54,495 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 14:14:54,495 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 14:14:54,497 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 14:14:54,498 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 14:14:54,499 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 14:14:54,500 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 14:14:54,500 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 14:14:54,501 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 14:14:54,502 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 14:14:54,503 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 14:14:54,504 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 14:14:54,506 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 14:14:54,508 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 14:14:54,509 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 14:14:54,510 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 14:14:54,511 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 14:14:54,512 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 14:14:54,512 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 14:14:54,513 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 14:14:54,513 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 14:14:54,514 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 14:14:54,514 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 14:14:54,515 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 14:14:54,515 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 14:14:54,516 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 14:14:54,516 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 14:14:54,516 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:14:54,528 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 14:14:54,528 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 14:14:54,529 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 14:14:54,530 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 14:14:54,530 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 14:14:54,530 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 14:14:54,530 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 14:14:54,530 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 14:14:54,530 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 14:14:54,530 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 14:14:54,530 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 14:14:54,531 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 14:14:54,531 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 14:14:54,531 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 14:14:54,531 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 14:14:54,531 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 14:14:54,531 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 14:14:54,531 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 14:14:54,531 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 14:14:54,531 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 14:14:54,531 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 14:14:54,532 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 14:14:54,532 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 14:14:54,532 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-04-10 14:14:54,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 14:14:54,569 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 14:14:54,572 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 14:14:54,573 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 14:14:54,573 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 14:14:54,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:54,860 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6a35e4e95 [2018-04-10 14:14:55,011 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 14:14:55,011 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 14:14:55,012 INFO L168 CDTParser]: Scanning sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,019 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 14:14:55,019 INFO L215 ultiparseSymbolTable]: [2018-04-10 14:14:55,019 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 14:14:55,020 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,020 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 14:14:55,020 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_int32_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,020 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_quad_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,020 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__ulong in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,020 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__blkcnt_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,020 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_char in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,020 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____caddr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,020 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__int16_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,020 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,021 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____dev_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,021 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,021 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__lldiv_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,021 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__clock_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,021 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__fd_set in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,021 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__uid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,021 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,021 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____uint32_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,021 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,021 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_key_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,022 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fsid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,022 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__div_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,022 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____ino_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,022 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____u_long in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,022 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____int16_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,022 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____ino64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,022 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__blksize_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,022 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__caddr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,022 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__sigset_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,022 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____blkcnt_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,022 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__int64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,022 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____sigset_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,022 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____loff_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,022 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,022 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____clock_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,023 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__fsid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,023 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__ushort in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,023 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__SLL in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,023 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____key_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,023 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__time_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,023 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____syscall_slong_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,023 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_long in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,023 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____useconds_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,023 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__suseconds_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,023 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____u_short in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,024 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__mode_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,024 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__ino_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,024 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__daddr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,024 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_int64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,024 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,024 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,024 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__ldiv_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,024 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____int64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,024 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__int8_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,024 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__loff_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,024 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____uint8_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,024 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____time_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,025 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____qaddr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,025 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____blksize_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,025 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,025 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____daddr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,025 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____uint16_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,025 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____rlim64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,025 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,025 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fsword_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,025 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____uint64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,025 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_once_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,026 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____int8_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,026 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__ssize_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,026 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____uid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,026 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____nlink_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,026 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____sig_atomic_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,026 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_attr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,026 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__timer_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,026 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__register_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,026 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__uint in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__int32_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____socklen_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____blkcnt64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____u_int in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__off_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__nlink_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__gid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____intptr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_short in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__dev_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__id_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____mode_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____rlim_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__key_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__fd_mask in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__quad_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__size_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____int32_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_int16_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_cond_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____u_quad_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____pthread_slist_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____clockid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__clockid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____off_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____ssize_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__idtype_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__wchar_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____id_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____quad_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fd_mask in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____u_char in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_int8_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____off64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____suseconds_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____timer_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____pid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____gid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_int in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,058 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6a35e4e95 [2018-04-10 14:14:55,062 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 14:14:55,063 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 14:14:55,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 14:14:55,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 14:14:55,067 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 14:14:55,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:14:55" (1/1) ... [2018-04-10 14:14:55,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45869bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:14:55, skipping insertion in model container [2018-04-10 14:14:55,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:14:55" (1/1) ... [2018-04-10 14:14:55,081 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:14:55,104 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:14:55,258 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:14:55,298 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:14:55,303 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-10 14:14:55,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:14:55 WrapperNode [2018-04-10 14:14:55,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 14:14:55,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 14:14:55,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 14:14:55,338 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 14:14:55,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:14:55" (1/1) ... [2018-04-10 14:14:55,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:14:55" (1/1) ... [2018-04-10 14:14:55,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:14:55" (1/1) ... [2018-04-10 14:14:55,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:14:55" (1/1) ... [2018-04-10 14:14:55,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:14:55" (1/1) ... [2018-04-10 14:14:55,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:14:55" (1/1) ... [2018-04-10 14:14:55,376 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:14:55" (1/1) ... [2018-04-10 14:14:55,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 14:14:55,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 14:14:55,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 14:14:55,381 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 14:14:55,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:14:55" (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:14:55,488 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 14:14:55,488 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 14:14:55,489 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 14:14:55,489 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-10 14:14:55,489 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-10 14:14:55,489 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-10 14:14:55,489 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-10 14:14:55,489 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-10 14:14:55,489 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-10 14:14:55,489 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-10 14:14:55,489 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-10 14:14:55,489 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-10 14:14:55,489 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-10 14:14:55,489 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-10 14:14:55,489 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-10 14:14:55,489 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-10 14:14:55,490 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-10 14:14:55,490 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-10 14:14:55,490 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-10 14:14:55,490 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-10 14:14:55,490 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-10 14:14:55,490 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-10 14:14:55,490 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-10 14:14:55,490 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-10 14:14:55,490 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-10 14:14:55,491 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-10 14:14:55,491 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-10 14:14:55,491 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-10 14:14:55,491 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-10 14:14:55,491 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-10 14:14:55,491 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-10 14:14:55,491 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-10 14:14:55,491 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-10 14:14:55,491 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-10 14:14:55,492 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-10 14:14:55,492 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-10 14:14:55,492 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-10 14:14:55,492 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-10 14:14:55,492 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-10 14:14:55,492 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-10 14:14:55,492 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-10 14:14:55,492 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-10 14:14:55,492 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-10 14:14:55,492 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-10 14:14:55,493 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-10 14:14:55,493 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-10 14:14:55,493 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-10 14:14:55,493 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-10 14:14:55,493 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-10 14:14:55,493 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-10 14:14:55,493 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-10 14:14:55,493 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-10 14:14:55,493 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-10 14:14:55,494 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-10 14:14:55,494 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-10 14:14:55,494 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-10 14:14:55,494 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-10 14:14:55,494 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-10 14:14:55,494 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-10 14:14:55,494 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-10 14:14:55,494 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-10 14:14:55,494 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-10 14:14:55,494 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-10 14:14:55,495 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-10 14:14:55,495 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-10 14:14:55,495 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-10 14:14:55,495 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-10 14:14:55,495 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-10 14:14:55,495 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-10 14:14:55,495 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-10 14:14:55,495 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-10 14:14:55,495 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-10 14:14:55,495 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-10 14:14:55,496 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-10 14:14:55,496 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-10 14:14:55,496 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-10 14:14:55,496 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-10 14:14:55,496 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-10 14:14:55,496 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-10 14:14:55,496 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-10 14:14:55,496 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-10 14:14:55,496 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-10 14:14:55,496 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-10 14:14:55,497 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-10 14:14:55,497 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-10 14:14:55,497 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-10 14:14:55,497 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-10 14:14:55,497 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-10 14:14:55,497 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-10 14:14:55,497 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-10 14:14:55,497 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-10 14:14:55,497 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-10 14:14:55,497 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-10 14:14:55,497 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-10 14:14:55,498 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-10 14:14:55,498 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-10 14:14:55,498 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-10 14:14:55,498 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-10 14:14:55,498 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-10 14:14:55,498 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-10 14:14:55,498 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-10 14:14:55,498 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-10 14:14:55,498 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-10 14:14:55,498 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-10 14:14:55,499 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-10 14:14:55,499 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-10 14:14:55,499 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 14:14:55,499 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 14:14:55,499 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 14:14:55,499 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 14:14:55,499 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-10 14:14:55,499 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-10 14:14:55,499 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 14:14:55,499 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 14:14:55,499 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 14:14:55,969 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 14:14:55,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:14:55 BoogieIcfgContainer [2018-04-10 14:14:55,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 14:14:55,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 14:14:55,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 14:14:55,972 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 14:14:55,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 02:14:55" (1/3) ... [2018-04-10 14:14:55,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62733c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:14:55, skipping insertion in model container [2018-04-10 14:14:55,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:14:55" (2/3) ... [2018-04-10 14:14:55,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62733c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:14:55, skipping insertion in model container [2018-04-10 14:14:55,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:14:55" (3/3) ... [2018-04-10 14:14:55,974 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:14:55,980 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 14:14:55,991 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 63 error locations. [2018-04-10 14:14:56,015 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 14:14:56,016 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 14:14:56,016 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 14:14:56,016 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 14:14:56,016 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 14:14:56,016 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 14:14:56,016 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 14:14:56,016 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 14:14:56,016 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 14:14:56,017 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 14:14:56,028 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states. [2018-04-10 14:14:56,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 14:14:56,035 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:56,036 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:14:56,036 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:56,038 INFO L82 PathProgramCache]: Analyzing trace with hash 166545801, now seen corresponding path program 1 times [2018-04-10 14:14:56,039 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:56,040 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:56,072 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:56,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:56,072 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:56,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:56,137 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:14:56,138 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:14:56,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:14:56,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:14:56,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:14:56,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:14:56,149 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 4 states. [2018-04-10 14:14:56,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:14:56,365 INFO L93 Difference]: Finished difference Result 218 states and 229 transitions. [2018-04-10 14:14:56,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:14:56,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 14:14:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:14:56,378 INFO L225 Difference]: With dead ends: 218 [2018-04-10 14:14:56,378 INFO L226 Difference]: Without dead ends: 214 [2018-04-10 14:14:56,380 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:14:56,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-10 14:14:56,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 180. [2018-04-10 14:14:56,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-10 14:14:56,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 192 transitions. [2018-04-10 14:14:56,417 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 192 transitions. Word has length 8 [2018-04-10 14:14:56,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:14:56,417 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 192 transitions. [2018-04-10 14:14:56,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:14:56,418 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 192 transitions. [2018-04-10 14:14:56,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 14:14:56,418 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:56,418 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:14:56,418 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:56,419 INFO L82 PathProgramCache]: Analyzing trace with hash 166545802, now seen corresponding path program 1 times [2018-04-10 14:14:56,419 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:56,419 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:56,420 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:56,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:56,420 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:56,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:56,467 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:14:56,467 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:14:56,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:14:56,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:14:56,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:14:56,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:14:56,469 INFO L87 Difference]: Start difference. First operand 180 states and 192 transitions. Second operand 4 states. [2018-04-10 14:14:56,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:14:56,571 INFO L93 Difference]: Finished difference Result 207 states and 218 transitions. [2018-04-10 14:14:56,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 14:14:56,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 14:14:56,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:14:56,573 INFO L225 Difference]: With dead ends: 207 [2018-04-10 14:14:56,573 INFO L226 Difference]: Without dead ends: 207 [2018-04-10 14:14:56,573 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:14:56,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-04-10 14:14:56,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2018-04-10 14:14:56,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-10 14:14:56,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 213 transitions. [2018-04-10 14:14:56,583 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 213 transitions. Word has length 8 [2018-04-10 14:14:56,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:14:56,583 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 213 transitions. [2018-04-10 14:14:56,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:14:56,583 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 213 transitions. [2018-04-10 14:14:56,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 14:14:56,584 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:56,584 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:14:56,584 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:56,584 INFO L82 PathProgramCache]: Analyzing trace with hash -2089322413, now seen corresponding path program 1 times [2018-04-10 14:14:56,584 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:56,584 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:56,585 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:56,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:56,586 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:56,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:56,633 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:14:56,633 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:14:56,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:14:56,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:14:56,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:14:56,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:14:56,634 INFO L87 Difference]: Start difference. First operand 194 states and 213 transitions. Second operand 5 states. [2018-04-10 14:14:56,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:14:56,917 INFO L93 Difference]: Finished difference Result 329 states and 356 transitions. [2018-04-10 14:14:56,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:14:56,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-10 14:14:56,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:14:56,919 INFO L225 Difference]: With dead ends: 329 [2018-04-10 14:14:56,919 INFO L226 Difference]: Without dead ends: 329 [2018-04-10 14:14:56,920 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:14:56,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-04-10 14:14:56,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 193. [2018-04-10 14:14:56,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-10 14:14:56,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 212 transitions. [2018-04-10 14:14:56,930 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 212 transitions. Word has length 17 [2018-04-10 14:14:56,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:14:56,930 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 212 transitions. [2018-04-10 14:14:56,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:14:56,931 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 212 transitions. [2018-04-10 14:14:56,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 14:14:56,931 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:56,931 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:14:56,931 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:56,932 INFO L82 PathProgramCache]: Analyzing trace with hash -2089322412, now seen corresponding path program 1 times [2018-04-10 14:14:56,932 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:56,932 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:56,933 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:56,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:56,933 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:56,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:56,998 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:14:56,998 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:14:56,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:14:56,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:14:56,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:14:56,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:14:56,999 INFO L87 Difference]: Start difference. First operand 193 states and 212 transitions. Second operand 5 states. [2018-04-10 14:14:57,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:14:57,199 INFO L93 Difference]: Finished difference Result 360 states and 397 transitions. [2018-04-10 14:14:57,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:14:57,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-10 14:14:57,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:14:57,200 INFO L225 Difference]: With dead ends: 360 [2018-04-10 14:14:57,200 INFO L226 Difference]: Without dead ends: 360 [2018-04-10 14:14:57,200 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:14:57,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-04-10 14:14:57,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 192. [2018-04-10 14:14:57,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-10 14:14:57,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 211 transitions. [2018-04-10 14:14:57,208 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 211 transitions. Word has length 17 [2018-04-10 14:14:57,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:14:57,208 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 211 transitions. [2018-04-10 14:14:57,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:14:57,208 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 211 transitions. [2018-04-10 14:14:57,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-10 14:14:57,208 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:57,209 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:14:57,209 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:57,209 INFO L82 PathProgramCache]: Analyzing trace with hash -337938114, now seen corresponding path program 1 times [2018-04-10 14:14:57,209 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:57,209 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:57,210 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:57,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:57,210 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:57,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:57,303 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:14:57,303 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:14:57,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:14:57,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:14:57,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:14:57,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:14:57,304 INFO L87 Difference]: Start difference. First operand 192 states and 211 transitions. Second operand 8 states. [2018-04-10 14:14:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:14:57,684 INFO L93 Difference]: Finished difference Result 332 states and 357 transitions. [2018-04-10 14:14:57,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:14:57,685 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-04-10 14:14:57,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:14:57,686 INFO L225 Difference]: With dead ends: 332 [2018-04-10 14:14:57,686 INFO L226 Difference]: Without dead ends: 332 [2018-04-10 14:14:57,686 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:14:57,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-04-10 14:14:57,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 191. [2018-04-10 14:14:57,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-10 14:14:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 210 transitions. [2018-04-10 14:14:57,693 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 210 transitions. Word has length 20 [2018-04-10 14:14:57,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:14:57,693 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 210 transitions. [2018-04-10 14:14:57,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:14:57,693 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 210 transitions. [2018-04-10 14:14:57,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-10 14:14:57,694 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:57,694 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:14:57,694 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:57,695 INFO L82 PathProgramCache]: Analyzing trace with hash -337938113, now seen corresponding path program 1 times [2018-04-10 14:14:57,695 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:57,695 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:57,696 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:57,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:57,696 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:57,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:57,791 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:14:57,792 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:14:57,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:14:57,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:14:57,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:14:57,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:14:57,793 INFO L87 Difference]: Start difference. First operand 191 states and 210 transitions. Second operand 8 states. [2018-04-10 14:14:58,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:14:58,359 INFO L93 Difference]: Finished difference Result 334 states and 359 transitions. [2018-04-10 14:14:58,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:14:58,360 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-04-10 14:14:58,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:14:58,362 INFO L225 Difference]: With dead ends: 334 [2018-04-10 14:14:58,362 INFO L226 Difference]: Without dead ends: 334 [2018-04-10 14:14:58,362 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:14:58,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-04-10 14:14:58,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 190. [2018-04-10 14:14:58,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-04-10 14:14:58,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2018-04-10 14:14:58,366 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 20 [2018-04-10 14:14:58,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:14:58,366 INFO L459 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2018-04-10 14:14:58,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:14:58,367 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2018-04-10 14:14:58,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-10 14:14:58,367 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:58,367 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] [2018-04-10 14:14:58,367 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:58,367 INFO L82 PathProgramCache]: Analyzing trace with hash -296054905, now seen corresponding path program 1 times [2018-04-10 14:14:58,367 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:58,367 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:58,368 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:58,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:58,369 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:58,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:58,411 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:14:58,411 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:14:58,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:14:58,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:14:58,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:14:58,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:14:58,412 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 5 states. [2018-04-10 14:14:58,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:14:58,513 INFO L93 Difference]: Finished difference Result 282 states and 306 transitions. [2018-04-10 14:14:58,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:14:58,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-04-10 14:14:58,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:14:58,515 INFO L225 Difference]: With dead ends: 282 [2018-04-10 14:14:58,515 INFO L226 Difference]: Without dead ends: 282 [2018-04-10 14:14:58,515 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:14:58,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-04-10 14:14:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 194. [2018-04-10 14:14:58,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-10 14:14:58,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 213 transitions. [2018-04-10 14:14:58,520 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 213 transitions. Word has length 26 [2018-04-10 14:14:58,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:14:58,521 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 213 transitions. [2018-04-10 14:14:58,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:14:58,521 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 213 transitions. [2018-04-10 14:14:58,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-10 14:14:58,521 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:58,521 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:14:58,522 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:58,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1611684908, now seen corresponding path program 1 times [2018-04-10 14:14:58,522 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:58,522 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:58,524 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:58,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:58,524 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:58,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:58,554 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:14:58,555 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:14:58,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:14:58,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:14:58,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:14:58,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:14:58,555 INFO L87 Difference]: Start difference. First operand 194 states and 213 transitions. Second operand 4 states. [2018-04-10 14:14:58,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:14:58,626 INFO L93 Difference]: Finished difference Result 198 states and 214 transitions. [2018-04-10 14:14:58,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 14:14:58,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-04-10 14:14:58,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:14:58,627 INFO L225 Difference]: With dead ends: 198 [2018-04-10 14:14:58,627 INFO L226 Difference]: Without dead ends: 198 [2018-04-10 14:14:58,627 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:14:58,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-04-10 14:14:58,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2018-04-10 14:14:58,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-10 14:14:58,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 205 transitions. [2018-04-10 14:14:58,629 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 205 transitions. Word has length 28 [2018-04-10 14:14:58,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:14:58,629 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 205 transitions. [2018-04-10 14:14:58,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:14:58,629 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 205 transitions. [2018-04-10 14:14:58,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-10 14:14:58,630 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:58,630 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:14:58,630 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:58,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1611684909, now seen corresponding path program 1 times [2018-04-10 14:14:58,630 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:58,630 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:58,631 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:58,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:58,631 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:58,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:58,710 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:14:58,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:14:58,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 14:14:58,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 14:14:58,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 14:14:58,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:14:58,711 INFO L87 Difference]: Start difference. First operand 186 states and 205 transitions. Second operand 7 states. [2018-04-10 14:14:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:14:58,903 INFO L93 Difference]: Finished difference Result 240 states and 255 transitions. [2018-04-10 14:14:58,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:14:58,903 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-04-10 14:14:58,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:14:58,904 INFO L225 Difference]: With dead ends: 240 [2018-04-10 14:14:58,904 INFO L226 Difference]: Without dead ends: 240 [2018-04-10 14:14:58,904 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-04-10 14:14:58,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-04-10 14:14:58,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 213. [2018-04-10 14:14:58,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-10 14:14:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 240 transitions. [2018-04-10 14:14:58,907 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 240 transitions. Word has length 28 [2018-04-10 14:14:58,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:14:58,907 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 240 transitions. [2018-04-10 14:14:58,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 14:14:58,907 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 240 transitions. [2018-04-10 14:14:58,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 14:14:58,908 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:58,908 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:14:58,908 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:58,908 INFO L82 PathProgramCache]: Analyzing trace with hash 265761851, now seen corresponding path program 1 times [2018-04-10 14:14:58,908 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:58,908 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:58,909 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:58,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:58,909 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:58,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:58,945 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:14:58,945 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:14:58,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:14:58,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:14:58,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:14:58,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:14:58,946 INFO L87 Difference]: Start difference. First operand 213 states and 240 transitions. Second operand 6 states. [2018-04-10 14:14:59,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:14:59,106 INFO L93 Difference]: Finished difference Result 305 states and 345 transitions. [2018-04-10 14:14:59,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 14:14:59,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-10 14:14:59,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:14:59,108 INFO L225 Difference]: With dead ends: 305 [2018-04-10 14:14:59,108 INFO L226 Difference]: Without dead ends: 305 [2018-04-10 14:14:59,108 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:14:59,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-10 14:14:59,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 212. [2018-04-10 14:14:59,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-04-10 14:14:59,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 239 transitions. [2018-04-10 14:14:59,113 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 239 transitions. Word has length 31 [2018-04-10 14:14:59,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:14:59,113 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 239 transitions. [2018-04-10 14:14:59,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:14:59,113 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 239 transitions. [2018-04-10 14:14:59,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 14:14:59,114 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:59,114 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:14:59,114 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:59,114 INFO L82 PathProgramCache]: Analyzing trace with hash 265761852, now seen corresponding path program 1 times [2018-04-10 14:14:59,114 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:59,114 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:59,115 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:59,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:59,116 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:59,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:59,191 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:14:59,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:14:59,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:14:59,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:14:59,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:14:59,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:14:59,192 INFO L87 Difference]: Start difference. First operand 212 states and 239 transitions. Second operand 6 states. [2018-04-10 14:14:59,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:14:59,416 INFO L93 Difference]: Finished difference Result 329 states and 377 transitions. [2018-04-10 14:14:59,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 14:14:59,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-10 14:14:59,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:14:59,417 INFO L225 Difference]: With dead ends: 329 [2018-04-10 14:14:59,417 INFO L226 Difference]: Without dead ends: 329 [2018-04-10 14:14:59,417 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-10 14:14:59,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-04-10 14:14:59,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 197. [2018-04-10 14:14:59,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-10 14:14:59,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 223 transitions. [2018-04-10 14:14:59,420 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 223 transitions. Word has length 31 [2018-04-10 14:14:59,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:14:59,420 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 223 transitions. [2018-04-10 14:14:59,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:14:59,421 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 223 transitions. [2018-04-10 14:14:59,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-10 14:14:59,421 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:59,421 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:14:59,421 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:59,422 INFO L82 PathProgramCache]: Analyzing trace with hash -788385734, now seen corresponding path program 1 times [2018-04-10 14:14:59,422 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:59,422 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:59,423 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:59,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:59,423 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:59,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:59,455 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:14:59,455 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:14:59,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:14:59,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:14:59,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:14:59,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:14:59,456 INFO L87 Difference]: Start difference. First operand 197 states and 223 transitions. Second operand 5 states. [2018-04-10 14:14:59,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:14:59,515 INFO L93 Difference]: Finished difference Result 220 states and 234 transitions. [2018-04-10 14:14:59,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:14:59,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-04-10 14:14:59,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:14:59,516 INFO L225 Difference]: With dead ends: 220 [2018-04-10 14:14:59,516 INFO L226 Difference]: Without dead ends: 220 [2018-04-10 14:14:59,516 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:14:59,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-04-10 14:14:59,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 197. [2018-04-10 14:14:59,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-10 14:14:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 221 transitions. [2018-04-10 14:14:59,519 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 221 transitions. Word has length 36 [2018-04-10 14:14:59,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:14:59,519 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 221 transitions. [2018-04-10 14:14:59,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:14:59,519 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 221 transitions. [2018-04-10 14:14:59,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-10 14:14:59,520 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:59,520 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] [2018-04-10 14:14:59,520 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:59,520 INFO L82 PathProgramCache]: Analyzing trace with hash 2065889067, now seen corresponding path program 1 times [2018-04-10 14:14:59,520 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:59,520 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:59,521 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:59,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:59,521 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:59,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:59,617 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:14:59,617 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:14:59,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 14:14:59,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:14:59,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:14:59,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:14:59,618 INFO L87 Difference]: Start difference. First operand 197 states and 221 transitions. Second operand 8 states. [2018-04-10 14:14:59,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:14:59,897 INFO L93 Difference]: Finished difference Result 302 states and 333 transitions. [2018-04-10 14:14:59,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 14:14:59,897 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-04-10 14:14:59,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:14:59,898 INFO L225 Difference]: With dead ends: 302 [2018-04-10 14:14:59,898 INFO L226 Difference]: Without dead ends: 302 [2018-04-10 14:14:59,899 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:14:59,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-04-10 14:14:59,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 213. [2018-04-10 14:14:59,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-10 14:14:59,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 238 transitions. [2018-04-10 14:14:59,903 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 238 transitions. Word has length 42 [2018-04-10 14:14:59,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:14:59,903 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 238 transitions. [2018-04-10 14:14:59,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:14:59,903 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 238 transitions. [2018-04-10 14:14:59,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-10 14:14:59,904 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:59,904 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:14:59,904 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:59,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1631310599, now seen corresponding path program 1 times [2018-04-10 14:14:59,904 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:59,904 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:59,905 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:59,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:59,905 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:59,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:59,954 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:14:59,954 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:14:59,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:14:59,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:14:59,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:14:59,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:14:59,955 INFO L87 Difference]: Start difference. First operand 213 states and 238 transitions. Second operand 5 states. [2018-04-10 14:15:00,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:00,161 INFO L93 Difference]: Finished difference Result 363 states and 410 transitions. [2018-04-10 14:15:00,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:15:00,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-10 14:15:00,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:00,162 INFO L225 Difference]: With dead ends: 363 [2018-04-10 14:15:00,162 INFO L226 Difference]: Without dead ends: 363 [2018-04-10 14:15:00,163 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:15:00,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-04-10 14:15:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 212. [2018-04-10 14:15:00,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-04-10 14:15:00,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 237 transitions. [2018-04-10 14:15:00,167 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 237 transitions. Word has length 43 [2018-04-10 14:15:00,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:00,167 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 237 transitions. [2018-04-10 14:15:00,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:15:00,167 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 237 transitions. [2018-04-10 14:15:00,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-10 14:15:00,168 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:00,168 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:15:00,168 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:00,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1631310600, now seen corresponding path program 1 times [2018-04-10 14:15:00,168 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:00,168 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:00,169 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:00,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:00,169 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:00,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:00,199 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:15:00,199 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:15:00,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:15:00,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:15:00,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:15:00,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:15:00,200 INFO L87 Difference]: Start difference. First operand 212 states and 237 transitions. Second operand 5 states. [2018-04-10 14:15:00,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:00,388 INFO L93 Difference]: Finished difference Result 327 states and 367 transitions. [2018-04-10 14:15:00,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:15:00,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-10 14:15:00,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:00,389 INFO L225 Difference]: With dead ends: 327 [2018-04-10 14:15:00,389 INFO L226 Difference]: Without dead ends: 327 [2018-04-10 14:15:00,389 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:15:00,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-04-10 14:15:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 211. [2018-04-10 14:15:00,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-04-10 14:15:00,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 236 transitions. [2018-04-10 14:15:00,393 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 236 transitions. Word has length 43 [2018-04-10 14:15:00,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:00,393 INFO L459 AbstractCegarLoop]: Abstraction has 211 states and 236 transitions. [2018-04-10 14:15:00,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:15:00,393 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 236 transitions. [2018-04-10 14:15:00,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-10 14:15:00,394 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:00,394 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] [2018-04-10 14:15:00,394 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:00,394 INFO L82 PathProgramCache]: Analyzing trace with hash 928654395, now seen corresponding path program 1 times [2018-04-10 14:15:00,394 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:00,395 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:00,395 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:00,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:00,396 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:00,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:00,468 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:15:00,468 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:15:00,468 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:15:00,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:00,511 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:15:00,578 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:15:00,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:15:00,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:00,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:00,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 11 treesize of output 8 [2018-04-10 14:15:00,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, 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:15:00,597 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:00,598 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:00,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:00,604 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-10 14:15:00,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 14:15:00,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:00,631 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:15:00,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:00,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:00,650 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:15:00,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:00,653 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:15:00,654 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:00,658 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:00,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:00,667 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-10 14:15:00,734 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:15:00,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:00,739 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:15:00,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:00,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:00,751 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:15:00,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:00,757 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:15:00,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:00,761 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:00,766 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:15:00,766 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:7 [2018-04-10 14:15:00,786 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:15:00,816 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:15:00,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 11 [2018-04-10 14:15:00,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 14:15:00,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 14:15:00,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-10 14:15:00,817 INFO L87 Difference]: Start difference. First operand 211 states and 236 transitions. Second operand 11 states. [2018-04-10 14:15:01,279 WARN L148 SmtUtils]: Spent 108ms on a formula simplification that was a NOOP. DAG size: 20 [2018-04-10 14:15:01,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:01,532 INFO L93 Difference]: Finished difference Result 349 states and 375 transitions. [2018-04-10 14:15:01,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 14:15:01,532 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-04-10 14:15:01,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:01,534 INFO L225 Difference]: With dead ends: 349 [2018-04-10 14:15:01,534 INFO L226 Difference]: Without dead ends: 349 [2018-04-10 14:15:01,534 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2018-04-10 14:15:01,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-04-10 14:15:01,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 245. [2018-04-10 14:15:01,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-10 14:15:01,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 279 transitions. [2018-04-10 14:15:01,539 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 279 transitions. Word has length 44 [2018-04-10 14:15:01,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:01,539 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 279 transitions. [2018-04-10 14:15:01,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 14:15:01,540 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 279 transitions. [2018-04-10 14:15:01,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-10 14:15:01,540 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:01,540 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] [2018-04-10 14:15:01,540 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:01,541 INFO L82 PathProgramCache]: Analyzing trace with hash -819000242, now seen corresponding path program 1 times [2018-04-10 14:15:01,541 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:01,541 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:01,542 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:01,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:01,542 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:01,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:01,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:15:01,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:15:01,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:15:01,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:15:01,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:15:01,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:15:01,608 INFO L87 Difference]: Start difference. First operand 245 states and 279 transitions. Second operand 8 states. [2018-04-10 14:15:01,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:01,884 INFO L93 Difference]: Finished difference Result 262 states and 298 transitions. [2018-04-10 14:15:01,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 14:15:01,884 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-04-10 14:15:01,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:01,885 INFO L225 Difference]: With dead ends: 262 [2018-04-10 14:15:01,885 INFO L226 Difference]: Without dead ends: 262 [2018-04-10 14:15:01,885 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 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:15:01,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-04-10 14:15:01,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 244. [2018-04-10 14:15:01,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-04-10 14:15:01,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 278 transitions. [2018-04-10 14:15:01,888 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 278 transitions. Word has length 46 [2018-04-10 14:15:01,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:01,889 INFO L459 AbstractCegarLoop]: Abstraction has 244 states and 278 transitions. [2018-04-10 14:15:01,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:15:01,889 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 278 transitions. [2018-04-10 14:15:01,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-10 14:15:01,889 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:01,889 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] [2018-04-10 14:15:01,889 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:01,889 INFO L82 PathProgramCache]: Analyzing trace with hash -819000241, now seen corresponding path program 1 times [2018-04-10 14:15:01,889 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:01,889 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:01,890 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:01,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:01,890 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:01,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:01,992 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:15:01,992 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:15:01,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:15:01,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:15:01,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:15:01,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:15:01,993 INFO L87 Difference]: Start difference. First operand 244 states and 278 transitions. Second operand 8 states. [2018-04-10 14:15:02,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:02,350 INFO L93 Difference]: Finished difference Result 261 states and 297 transitions. [2018-04-10 14:15:02,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 14:15:02,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-04-10 14:15:02,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:02,351 INFO L225 Difference]: With dead ends: 261 [2018-04-10 14:15:02,351 INFO L226 Difference]: Without dead ends: 261 [2018-04-10 14:15:02,351 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:15:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-04-10 14:15:02,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 243. [2018-04-10 14:15:02,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-10 14:15:02,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 277 transitions. [2018-04-10 14:15:02,355 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 277 transitions. Word has length 46 [2018-04-10 14:15:02,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:02,355 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 277 transitions. [2018-04-10 14:15:02,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:15:02,356 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 277 transitions. [2018-04-10 14:15:02,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 14:15:02,356 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:02,356 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:15:02,356 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:02,356 INFO L82 PathProgramCache]: Analyzing trace with hash 410486952, now seen corresponding path program 1 times [2018-04-10 14:15:02,357 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:02,357 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:02,358 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:02,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:02,358 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:02,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:02,579 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:15:02,580 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:15:02,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-10 14:15:02,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 14:15:02,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 14:15:02,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-04-10 14:15:02,580 INFO L87 Difference]: Start difference. First operand 243 states and 277 transitions. Second operand 17 states. [2018-04-10 14:15:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:03,716 INFO L93 Difference]: Finished difference Result 542 states and 583 transitions. [2018-04-10 14:15:03,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 14:15:03,716 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-04-10 14:15:03,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:03,721 INFO L225 Difference]: With dead ends: 542 [2018-04-10 14:15:03,721 INFO L226 Difference]: Without dead ends: 542 [2018-04-10 14:15:03,722 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=392, Invalid=1090, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 14:15:03,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-04-10 14:15:03,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 249. [2018-04-10 14:15:03,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-04-10 14:15:03,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 282 transitions. [2018-04-10 14:15:03,728 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 282 transitions. Word has length 47 [2018-04-10 14:15:03,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:03,728 INFO L459 AbstractCegarLoop]: Abstraction has 249 states and 282 transitions. [2018-04-10 14:15:03,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 14:15:03,728 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 282 transitions. [2018-04-10 14:15:03,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 14:15:03,729 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:03,729 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:03,729 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:03,729 INFO L82 PathProgramCache]: Analyzing trace with hash 410486953, now seen corresponding path program 1 times [2018-04-10 14:15:03,729 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:03,730 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:03,731 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:03,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:03,731 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:03,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:03,999 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:15:03,999 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:15:03,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-10 14:15:03,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 14:15:03,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 14:15:04,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-04-10 14:15:04,000 INFO L87 Difference]: Start difference. First operand 249 states and 282 transitions. Second operand 17 states. [2018-04-10 14:15:05,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:05,242 INFO L93 Difference]: Finished difference Result 607 states and 650 transitions. [2018-04-10 14:15:05,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 14:15:05,242 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-04-10 14:15:05,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:05,243 INFO L225 Difference]: With dead ends: 607 [2018-04-10 14:15:05,243 INFO L226 Difference]: Without dead ends: 607 [2018-04-10 14:15:05,244 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=472, Invalid=1334, Unknown=0, NotChecked=0, Total=1806 [2018-04-10 14:15:05,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-04-10 14:15:05,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 256. [2018-04-10 14:15:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-10 14:15:05,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 288 transitions. [2018-04-10 14:15:05,247 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 288 transitions. Word has length 47 [2018-04-10 14:15:05,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:05,247 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 288 transitions. [2018-04-10 14:15:05,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 14:15:05,247 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 288 transitions. [2018-04-10 14:15:05,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-10 14:15:05,248 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:05,248 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] [2018-04-10 14:15:05,248 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:05,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1107305343, now seen corresponding path program 1 times [2018-04-10 14:15:05,248 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:05,248 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:05,249 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:05,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:05,249 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:05,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:05,305 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:15:05,305 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:15:05,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:15:05,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 14:15:05,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 14:15:05,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:15:05,305 INFO L87 Difference]: Start difference. First operand 256 states and 288 transitions. Second operand 7 states. [2018-04-10 14:15:05,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:05,429 INFO L93 Difference]: Finished difference Result 276 states and 308 transitions. [2018-04-10 14:15:05,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:15:05,429 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-04-10 14:15:05,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:05,432 INFO L225 Difference]: With dead ends: 276 [2018-04-10 14:15:05,432 INFO L226 Difference]: Without dead ends: 276 [2018-04-10 14:15:05,432 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:15:05,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-04-10 14:15:05,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 268. [2018-04-10 14:15:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-10 14:15:05,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 300 transitions. [2018-04-10 14:15:05,439 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 300 transitions. Word has length 53 [2018-04-10 14:15:05,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:05,440 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 300 transitions. [2018-04-10 14:15:05,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 14:15:05,440 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 300 transitions. [2018-04-10 14:15:05,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-10 14:15:05,441 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:05,441 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] [2018-04-10 14:15:05,441 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:05,441 INFO L82 PathProgramCache]: Analyzing trace with hash 815273570, now seen corresponding path program 1 times [2018-04-10 14:15:05,441 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:05,441 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:05,442 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:05,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:05,443 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:05,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:05,581 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:15:05,581 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:15:05,581 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:15:05,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:05,604 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:15:05,620 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:15:05,621 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:15:05,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:05,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:05,630 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:15:05,631 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:15:05,631 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:05,632 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:05,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:05,635 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-04-10 14:15:05,750 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:15:05,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:05,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:05,757 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:15:05,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:05,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:15:05,775 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:15:05,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:05,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:05,781 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:15:05,781 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:05,787 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:15:05,794 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:15:05,794 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:18 [2018-04-10 14:15:05,839 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:15:05,856 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:15:05,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2018-04-10 14:15:05,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 14:15:05,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 14:15:05,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=227, Unknown=2, NotChecked=0, Total=272 [2018-04-10 14:15:05,856 INFO L87 Difference]: Start difference. First operand 268 states and 300 transitions. Second operand 17 states. [2018-04-10 14:15:06,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:06,776 INFO L93 Difference]: Finished difference Result 544 states and 580 transitions. [2018-04-10 14:15:06,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 14:15:06,776 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-04-10 14:15:06,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:06,778 INFO L225 Difference]: With dead ends: 544 [2018-04-10 14:15:06,778 INFO L226 Difference]: Without dead ends: 544 [2018-04-10 14:15:06,778 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=1097, Unknown=4, NotChecked=0, Total=1332 [2018-04-10 14:15:06,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-04-10 14:15:06,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 300. [2018-04-10 14:15:06,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-04-10 14:15:06,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 339 transitions. [2018-04-10 14:15:06,782 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 339 transitions. Word has length 57 [2018-04-10 14:15:06,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:06,782 INFO L459 AbstractCegarLoop]: Abstraction has 300 states and 339 transitions. [2018-04-10 14:15:06,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 14:15:06,782 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 339 transitions. [2018-04-10 14:15:06,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-10 14:15:06,783 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:06,783 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] [2018-04-10 14:15:06,783 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:06,783 INFO L82 PathProgramCache]: Analyzing trace with hash 680833506, now seen corresponding path program 1 times [2018-04-10 14:15:06,783 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:06,783 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:06,784 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:06,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:06,784 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:06,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:06,918 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:15:06,918 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:15:06,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 14:15:06,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 14:15:06,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 14:15:06,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-10 14:15:06,919 INFO L87 Difference]: Start difference. First operand 300 states and 339 transitions. Second operand 10 states. [2018-04-10 14:15:07,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:07,382 INFO L93 Difference]: Finished difference Result 341 states and 376 transitions. [2018-04-10 14:15:07,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 14:15:07,382 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-04-10 14:15:07,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:07,383 INFO L225 Difference]: With dead ends: 341 [2018-04-10 14:15:07,383 INFO L226 Difference]: Without dead ends: 341 [2018-04-10 14:15:07,383 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2018-04-10 14:15:07,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-04-10 14:15:07,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 310. [2018-04-10 14:15:07,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-04-10 14:15:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 351 transitions. [2018-04-10 14:15:07,387 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 351 transitions. Word has length 58 [2018-04-10 14:15:07,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:07,388 INFO L459 AbstractCegarLoop]: Abstraction has 310 states and 351 transitions. [2018-04-10 14:15:07,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 14:15:07,388 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 351 transitions. [2018-04-10 14:15:07,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-10 14:15:07,388 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:07,388 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] [2018-04-10 14:15:07,388 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:07,389 INFO L82 PathProgramCache]: Analyzing trace with hash 680833507, now seen corresponding path program 1 times [2018-04-10 14:15:07,389 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:07,389 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:07,390 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:07,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:07,390 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:07,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:07,689 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:15:07,690 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:15:07,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-10 14:15:07,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 14:15:07,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 14:15:07,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-04-10 14:15:07,690 INFO L87 Difference]: Start difference. First operand 310 states and 351 transitions. Second operand 12 states. [2018-04-10 14:15:08,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:08,111 INFO L93 Difference]: Finished difference Result 351 states and 382 transitions. [2018-04-10 14:15:08,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 14:15:08,111 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-04-10 14:15:08,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:08,112 INFO L225 Difference]: With dead ends: 351 [2018-04-10 14:15:08,112 INFO L226 Difference]: Without dead ends: 351 [2018-04-10 14:15:08,112 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2018-04-10 14:15:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-04-10 14:15:08,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 310. [2018-04-10 14:15:08,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-04-10 14:15:08,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 350 transitions. [2018-04-10 14:15:08,115 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 350 transitions. Word has length 58 [2018-04-10 14:15:08,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:08,115 INFO L459 AbstractCegarLoop]: Abstraction has 310 states and 350 transitions. [2018-04-10 14:15:08,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 14:15:08,115 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 350 transitions. [2018-04-10 14:15:08,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-10 14:15:08,116 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:08,116 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] [2018-04-10 14:15:08,116 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:08,116 INFO L82 PathProgramCache]: Analyzing trace with hash -496321924, now seen corresponding path program 1 times [2018-04-10 14:15:08,116 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:08,116 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:08,117 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:08,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:08,117 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:08,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:08,168 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:15:08,168 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:15:08,168 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:15:08,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:08,213 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:15:08,277 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:15:08,307 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:15:08,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2018-04-10 14:15:08,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:15:08,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:15:08,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=36, Unknown=4, NotChecked=0, Total=56 [2018-04-10 14:15:08,308 INFO L87 Difference]: Start difference. First operand 310 states and 350 transitions. Second operand 8 states. [2018-04-10 14:15:08,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:08,444 INFO L93 Difference]: Finished difference Result 351 states and 391 transitions. [2018-04-10 14:15:08,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 14:15:08,444 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-04-10 14:15:08,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:08,445 INFO L225 Difference]: With dead ends: 351 [2018-04-10 14:15:08,445 INFO L226 Difference]: Without dead ends: 319 [2018-04-10 14:15:08,445 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 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:15:08,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-04-10 14:15:08,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 318. [2018-04-10 14:15:08,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-04-10 14:15:08,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 358 transitions. [2018-04-10 14:15:08,448 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 358 transitions. Word has length 58 [2018-04-10 14:15:08,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:08,448 INFO L459 AbstractCegarLoop]: Abstraction has 318 states and 358 transitions. [2018-04-10 14:15:08,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:15:08,448 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 358 transitions. [2018-04-10 14:15:08,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-10 14:15:08,449 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:08,449 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] [2018-04-10 14:15:08,449 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:08,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1981068824, now seen corresponding path program 1 times [2018-04-10 14:15:08,449 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:08,449 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:08,449 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:08,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:08,450 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:08,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:08,585 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:15:08,585 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:15:08,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-10 14:15:08,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 14:15:08,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 14:15:08,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:15:08,586 INFO L87 Difference]: Start difference. First operand 318 states and 358 transitions. Second operand 14 states. [2018-04-10 14:15:09,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:09,267 INFO L93 Difference]: Finished difference Result 794 states and 869 transitions. [2018-04-10 14:15:09,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 14:15:09,267 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2018-04-10 14:15:09,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:09,269 INFO L225 Difference]: With dead ends: 794 [2018-04-10 14:15:09,270 INFO L226 Difference]: Without dead ends: 794 [2018-04-10 14:15:09,270 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=451, Invalid=1355, Unknown=0, NotChecked=0, Total=1806 [2018-04-10 14:15:09,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-04-10 14:15:09,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 433. [2018-04-10 14:15:09,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-04-10 14:15:09,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 499 transitions. [2018-04-10 14:15:09,278 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 499 transitions. Word has length 62 [2018-04-10 14:15:09,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:09,278 INFO L459 AbstractCegarLoop]: Abstraction has 433 states and 499 transitions. [2018-04-10 14:15:09,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 14:15:09,278 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 499 transitions. [2018-04-10 14:15:09,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-10 14:15:09,279 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:09,279 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] [2018-04-10 14:15:09,279 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:09,279 INFO L82 PathProgramCache]: Analyzing trace with hash -244403719, now seen corresponding path program 1 times [2018-04-10 14:15:09,280 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:09,280 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:09,281 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:09,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:09,281 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:09,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:09,356 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:15:09,357 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:15:09,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:15:09,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 14:15:09,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 14:15:09,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:15:09,393 INFO L87 Difference]: Start difference. First operand 433 states and 499 transitions. Second operand 7 states. [2018-04-10 14:15:09,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:09,541 INFO L93 Difference]: Finished difference Result 456 states and 517 transitions. [2018-04-10 14:15:09,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:15:09,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2018-04-10 14:15:09,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:09,542 INFO L225 Difference]: With dead ends: 456 [2018-04-10 14:15:09,542 INFO L226 Difference]: Without dead ends: 456 [2018-04-10 14:15:09,542 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:15:09,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-04-10 14:15:09,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 433. [2018-04-10 14:15:09,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-04-10 14:15:09,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 498 transitions. [2018-04-10 14:15:09,546 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 498 transitions. Word has length 63 [2018-04-10 14:15:09,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:09,547 INFO L459 AbstractCegarLoop]: Abstraction has 433 states and 498 transitions. [2018-04-10 14:15:09,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 14:15:09,547 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 498 transitions. [2018-04-10 14:15:09,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-10 14:15:09,548 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:09,548 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] [2018-04-10 14:15:09,548 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:09,548 INFO L82 PathProgramCache]: Analyzing trace with hash 935150629, now seen corresponding path program 1 times [2018-04-10 14:15:09,548 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:09,548 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:09,549 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:09,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:09,549 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:09,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:09,579 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:15:09,579 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:15:09,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:15:09,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 14:15:09,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 14:15:09,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 14:15:09,580 INFO L87 Difference]: Start difference. First operand 433 states and 498 transitions. Second operand 3 states. [2018-04-10 14:15:09,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:09,587 INFO L93 Difference]: Finished difference Result 701 states and 812 transitions. [2018-04-10 14:15:09,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 14:15:09,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-04-10 14:15:09,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:09,589 INFO L225 Difference]: With dead ends: 701 [2018-04-10 14:15:09,590 INFO L226 Difference]: Without dead ends: 701 [2018-04-10 14:15:09,590 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 14:15:09,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-04-10 14:15:09,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 525. [2018-04-10 14:15:09,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-04-10 14:15:09,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 615 transitions. [2018-04-10 14:15:09,597 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 615 transitions. Word has length 63 [2018-04-10 14:15:09,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:09,597 INFO L459 AbstractCegarLoop]: Abstraction has 525 states and 615 transitions. [2018-04-10 14:15:09,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 14:15:09,597 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 615 transitions. [2018-04-10 14:15:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-10 14:15:09,598 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:09,598 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:15:09,598 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:09,598 INFO L82 PathProgramCache]: Analyzing trace with hash 992408931, now seen corresponding path program 1 times [2018-04-10 14:15:09,599 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:09,599 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:09,600 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:09,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:09,600 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:09,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:09,691 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:15:09,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:15:09,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 14:15:09,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:15:09,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:15:09,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:15:09,692 INFO L87 Difference]: Start difference. First operand 525 states and 615 transitions. Second operand 6 states. [2018-04-10 14:15:09,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:09,772 INFO L93 Difference]: Finished difference Result 503 states and 578 transitions. [2018-04-10 14:15:09,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:15:09,773 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-04-10 14:15:09,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:09,774 INFO L225 Difference]: With dead ends: 503 [2018-04-10 14:15:09,774 INFO L226 Difference]: Without dead ends: 503 [2018-04-10 14:15:09,775 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:15:09,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-04-10 14:15:09,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 428. [2018-04-10 14:15:09,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-04-10 14:15:09,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 487 transitions. [2018-04-10 14:15:09,780 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 487 transitions. Word has length 63 [2018-04-10 14:15:09,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:09,780 INFO L459 AbstractCegarLoop]: Abstraction has 428 states and 487 transitions. [2018-04-10 14:15:09,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:15:09,780 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 487 transitions. [2018-04-10 14:15:09,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-10 14:15:09,781 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:09,781 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] [2018-04-10 14:15:09,781 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:09,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1545552034, now seen corresponding path program 1 times [2018-04-10 14:15:09,781 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:09,781 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:09,782 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:09,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:09,782 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:09,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:09,912 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:15:09,913 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:15:09,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-10 14:15:09,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 14:15:09,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 14:15:09,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-04-10 14:15:09,913 INFO L87 Difference]: Start difference. First operand 428 states and 487 transitions. Second operand 11 states. [2018-04-10 14:15:10,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:10,323 INFO L93 Difference]: Finished difference Result 694 states and 796 transitions. [2018-04-10 14:15:10,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 14:15:10,323 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2018-04-10 14:15:10,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:10,324 INFO L225 Difference]: With dead ends: 694 [2018-04-10 14:15:10,325 INFO L226 Difference]: Without dead ends: 694 [2018-04-10 14:15:10,325 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2018-04-10 14:15:10,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2018-04-10 14:15:10,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 398. [2018-04-10 14:15:10,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-04-10 14:15:10,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 455 transitions. [2018-04-10 14:15:10,329 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 455 transitions. Word has length 65 [2018-04-10 14:15:10,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:10,330 INFO L459 AbstractCegarLoop]: Abstraction has 398 states and 455 transitions. [2018-04-10 14:15:10,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 14:15:10,330 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 455 transitions. [2018-04-10 14:15:10,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-10 14:15:10,330 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:10,331 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] [2018-04-10 14:15:10,331 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:10,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1982567314, now seen corresponding path program 1 times [2018-04-10 14:15:10,331 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:10,331 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:10,332 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:10,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:10,332 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:10,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:10,385 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:15:10,385 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:15:10,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:15:10,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:15:10,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:15:10,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:15:10,386 INFO L87 Difference]: Start difference. First operand 398 states and 455 transitions. Second operand 5 states. [2018-04-10 14:15:10,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:10,452 INFO L93 Difference]: Finished difference Result 414 states and 471 transitions. [2018-04-10 14:15:10,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:15:10,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-04-10 14:15:10,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:10,453 INFO L225 Difference]: With dead ends: 414 [2018-04-10 14:15:10,453 INFO L226 Difference]: Without dead ends: 414 [2018-04-10 14:15:10,453 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:15:10,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-04-10 14:15:10,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 402. [2018-04-10 14:15:10,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-04-10 14:15:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 458 transitions. [2018-04-10 14:15:10,458 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 458 transitions. Word has length 65 [2018-04-10 14:15:10,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:10,458 INFO L459 AbstractCegarLoop]: Abstraction has 402 states and 458 transitions. [2018-04-10 14:15:10,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:15:10,458 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 458 transitions. [2018-04-10 14:15:10,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-10 14:15:10,459 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:10,459 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] [2018-04-10 14:15:10,459 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:10,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1390252947, now seen corresponding path program 1 times [2018-04-10 14:15:10,459 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:10,459 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:10,460 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:10,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:10,460 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:10,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:10,822 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:15:10,822 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:15:10,822 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:15:10,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:10,844 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:15:10,967 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:15:10,973 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:15:10,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:10,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:10,994 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:15:11,001 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:15:11,001 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:11,003 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:11,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:11,019 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-04-10 14:15:11,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:11,116 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:11,117 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:15:11,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:11,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:11,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:35 [2018-04-10 14:15:11,212 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:15:11,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:11,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:15:11,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:11,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:11,231 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:15:11,233 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:11,234 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:15:11,235 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:11,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:11,246 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:15:11,246 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:39 [2018-04-10 14:15:11,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:11,314 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 36 treesize of output 37 [2018-04-10 14:15:11,317 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:15:11,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:11,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:11,330 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:11,333 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 26 [2018-04-10 14:15:11,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 14:15:11,334 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:11,337 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:11,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:11,345 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:58 [2018-04-10 14:15:11,376 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:15:11,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:11,380 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:15:11,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:11,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:11,415 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:15:11,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:11,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 14:15:11,418 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:11,423 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:11,433 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:15:11,433 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:97, output treesize:81 [2018-04-10 14:15:11,506 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:15:11,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:11,510 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:15:11,511 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:15:11,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:11,519 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:15:11,520 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:11,524 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:15:11,532 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:15:11,533 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:15:11,534 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:11,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:11,538 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:15:11,539 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:11,540 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:11,544 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:15:11,544 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:99, output treesize:7 [2018-04-10 14:15:11,577 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:15:11,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:15:11,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 30 [2018-04-10 14:15:11,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-10 14:15:11,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-10 14:15:11,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-04-10 14:15:11,598 INFO L87 Difference]: Start difference. First operand 402 states and 458 transitions. Second operand 30 states. [2018-04-10 14:15:13,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:13,354 INFO L93 Difference]: Finished difference Result 742 states and 820 transitions. [2018-04-10 14:15:13,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-10 14:15:13,354 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2018-04-10 14:15:13,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:13,355 INFO L225 Difference]: With dead ends: 742 [2018-04-10 14:15:13,356 INFO L226 Difference]: Without dead ends: 742 [2018-04-10 14:15:13,356 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=817, Invalid=3214, Unknown=1, NotChecked=0, Total=4032 [2018-04-10 14:15:13,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-04-10 14:15:13,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 487. [2018-04-10 14:15:13,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-04-10 14:15:13,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 549 transitions. [2018-04-10 14:15:13,363 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 549 transitions. Word has length 67 [2018-04-10 14:15:13,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:13,363 INFO L459 AbstractCegarLoop]: Abstraction has 487 states and 549 transitions. [2018-04-10 14:15:13,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-10 14:15:13,364 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 549 transitions. [2018-04-10 14:15:13,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-10 14:15:13,364 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:13,365 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:15:13,365 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:13,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1559864763, now seen corresponding path program 1 times [2018-04-10 14:15:13,365 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:13,365 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:13,366 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:13,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:13,366 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:13,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:13,609 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:15:13,609 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:15:13,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-10 14:15:13,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 14:15:13,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 14:15:13,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-04-10 14:15:13,610 INFO L87 Difference]: Start difference. First operand 487 states and 549 transitions. Second operand 12 states. [2018-04-10 14:15:14,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:14,001 INFO L93 Difference]: Finished difference Result 513 states and 569 transitions. [2018-04-10 14:15:14,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 14:15:14,001 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 69 [2018-04-10 14:15:14,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:14,002 INFO L225 Difference]: With dead ends: 513 [2018-04-10 14:15:14,002 INFO L226 Difference]: Without dead ends: 513 [2018-04-10 14:15:14,002 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=425, Unknown=0, NotChecked=0, Total=600 [2018-04-10 14:15:14,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-04-10 14:15:14,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 497. [2018-04-10 14:15:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-04-10 14:15:14,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 559 transitions. [2018-04-10 14:15:14,007 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 559 transitions. Word has length 69 [2018-04-10 14:15:14,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:14,007 INFO L459 AbstractCegarLoop]: Abstraction has 497 states and 559 transitions. [2018-04-10 14:15:14,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 14:15:14,007 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 559 transitions. [2018-04-10 14:15:14,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-10 14:15:14,007 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:14,008 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] [2018-04-10 14:15:14,008 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:14,008 INFO L82 PathProgramCache]: Analyzing trace with hash -414101251, now seen corresponding path program 1 times [2018-04-10 14:15:14,008 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:14,008 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:14,008 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:14,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:14,009 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:14,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:14,136 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:15:14,136 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:15:14,136 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:15:14,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:14,195 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:15:14,223 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:14,225 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:14,226 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:15:14,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:14,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:14,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-10 14:15:14,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:15:14,268 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:15:14,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:14,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:14,287 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:15:14,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-10 14:15:14,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:14,381 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 36 treesize of output 37 [2018-04-10 14:15:14,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:15:14,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:14,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:14,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:14,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-04-10 14:15:14,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-04-10 14:15:14,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:14,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:15:14,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:14,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:14,577 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:15:14,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:47 [2018-04-10 14:15:14,641 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 49 treesize of output 31 [2018-04-10 14:15:14,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:14,644 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:15:14,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:14,651 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 19 treesize of output 10 [2018-04-10 14:15:14,651 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:14,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:14,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:15:14,659 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:15 [2018-04-10 14:15:14,724 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:15:14,753 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:15:14,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-04-10 14:15:14,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 14:15:14,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 14:15:14,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2018-04-10 14:15:14,754 INFO L87 Difference]: Start difference. First operand 497 states and 559 transitions. Second operand 22 states. [2018-04-10 14:15:15,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:15,344 INFO L93 Difference]: Finished difference Result 599 states and 646 transitions. [2018-04-10 14:15:15,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 14:15:15,344 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 69 [2018-04-10 14:15:15,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:15,345 INFO L225 Difference]: With dead ends: 599 [2018-04-10 14:15:15,346 INFO L226 Difference]: Without dead ends: 599 [2018-04-10 14:15:15,346 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=776, Unknown=0, NotChecked=0, Total=992 [2018-04-10 14:15:15,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-04-10 14:15:15,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 498. [2018-04-10 14:15:15,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-04-10 14:15:15,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 561 transitions. [2018-04-10 14:15:15,349 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 561 transitions. Word has length 69 [2018-04-10 14:15:15,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:15,349 INFO L459 AbstractCegarLoop]: Abstraction has 498 states and 561 transitions. [2018-04-10 14:15:15,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 14:15:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 561 transitions. [2018-04-10 14:15:15,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-10 14:15:15,350 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:15,350 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] [2018-04-10 14:15:15,350 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:15,350 INFO L82 PathProgramCache]: Analyzing trace with hash -414101250, now seen corresponding path program 1 times [2018-04-10 14:15:15,350 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:15,350 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:15,351 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:15,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:15,351 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:15,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:15,512 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:15:15,512 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:15:15,512 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:15:15,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:15,533 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:15:15,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:15,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:15,541 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:15:15,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:15,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 14:15:15,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:15,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:15,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-10 14:15:15,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:15:15,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:15:15,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:15,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:15,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:15:15,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:15:15,574 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:15,575 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:15,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:15:15,583 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-10 14:15:15,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:15,628 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 19 treesize of output 24 [2018-04-10 14:15:15,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 14:15:15,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:15,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:15,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:15,655 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 47 treesize of output 48 [2018-04-10 14:15:15,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:15:15,657 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:15,662 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:15,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:15,668 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2018-04-10 14:15:15,692 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:15:15,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:15,695 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:15:15,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:15,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:15,714 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 40 treesize of output 35 [2018-04-10 14:15:15,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:15,716 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:15:15,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:15,720 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:15,727 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:15:15,728 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:89, output treesize:73 [2018-04-10 14:15:15,789 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 73 treesize of output 51 [2018-04-10 14:15:15,790 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 39 treesize of output 26 [2018-04-10 14:15:15,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:15,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:15,799 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:15:15,799 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:15,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:15,827 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 31 treesize of output 27 [2018-04-10 14:15:15,829 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:15:15,830 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:15,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:15,837 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:15:15,838 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:15,840 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:15,845 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:15:15,845 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:87, output treesize:9 [2018-04-10 14:15:15,891 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:15:15,922 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:15:15,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2018-04-10 14:15:15,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 14:15:15,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 14:15:15,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-04-10 14:15:15,923 INFO L87 Difference]: Start difference. First operand 498 states and 561 transitions. Second operand 18 states. [2018-04-10 14:15:16,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:16,750 INFO L93 Difference]: Finished difference Result 580 states and 627 transitions. [2018-04-10 14:15:16,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 14:15:16,751 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 69 [2018-04-10 14:15:16,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:16,752 INFO L225 Difference]: With dead ends: 580 [2018-04-10 14:15:16,752 INFO L226 Difference]: Without dead ends: 580 [2018-04-10 14:15:16,752 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=707, Unknown=3, NotChecked=0, Total=870 [2018-04-10 14:15:16,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-04-10 14:15:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 521. [2018-04-10 14:15:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-04-10 14:15:16,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 589 transitions. [2018-04-10 14:15:16,755 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 589 transitions. Word has length 69 [2018-04-10 14:15:16,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:16,755 INFO L459 AbstractCegarLoop]: Abstraction has 521 states and 589 transitions. [2018-04-10 14:15:16,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 14:15:16,755 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 589 transitions. [2018-04-10 14:15:16,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-10 14:15:16,756 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:16,756 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] [2018-04-10 14:15:16,756 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:16,756 INFO L82 PathProgramCache]: Analyzing trace with hash -176123504, now seen corresponding path program 1 times [2018-04-10 14:15:16,756 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:16,756 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:16,757 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:16,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:16,757 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:16,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:17,076 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:15:17,076 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:15:17,076 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:15:17,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:17,109 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:15:17,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:17,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:17,136 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:15:17,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-10 14:15:17,157 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:15:17,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:15:17,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,164 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:15:17,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-10 14:15:17,190 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:15:17,191 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:15:17,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,198 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:15:17,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-10 14:15:17,247 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:15:17,249 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:15:17,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,260 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:15:17,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:58 [2018-04-10 14:15:23,312 WARN L151 SmtUtils]: Spent 2012ms on a formula simplification. DAG size of input: 28 DAG size of output 24 [2018-04-10 14:15:23,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:23,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:23,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:23,362 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 52 [2018-04-10 14:15:23,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:23,375 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:15:23,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:70 [2018-04-10 14:15:23,423 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:15:23,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:23,425 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:15:23,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:23,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:23,446 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:15:23,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-04-10 14:15:23,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:23,561 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 86 treesize of output 100 [2018-04-10 14:15:23,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:15:23,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:23,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:23,581 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:15:23,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:86 [2018-04-10 14:15:23,649 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:15:23,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:23,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:15:23,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:23,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:23,675 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:15:23,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:108, output treesize:100 [2018-04-10 14:15:23,830 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:15:23,832 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:15:23,833 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:15:23,843 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:15:23,843 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:23,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:23,852 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:15:23,852 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:23,858 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:15:23,863 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:15:23,864 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:28 [2018-04-10 14:15:24,015 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:15:24,044 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:15:24,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2018-04-10 14:15:24,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-10 14:15:24,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-10 14:15:24,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1122, Unknown=3, NotChecked=0, Total=1332 [2018-04-10 14:15:24,045 INFO L87 Difference]: Start difference. First operand 521 states and 589 transitions. Second operand 37 states. [2018-04-10 14:15:40,483 WARN L151 SmtUtils]: Spent 2019ms on a formula simplification. DAG size of input: 38 DAG size of output 33 [2018-04-10 14:15:47,570 WARN L151 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 54 DAG size of output 52 [2018-04-10 14:15:49,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:49,163 INFO L93 Difference]: Finished difference Result 879 states and 973 transitions. [2018-04-10 14:15:49,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-10 14:15:49,163 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-04-10 14:15:49,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:49,165 INFO L225 Difference]: With dead ends: 879 [2018-04-10 14:15:49,165 INFO L226 Difference]: Without dead ends: 879 [2018-04-10 14:15:49,166 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=920, Invalid=3622, Unknown=14, NotChecked=0, Total=4556 [2018-04-10 14:15:49,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-04-10 14:15:49,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 521. [2018-04-10 14:15:49,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-04-10 14:15:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 588 transitions. [2018-04-10 14:15:49,170 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 588 transitions. Word has length 72 [2018-04-10 14:15:49,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:49,170 INFO L459 AbstractCegarLoop]: Abstraction has 521 states and 588 transitions. [2018-04-10 14:15:49,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-10 14:15:49,170 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 588 transitions. [2018-04-10 14:15:49,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-10 14:15:49,170 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:49,170 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] [2018-04-10 14:15:49,170 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:49,171 INFO L82 PathProgramCache]: Analyzing trace with hash -176123503, now seen corresponding path program 1 times [2018-04-10 14:15:49,171 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:49,171 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:49,171 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:49,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:49,171 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:49,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:49,835 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:15:49,835 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:15:49,835 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:15:49,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:49,857 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:15:49,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:49,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:49,890 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:15:49,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:49,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 14:15:49,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:49,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:49,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-10 14:15:49,925 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:15:49,927 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:15:49,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:49,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:49,937 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:15:49,938 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:15:49,939 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:49,939 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:49,946 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:15:49,946 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:53 [2018-04-10 14:15:49,996 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:15:49,997 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:15:49,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:50,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:50,014 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:15:50,015 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:15:50,015 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:50,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:50,028 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:15:50,028 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:99, output treesize:79 [2018-04-10 14:15:50,098 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:15:50,109 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:15:50,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:50,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:50,130 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 99 treesize of output 85 [2018-04-10 14:15:50,132 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:15:50,132 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:50,139 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:50,151 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:15:50,151 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:129, output treesize:109 [2018-04-10 14:15:54,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:54,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:54,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:54,249 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:15:54,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:54,263 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 18 treesize of output 27 [2018-04-10 14:15:54,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:54,275 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:15:54,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:92 [2018-04-10 14:15:54,318 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:15:54,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:54,321 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:15:54,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:54,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:54,352 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:15:54,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:54,355 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:15:54,355 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:54,364 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:54,378 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:15:54,378 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:114, output treesize:104 [2018-04-10 14:15:54,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:54,508 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 61 [2018-04-10 14:15:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 14:15:54,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:54,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:54,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:54,540 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 112 treesize of output 126 [2018-04-10 14:15:54,541 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:15:54,541 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:54,554 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:54,569 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:15:54,569 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:127, output treesize:119 [2018-04-10 14:15:54,654 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 147 treesize of output 140 [2018-04-10 14:15:54,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:54,658 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:15:54,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:54,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:54,703 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:15:54,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:54,706 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:15:54,706 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:54,716 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:54,735 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:15:54,735 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:162, output treesize:146 [2018-04-10 14:15:54,867 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:15:54,873 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:15:54,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:54,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:54,889 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:15:54,889 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:54,902 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:15:54,902 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:15:54,912 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:15:54,932 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:15:54,934 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:15:54,934 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:54,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:54,944 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:15:54,944 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:54,948 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:15:54,948 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:54,949 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:54,956 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:15:54,956 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:164, output treesize:18 [2018-04-10 14:15:55,091 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:15:55,108 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:15:55,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2018-04-10 14:15:55,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-10 14:15:55,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-10 14:15:55,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1427, Unknown=3, NotChecked=0, Total=1640 [2018-04-10 14:15:55,109 INFO L87 Difference]: Start difference. First operand 521 states and 588 transitions. Second operand 41 states. [2018-04-10 14:15:57,662 WARN L151 SmtUtils]: Spent 2045ms on a formula simplification. DAG size of input: 74 DAG size of output 52 [2018-04-10 14:15:58,889 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 86 DAG size of output 76 [2018-04-10 14:15:59,701 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 164 DAG size of output 84 [2018-04-10 14:15:59,873 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 164 DAG size of output 84 [2018-04-10 14:16:01,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:16:01,670 INFO L93 Difference]: Finished difference Result 1073 states and 1185 transitions. [2018-04-10 14:16:01,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-10 14:16:01,670 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 72 [2018-04-10 14:16:01,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:16:01,672 INFO L225 Difference]: With dead ends: 1073 [2018-04-10 14:16:01,672 INFO L226 Difference]: Without dead ends: 1073 [2018-04-10 14:16:01,673 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2084 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=1402, Invalid=6073, Unknown=7, NotChecked=0, Total=7482 [2018-04-10 14:16:01,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2018-04-10 14:16:01,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 521. [2018-04-10 14:16:01,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-04-10 14:16:01,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 585 transitions. [2018-04-10 14:16:01,680 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 585 transitions. Word has length 72 [2018-04-10 14:16:01,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:16:01,681 INFO L459 AbstractCegarLoop]: Abstraction has 521 states and 585 transitions. [2018-04-10 14:16:01,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-10 14:16:01,681 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 585 transitions. [2018-04-10 14:16:01,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-10 14:16:01,681 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:16:01,681 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, 1] [2018-04-10 14:16:01,681 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:16:01,681 INFO L82 PathProgramCache]: Analyzing trace with hash -556281749, now seen corresponding path program 1 times [2018-04-10 14:16:01,682 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:16:01,682 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:16:01,682 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:01,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:16:01,683 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:16:01,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:16:02,099 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:16:02,099 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:16:02,099 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:16:02,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:16:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:16:02,135 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:16:02,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:02,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:02,141 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:16:02,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:02,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:02,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-10 14:16:02,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:16:02,210 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:16:02,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:02,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:02,220 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:16:02,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-10 14:16:02,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:02,328 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 36 treesize of output 37 [2018-04-10 14:16:02,330 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:16:02,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:02,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:02,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:02,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-04-10 14:16:02,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:02,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:02,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:02,376 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 20 treesize of output 21 [2018-04-10 14:16:02,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:02,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:02,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:35 [2018-04-10 14:16:02,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:02,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-04-10 14:16:02,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:02,455 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 16 treesize of output 23 [2018-04-10 14:16:02,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:02,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:02,474 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:16:02,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:52 [2018-04-10 14:16:02,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:02,563 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 70 treesize of output 78 [2018-04-10 14:16:02,565 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:16:02,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:02,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:02,586 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:16:02,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:61 [2018-04-10 14:16:02,671 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 111 treesize of output 80 [2018-04-10 14:16:02,674 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:16:02,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:02,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:02,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 14:16:02,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:111, output treesize:97 [2018-04-10 14:16:06,770 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 104 treesize of output 61 [2018-04-10 14:16:06,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-04-10 14:16:06,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:06,779 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:16:06,780 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:06,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:06,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-04-10 14:16:06,786 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:06,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:06,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:06,796 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:104, output treesize:5 [2018-04-10 14:16:06,812 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:16:06,830 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:16:06,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 32 [2018-04-10 14:16:06,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-10 14:16:06,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-10 14:16:06,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=903, Unknown=2, NotChecked=0, Total=1056 [2018-04-10 14:16:06,831 INFO L87 Difference]: Start difference. First operand 521 states and 585 transitions. Second operand 33 states. [2018-04-10 14:16:19,731 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 84 DAG size of output 61 [2018-04-10 14:16:25,849 WARN L151 SmtUtils]: Spent 4076ms on a formula simplification. DAG size of input: 89 DAG size of output 67 [2018-04-10 14:16:36,057 WARN L151 SmtUtils]: Spent 4167ms on a formula simplification. DAG size of input: 77 DAG size of output 63 [2018-04-10 14:16:49,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:16:49,304 INFO L93 Difference]: Finished difference Result 727 states and 792 transitions. [2018-04-10 14:16:49,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 14:16:49,304 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 74 [2018-04-10 14:16:49,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:16:49,305 INFO L225 Difference]: With dead ends: 727 [2018-04-10 14:16:49,305 INFO L226 Difference]: Without dead ends: 727 [2018-04-10 14:16:49,306 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 39.8s TimeCoverageRelationStatistics Valid=669, Invalid=2622, Unknown=15, NotChecked=0, Total=3306 [2018-04-10 14:16:49,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-04-10 14:16:49,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 582. [2018-04-10 14:16:49,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-04-10 14:16:49,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 656 transitions. [2018-04-10 14:16:49,310 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 656 transitions. Word has length 74 [2018-04-10 14:16:49,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:16:49,310 INFO L459 AbstractCegarLoop]: Abstraction has 582 states and 656 transitions. [2018-04-10 14:16:49,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-10 14:16:49,310 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 656 transitions. [2018-04-10 14:16:49,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-10 14:16:49,311 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:16:49,311 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, 1] [2018-04-10 14:16:49,311 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:16:49,311 INFO L82 PathProgramCache]: Analyzing trace with hash -556281748, now seen corresponding path program 1 times [2018-04-10 14:16:49,311 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:16:49,311 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:16:49,312 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:49,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:16:49,312 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:16:49,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:16:49,858 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:16:49,858 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:16:49,858 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:16:49,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:16:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:16:49,882 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:16:49,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:49,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:49,907 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:16:49,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:49,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:49,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-10 14:16:49,932 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:16:49,934 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:16:49,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:49,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:49,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 11 treesize of output 8 [2018-04-10 14:16:49,943 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:16:49,943 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:49,944 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:49,949 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:16:49,949 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-10 14:16:50,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:50,008 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 19 treesize of output 24 [2018-04-10 14:16:50,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 14:16:50,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:50,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:50,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:50,029 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 47 treesize of output 48 [2018-04-10 14:16:50,032 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:16:50,032 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:50,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:50,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:50,062 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:58 [2018-04-10 14:16:50,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:50,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:50,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:50,092 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 20 treesize of output 21 [2018-04-10 14:16:50,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:50,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:50,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:56 [2018-04-10 14:16:50,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:50,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2018-04-10 14:16:50,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:50,132 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 16 treesize of output 23 [2018-04-10 14:16:50,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:50,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:50,158 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 32 treesize of output 38 [2018-04-10 14:16:50,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:50,161 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:16:50,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:50,167 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:50,181 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:16:50,181 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:75 [2018-04-10 14:16:50,243 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 42 treesize of output 65 [2018-04-10 14:16:50,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:16:50,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:50,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:50,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:50,269 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 94 treesize of output 102 [2018-04-10 14:16:50,271 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:16:50,271 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:50,280 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:50,292 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:16:50,292 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:121, output treesize:97 [2018-04-10 14:16:50,458 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 174 treesize of output 131 [2018-04-10 14:16:50,461 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:16:50,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:50,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:50,499 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 69 treesize of output 84 [2018-04-10 14:16:50,502 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:16:50,503 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:50,510 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:50,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 14:16:50,526 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:184, output treesize:156 [2018-04-10 14:16:54,644 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 153 treesize of output 96 [2018-04-10 14:16:54,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2018-04-10 14:16:54,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:54,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:54,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2018-04-10 14:16:54,658 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:16:54,668 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:16:54,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:54,675 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:16:54,685 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 38 treesize of output 40 [2018-04-10 14:16:54,686 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:16:54,687 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:54,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, 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:16:54,693 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:54,695 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:16:54,696 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:54,697 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:54,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:54,703 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:170, output treesize:9 [2018-04-10 14:16:54,766 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:16:54,783 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:16:54,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 36 [2018-04-10 14:16:54,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-10 14:16:54,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-10 14:16:54,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1209, Unknown=2, NotChecked=0, Total=1332 [2018-04-10 14:16:54,784 INFO L87 Difference]: Start difference. First operand 582 states and 656 transitions. Second operand 37 states. [2018-04-10 14:16:59,707 WARN L151 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 87 DAG size of output 64 [2018-04-10 14:17:13,746 WARN L151 SmtUtils]: Spent 4059ms on a formula simplification. DAG size of input: 109 DAG size of output 76 [2018-04-10 14:17:39,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:17:39,544 INFO L93 Difference]: Finished difference Result 766 states and 825 transitions. [2018-04-10 14:17:39,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-10 14:17:39,544 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 74 [2018-04-10 14:17:39,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:17:39,546 INFO L225 Difference]: With dead ends: 766 [2018-04-10 14:17:39,546 INFO L226 Difference]: Without dead ends: 766 [2018-04-10 14:17:39,547 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 42.4s TimeCoverageRelationStatistics Valid=810, Invalid=4002, Unknown=18, NotChecked=0, Total=4830 [2018-04-10 14:17:39,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2018-04-10 14:17:39,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 605. [2018-04-10 14:17:39,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-04-10 14:17:39,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 684 transitions. [2018-04-10 14:17:39,557 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 684 transitions. Word has length 74 [2018-04-10 14:17:39,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:17:39,558 INFO L459 AbstractCegarLoop]: Abstraction has 605 states and 684 transitions. [2018-04-10 14:17:39,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-10 14:17:39,558 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 684 transitions. [2018-04-10 14:17:39,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-10 14:17:39,561 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:17:39,561 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] [2018-04-10 14:17:39,561 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:17:39,561 INFO L82 PathProgramCache]: Analyzing trace with hash -286750696, now seen corresponding path program 1 times [2018-04-10 14:17:39,561 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:17:39,561 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:17:39,562 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:17:39,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:17:39,562 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:17:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:17:39,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:17:40,468 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:17:40,468 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:17:40,468 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:17:40,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:17:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:17:40,519 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:17:40,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:17:40,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:17:40,567 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:17:40,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:17:40,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:17:40,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-10 14:17:40,611 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:17:40,612 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:17:40,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:17:40,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:17:40,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:17:40,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-10 14:17:40,697 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:17:40,702 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:17:40,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:17:40,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:17:40,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:17:40,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-10 14:17:40,793 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:17:40,796 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:17:40,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:17:40,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:17:40,823 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:17:40,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:58 [2018-04-10 14:17:46,883 WARN L151 SmtUtils]: Spent 2011ms on a formula simplification. DAG size of input: 28 DAG size of output 24 [2018-04-10 14:17:46,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:17:46,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:17:46,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:17:46,941 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 52 [2018-04-10 14:17:46,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:17:46,952 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:17:46,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:70 [2018-04-10 14:17:46,996 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:17:46,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:17:46,998 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:17:46,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:17:47,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:17:47,015 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:17:47,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-04-10 14:17:47,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:17:47,147 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 86 treesize of output 100 [2018-04-10 14:17:47,148 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:17:47,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:17:47,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:17:47,166 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:17:47,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:86 [2018-04-10 14:17:47,228 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:17:47,228 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:17:47,229 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:17:47,230 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:17:47,230 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 91 [2018-04-10 14:17:47,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:17:47,246 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:17:47,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:97, output treesize:113 [2018-04-10 14:17:47,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:17:47,309 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:17:47,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:17:47,313 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:17:47,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:17:47,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:17:47,338 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:17:47,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:126, output treesize:137 [2018-04-10 14:17:47,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:17:47,477 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:17:47,479 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:17:47,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:17:47,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:17:47,511 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:17:47,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:160, output treesize:150 [2018-04-10 14:17:47,677 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:17:47,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:17:47,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:17:47,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:17:47,723 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:17:47,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:204, output treesize:190 [2018-04-10 14:17:50,867 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:17:50,869 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:17:50,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:17:50,882 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:17:50,882 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:17:50,893 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:17:50,893 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:17:50,894 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:17:50,903 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:17:50,904 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:17:50,910 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:17:50,918 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:17:50,918 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:184, output treesize:45 [2018-04-10 14:17:51,045 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:17:51,063 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:17:51,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 25] total 54 [2018-04-10 14:17:51,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-10 14:17:51,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-10 14:17:51,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=2512, Unknown=7, NotChecked=0, Total=2970 [2018-04-10 14:17:51,064 INFO L87 Difference]: Start difference. First operand 605 states and 684 transitions. Second operand 55 states. [2018-04-10 14:18:07,682 WARN L151 SmtUtils]: Spent 2035ms on a formula simplification. DAG size of input: 52 DAG size of output 40 Received shutdown request... [2018-04-10 14:18:14,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 14:18:14,882 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 14:18:14,886 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 14:18:14,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 02:18:14 BoogieIcfgContainer [2018-04-10 14:18:14,886 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 14:18:14,886 INFO L168 Benchmark]: Toolchain (without parser) took 199823.89 ms. Allocated memory was 401.1 MB in the beginning and 1.1 GB in the end (delta: 687.9 MB). Free memory was 337.3 MB in the beginning and 657.1 MB in the end (delta: -319.7 MB). Peak memory consumption was 368.1 MB. Max. memory is 5.3 GB. [2018-04-10 14:18:14,887 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 401.1 MB. Free memory is still 361.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 14:18:14,887 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.20 ms. Allocated memory is still 401.1 MB. Free memory was 337.3 MB in the beginning and 310.9 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. [2018-04-10 14:18:14,887 INFO L168 Benchmark]: Boogie Preprocessor took 42.66 ms. Allocated memory is still 401.1 MB. Free memory was 310.9 MB in the beginning and 305.6 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 5.3 GB. [2018-04-10 14:18:14,888 INFO L168 Benchmark]: RCFGBuilder took 588.84 ms. Allocated memory was 401.1 MB in the beginning and 612.4 MB in the end (delta: 211.3 MB). Free memory was 305.6 MB in the beginning and 520.6 MB in the end (delta: -215.0 MB). Peak memory consumption was 22.4 MB. Max. memory is 5.3 GB. [2018-04-10 14:18:14,888 INFO L168 Benchmark]: TraceAbstraction took 198916.31 ms. Allocated memory was 612.4 MB in the beginning and 1.1 GB in the end (delta: 476.6 MB). Free memory was 520.6 MB in the beginning and 657.1 MB in the end (delta: -136.5 MB). Peak memory consumption was 340.1 MB. Max. memory is 5.3 GB. [2018-04-10 14:18:14,889 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.14 ms. Allocated memory is still 401.1 MB. Free memory is still 361.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 273.20 ms. Allocated memory is still 401.1 MB. Free memory was 337.3 MB in the beginning and 310.9 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.66 ms. Allocated memory is still 401.1 MB. Free memory was 310.9 MB in the beginning and 305.6 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 588.84 ms. Allocated memory was 401.1 MB in the beginning and 612.4 MB in the end (delta: 211.3 MB). Free memory was 305.6 MB in the beginning and 520.6 MB in the end (delta: -215.0 MB). Peak memory consumption was 22.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 198916.31 ms. Allocated memory was 612.4 MB in the beginning and 1.1 GB in the end (delta: 476.6 MB). Free memory was 520.6 MB in the beginning and 657.1 MB in the end (delta: -136.5 MB). Peak memory consumption was 340.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1003]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1047]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1047). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1044]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1047]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1047). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1017]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1003]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1044]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1017]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 26 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 187 locations, 63 error locations. TIMEOUT Result, 198.8s OverallTime, 40 OverallIterations, 2 TraceHistogramMax, 156.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6174 SDtfs, 24442 SDslu, 37368 SDs, 0 SdLazy, 28992 SolverSat, 1826 SolverUnsat, 58 SolverUnknown, 0 SolverNotchecked, 37.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1589 GetRequests, 666 SyntacticMatches, 36 SemanticMatches, 887 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9230 ImplicationChecksByTransitivity, 151.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=605occurred in iteration=39, 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, 39 MinimizatonAttempts, 5066 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 40.4s InterpolantComputationTime, 2669 NumberOfCodeBlocks, 2669 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 2618 ConstructedInterpolants, 310 QuantifiedInterpolants, 3689076 SizeOfPredicates, 149 NumberOfNonLiveVariables, 2288 ConjunctsInSsa, 379 ConjunctsInUnsatCore, 51 InterpolantComputations, 29 PerfectInterpolantSequences, 45/133 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/sll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_14-18-14-895.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_14-18-14-895.csv Completed graceful shutdown