java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-reverse_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-12 18:03:24,141 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 18:03:24,142 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 18:03:24,155 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 18:03:24,155 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 18:03:24,156 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 18:03:24,156 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 18:03:24,158 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 18:03:24,160 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 18:03:24,160 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 18:03:24,161 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 18:03:24,161 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 18:03:24,162 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 18:03:24,163 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 18:03:24,164 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 18:03:24,165 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 18:03:24,167 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 18:03:24,168 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 18:03:24,169 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 18:03:24,170 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 18:03:24,172 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 18:03:24,172 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 18:03:24,172 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 18:03:24,173 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 18:03:24,174 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 18:03:24,175 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 18:03:24,175 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 18:03:24,176 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 18:03:24,176 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 18:03:24,176 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 18:03:24,177 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 18:03:24,177 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-12 18:03:24,186 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 18:03:24,186 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 18:03:24,187 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 18:03:24,187 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 18:03:24,187 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 18:03:24,188 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 18:03:24,188 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 18:03:24,188 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 18:03:24,188 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 18:03:24,188 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 18:03:24,188 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 18:03:24,188 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 18:03:24,188 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 18:03:24,188 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 18:03:24,189 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 18:03:24,189 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 18:03:24,189 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 18:03:24,189 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 18:03:24,189 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 18:03:24,189 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 18:03:24,189 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 18:03:24,189 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-12 18:03:24,189 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-12 18:03:24,190 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 18:03:24,222 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 18:03:24,232 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 18:03:24,235 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 18:03:24,236 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 18:03:24,236 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 18:03:24,237 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,517 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG571cc099f [2018-04-12 18:03:24,667 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 18:03:24,667 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 18:03:24,668 INFO L168 CDTParser]: Scanning dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,674 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 18:03:24,674 INFO L215 ultiparseSymbolTable]: [2018-04-12 18:03:24,674 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 18:03:24,674 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,675 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 18:03:24,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__nlink_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____fd_mask in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__wchar_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__loff_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____int64_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__uint in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__u_int8_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____uid_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_once_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__dev_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____daddr_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__id_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__quad_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____clockid_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____uint8_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____key_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,677 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____blkcnt_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,677 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__ushort in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,677 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__u_int16_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,677 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,677 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,677 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__off_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,677 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____u_int in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,677 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__ldiv_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,677 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____u_quad_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,677 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,678 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____useconds_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,678 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,678 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,678 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__register_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,678 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____quad_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,678 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____ssize_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,678 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____off_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,678 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____ino64_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,678 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,679 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____pid_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,679 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____timer_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,679 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,679 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____gid_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,679 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__u_int in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,679 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__sigset_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,679 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__timer_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,679 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__u_int32_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,679 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____int32_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,679 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__clockid_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,679 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____fsword_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,679 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,679 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__ssize_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,679 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,679 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,679 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,679 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____uint64_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,680 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__fd_mask in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,680 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__idtype_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,680 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__key_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,680 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____nlink_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,680 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__int32_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,680 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____id_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,680 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__lldiv_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,680 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,680 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__fd_set in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,680 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____u_char in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,680 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,680 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_key_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,680 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____off64_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,680 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,680 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__div_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,680 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____uint32_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,680 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____blksize_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,681 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__blksize_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,681 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__DLL in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,681 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____rlim64_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,681 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____qaddr_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,681 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____rlim_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,681 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,681 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__blkcnt_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,681 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__u_char in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,681 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____suseconds_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,681 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__u_quad_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,681 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__time_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,681 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,681 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,681 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__uid_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,682 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__int16_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,682 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____uint16_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,682 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____fsid_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,682 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____socklen_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,682 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__ino_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,682 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pid_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,682 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____intptr_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,682 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__u_int64_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,682 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__int8_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,682 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__daddr_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,682 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__gid_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,683 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__size_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,683 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__u_short in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,683 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____ino_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,683 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____time_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,683 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____u_long in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,683 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____int16_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,683 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,683 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__int64_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,683 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____mode_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,683 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__fsid_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,683 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__caddr_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,684 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____sigset_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,684 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____int8_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,684 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____clock_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,684 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____loff_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,684 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__ulong in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,684 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____caddr_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,684 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__u_long in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,684 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__suseconds_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,684 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____dev_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,684 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__clock_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,684 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____u_short in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,685 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__mode_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:24,698 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG571cc099f [2018-04-12 18:03:24,701 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 18:03:24,702 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 18:03:24,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 18:03:24,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 18:03:24,708 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 18:03:24,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 06:03:24" (1/1) ... [2018-04-12 18:03:24,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c715fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:03:24, skipping insertion in model container [2018-04-12 18:03:24,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 06:03:24" (1/1) ... [2018-04-12 18:03:24,722 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 18:03:24,750 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 18:03:24,906 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 18:03:24,949 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 18:03:24,956 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-12 18:03:25,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:03:25 WrapperNode [2018-04-12 18:03:25,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 18:03:25,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 18:03:25,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 18:03:25,001 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 18:03:25,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:03:25" (1/1) ... [2018-04-12 18:03:25,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:03:25" (1/1) ... [2018-04-12 18:03:25,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:03:25" (1/1) ... [2018-04-12 18:03:25,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:03:25" (1/1) ... [2018-04-12 18:03:25,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:03:25" (1/1) ... [2018-04-12 18:03:25,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:03:25" (1/1) ... [2018-04-12 18:03:25,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:03:25" (1/1) ... [2018-04-12 18:03:25,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 18:03:25,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 18:03:25,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 18:03:25,045 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 18:03:25,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:03:25" (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-12 18:03:25,132 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 18:03:25,132 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 18:03:25,132 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 18:03:25,132 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-12 18:03:25,133 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-12 18:03:25,133 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-12 18:03:25,133 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-12 18:03:25,133 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-12 18:03:25,133 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-12 18:03:25,133 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-12 18:03:25,133 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-12 18:03:25,133 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-12 18:03:25,133 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-12 18:03:25,134 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-12 18:03:25,134 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-12 18:03:25,134 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-12 18:03:25,134 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-12 18:03:25,134 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-12 18:03:25,134 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-12 18:03:25,134 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-12 18:03:25,134 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-12 18:03:25,134 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-12 18:03:25,135 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-12 18:03:25,135 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-12 18:03:25,135 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-12 18:03:25,135 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-12 18:03:25,135 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-12 18:03:25,135 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-12 18:03:25,135 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-12 18:03:25,135 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-12 18:03:25,135 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-12 18:03:25,135 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-12 18:03:25,136 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-12 18:03:25,136 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-12 18:03:25,136 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-12 18:03:25,136 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-12 18:03:25,136 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-12 18:03:25,136 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-12 18:03:25,136 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-12 18:03:25,136 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-12 18:03:25,136 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-12 18:03:25,137 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-12 18:03:25,137 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-12 18:03:25,137 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-12 18:03:25,137 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-12 18:03:25,137 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-12 18:03:25,137 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-12 18:03:25,137 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-12 18:03:25,137 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-12 18:03:25,137 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-12 18:03:25,137 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-12 18:03:25,137 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-12 18:03:25,138 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-12 18:03:25,138 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-12 18:03:25,138 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-12 18:03:25,138 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-12 18:03:25,138 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-12 18:03:25,138 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-12 18:03:25,138 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-12 18:03:25,138 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-12 18:03:25,138 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-12 18:03:25,138 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-12 18:03:25,139 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-12 18:03:25,139 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-12 18:03:25,139 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-12 18:03:25,139 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-12 18:03:25,139 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-12 18:03:25,139 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-12 18:03:25,139 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-12 18:03:25,139 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-12 18:03:25,139 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-12 18:03:25,139 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-12 18:03:25,140 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-12 18:03:25,140 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-12 18:03:25,140 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-12 18:03:25,140 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-12 18:03:25,140 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-12 18:03:25,140 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-12 18:03:25,140 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-12 18:03:25,140 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-12 18:03:25,140 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-12 18:03:25,140 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-12 18:03:25,140 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-12 18:03:25,141 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-12 18:03:25,141 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-12 18:03:25,141 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-12 18:03:25,141 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-12 18:03:25,141 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-12 18:03:25,141 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-12 18:03:25,141 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-12 18:03:25,141 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-12 18:03:25,141 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-12 18:03:25,141 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-12 18:03:25,142 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-12 18:03:25,142 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-12 18:03:25,142 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-12 18:03:25,142 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-12 18:03:25,142 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-12 18:03:25,142 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-12 18:03:25,142 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-12 18:03:25,142 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-12 18:03:25,142 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-12 18:03:25,142 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-12 18:03:25,142 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-12 18:03:25,143 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-12 18:03:25,143 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-12 18:03:25,143 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-12 18:03:25,143 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-12 18:03:25,143 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 18:03:25,143 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 18:03:25,143 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-12 18:03:25,143 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-12 18:03:25,143 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-12 18:03:25,143 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-12 18:03:25,144 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 18:03:25,144 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 18:03:25,144 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 18:03:25,144 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-12 18:03:25,570 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 18:03:25,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 06:03:25 BoogieIcfgContainer [2018-04-12 18:03:25,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 18:03:25,572 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 18:03:25,572 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 18:03:25,575 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 18:03:25,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 06:03:24" (1/3) ... [2018-04-12 18:03:25,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@251690d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 06:03:25, skipping insertion in model container [2018-04-12 18:03:25,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:03:25" (2/3) ... [2018-04-12 18:03:25,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@251690d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 06:03:25, skipping insertion in model container [2018-04-12 18:03:25,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 06:03:25" (3/3) ... [2018-04-12 18:03:25,578 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:03:25,586 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-12 18:03:25,596 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-04-12 18:03:25,631 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 18:03:25,631 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 18:03:25,632 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 18:03:25,632 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-12 18:03:25,632 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-12 18:03:25,632 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 18:03:25,632 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 18:03:25,632 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 18:03:25,632 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 18:03:25,633 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 18:03:25,643 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states. [2018-04-12 18:03:25,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 18:03:25,648 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:03:25,649 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:03:25,649 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:03:25,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1664294412, now seen corresponding path program 1 times [2018-04-12 18:03:25,653 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:03:25,653 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:03:25,688 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:25,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:03:25,688 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:03:25,720 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:03:25,763 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-12 18:03:25,766 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:03:25,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 18:03:25,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 18:03:25,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 18:03:25,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 18:03:25,781 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 4 states. [2018-04-12 18:03:25,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:03:25,962 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2018-04-12 18:03:25,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 18:03:25,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 18:03:25,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:03:25,972 INFO L225 Difference]: With dead ends: 168 [2018-04-12 18:03:25,972 INFO L226 Difference]: Without dead ends: 164 [2018-04-12 18:03:25,973 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-12 18:03:25,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-12 18:03:26,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150. [2018-04-12 18:03:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-12 18:03:26,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2018-04-12 18:03:26,015 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 8 [2018-04-12 18:03:26,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:03:26,016 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2018-04-12 18:03:26,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 18:03:26,016 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2018-04-12 18:03:26,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 18:03:26,016 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:03:26,016 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:03:26,017 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:03:26,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1664294411, now seen corresponding path program 1 times [2018-04-12 18:03:26,017 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:03:26,017 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:03:26,019 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:26,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:03:26,019 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:03:26,031 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:03:26,061 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-12 18:03:26,062 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:03:26,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 18:03:26,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 18:03:26,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 18:03:26,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 18:03:26,064 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand 4 states. [2018-04-12 18:03:26,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:03:26,189 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2018-04-12 18:03:26,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 18:03:26,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 18:03:26,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:03:26,191 INFO L225 Difference]: With dead ends: 147 [2018-04-12 18:03:26,191 INFO L226 Difference]: Without dead ends: 147 [2018-04-12 18:03:26,192 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-12 18:03:26,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-12 18:03:26,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-04-12 18:03:26,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-04-12 18:03:26,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2018-04-12 18:03:26,200 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 8 [2018-04-12 18:03:26,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:03:26,200 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2018-04-12 18:03:26,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 18:03:26,200 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2018-04-12 18:03:26,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-12 18:03:26,201 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:03:26,201 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:03:26,201 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:03:26,201 INFO L82 PathProgramCache]: Analyzing trace with hash -224437887, now seen corresponding path program 1 times [2018-04-12 18:03:26,201 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:03:26,201 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:03:26,203 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:26,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:03:26,203 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:03:26,217 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:03:26,254 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-12 18:03:26,254 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:03:26,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 18:03:26,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 18:03:26,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 18:03:26,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 18:03:26,255 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand 4 states. [2018-04-12 18:03:26,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:03:26,393 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2018-04-12 18:03:26,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 18:03:26,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-12 18:03:26,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:03:26,394 INFO L225 Difference]: With dead ends: 140 [2018-04-12 18:03:26,394 INFO L226 Difference]: Without dead ends: 140 [2018-04-12 18:03:26,395 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 18:03:26,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-04-12 18:03:26,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2018-04-12 18:03:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-12 18:03:26,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2018-04-12 18:03:26,401 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 16 [2018-04-12 18:03:26,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:03:26,401 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2018-04-12 18:03:26,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 18:03:26,402 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2018-04-12 18:03:26,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-12 18:03:26,402 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:03:26,402 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:03:26,402 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:03:26,403 INFO L82 PathProgramCache]: Analyzing trace with hash -224437886, now seen corresponding path program 1 times [2018-04-12 18:03:26,403 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:03:26,403 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:03:26,404 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:26,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:03:26,405 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:03:26,417 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:03:26,454 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-12 18:03:26,455 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:03:26,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 18:03:26,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 18:03:26,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 18:03:26,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 18:03:26,456 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand 5 states. [2018-04-12 18:03:26,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:03:26,631 INFO L93 Difference]: Finished difference Result 183 states and 197 transitions. [2018-04-12 18:03:26,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 18:03:26,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-12 18:03:26,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:03:26,633 INFO L225 Difference]: With dead ends: 183 [2018-04-12 18:03:26,633 INFO L226 Difference]: Without dead ends: 183 [2018-04-12 18:03:26,633 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-12 18:03:26,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-12 18:03:26,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 168. [2018-04-12 18:03:26,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-12 18:03:26,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 186 transitions. [2018-04-12 18:03:26,641 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 186 transitions. Word has length 16 [2018-04-12 18:03:26,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:03:26,641 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 186 transitions. [2018-04-12 18:03:26,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 18:03:26,641 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 186 transitions. [2018-04-12 18:03:26,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-12 18:03:26,641 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:03:26,641 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:03:26,642 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:03:26,642 INFO L82 PathProgramCache]: Analyzing trace with hash -936444636, now seen corresponding path program 1 times [2018-04-12 18:03:26,642 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:03:26,642 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:03:26,643 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:26,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:03:26,643 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:03:26,653 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:03:26,690 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-12 18:03:26,690 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:03:26,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 18:03:26,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 18:03:26,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 18:03:26,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 18:03:26,691 INFO L87 Difference]: Start difference. First operand 168 states and 186 transitions. Second operand 5 states. [2018-04-12 18:03:26,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:03:26,870 INFO L93 Difference]: Finished difference Result 295 states and 326 transitions. [2018-04-12 18:03:26,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 18:03:26,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-12 18:03:26,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:03:26,872 INFO L225 Difference]: With dead ends: 295 [2018-04-12 18:03:26,872 INFO L226 Difference]: Without dead ends: 295 [2018-04-12 18:03:26,872 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-12 18:03:26,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-04-12 18:03:26,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 167. [2018-04-12 18:03:26,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-04-12 18:03:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 184 transitions. [2018-04-12 18:03:26,879 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 184 transitions. Word has length 18 [2018-04-12 18:03:26,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:03:26,879 INFO L459 AbstractCegarLoop]: Abstraction has 167 states and 184 transitions. [2018-04-12 18:03:26,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 18:03:26,879 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 184 transitions. [2018-04-12 18:03:26,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-12 18:03:26,880 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:03:26,880 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:03:26,880 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:03:26,880 INFO L82 PathProgramCache]: Analyzing trace with hash -936444635, now seen corresponding path program 1 times [2018-04-12 18:03:26,880 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:03:26,881 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:03:26,882 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:26,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:03:26,882 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:03:26,892 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:03:26,917 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-12 18:03:26,917 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:03:26,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 18:03:26,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 18:03:26,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 18:03:26,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 18:03:26,918 INFO L87 Difference]: Start difference. First operand 167 states and 184 transitions. Second operand 5 states. [2018-04-12 18:03:27,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:03:27,127 INFO L93 Difference]: Finished difference Result 294 states and 324 transitions. [2018-04-12 18:03:27,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 18:03:27,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-12 18:03:27,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:03:27,128 INFO L225 Difference]: With dead ends: 294 [2018-04-12 18:03:27,128 INFO L226 Difference]: Without dead ends: 294 [2018-04-12 18:03:27,128 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-12 18:03:27,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-04-12 18:03:27,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 166. [2018-04-12 18:03:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-12 18:03:27,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 182 transitions. [2018-04-12 18:03:27,134 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 182 transitions. Word has length 18 [2018-04-12 18:03:27,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:03:27,135 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 182 transitions. [2018-04-12 18:03:27,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 18:03:27,135 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 182 transitions. [2018-04-12 18:03:27,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-12 18:03:27,136 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:03:27,136 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] [2018-04-12 18:03:27,139 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:03:27,139 INFO L82 PathProgramCache]: Analyzing trace with hash -261740378, now seen corresponding path program 1 times [2018-04-12 18:03:27,139 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:03:27,139 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:03:27,140 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:27,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:03:27,140 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:03:27,152 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:03:27,210 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-12 18:03:27,210 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:03:27,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-12 18:03:27,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 18:03:27,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 18:03:27,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-12 18:03:27,211 INFO L87 Difference]: Start difference. First operand 166 states and 182 transitions. Second operand 9 states. [2018-04-12 18:03:27,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:03:27,491 INFO L93 Difference]: Finished difference Result 167 states and 182 transitions. [2018-04-12 18:03:27,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 18:03:27,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-04-12 18:03:27,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:03:27,492 INFO L225 Difference]: With dead ends: 167 [2018-04-12 18:03:27,492 INFO L226 Difference]: Without dead ends: 167 [2018-04-12 18:03:27,492 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-04-12 18:03:27,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-12 18:03:27,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-04-12 18:03:27,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-04-12 18:03:27,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 181 transitions. [2018-04-12 18:03:27,495 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 181 transitions. Word has length 22 [2018-04-12 18:03:27,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:03:27,495 INFO L459 AbstractCegarLoop]: Abstraction has 165 states and 181 transitions. [2018-04-12 18:03:27,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 18:03:27,495 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 181 transitions. [2018-04-12 18:03:27,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-12 18:03:27,496 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:03:27,496 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] [2018-04-12 18:03:27,496 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:03:27,496 INFO L82 PathProgramCache]: Analyzing trace with hash -261740377, now seen corresponding path program 1 times [2018-04-12 18:03:27,496 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:03:27,496 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:03:27,497 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:27,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:03:27,497 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:03:27,504 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:03:27,583 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-12 18:03:27,583 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:03:27,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-12 18:03:27,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 18:03:27,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 18:03:27,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-12 18:03:27,584 INFO L87 Difference]: Start difference. First operand 165 states and 181 transitions. Second operand 10 states. [2018-04-12 18:03:28,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:03:28,108 INFO L93 Difference]: Finished difference Result 164 states and 179 transitions. [2018-04-12 18:03:28,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 18:03:28,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-04-12 18:03:28,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:03:28,110 INFO L225 Difference]: With dead ends: 164 [2018-04-12 18:03:28,110 INFO L226 Difference]: Without dead ends: 164 [2018-04-12 18:03:28,111 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-04-12 18:03:28,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-12 18:03:28,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2018-04-12 18:03:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-04-12 18:03:28,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 166 transitions. [2018-04-12 18:03:28,114 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 166 transitions. Word has length 22 [2018-04-12 18:03:28,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:03:28,114 INFO L459 AbstractCegarLoop]: Abstraction has 151 states and 166 transitions. [2018-04-12 18:03:28,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 18:03:28,114 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 166 transitions. [2018-04-12 18:03:28,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-12 18:03:28,115 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:03:28,115 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:03:28,115 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:03:28,115 INFO L82 PathProgramCache]: Analyzing trace with hash -791769497, now seen corresponding path program 1 times [2018-04-12 18:03:28,115 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:03:28,115 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:03:28,116 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:28,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:03:28,117 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:03:28,126 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:03:28,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:03:28,175 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:03:28,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 18:03:28,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 18:03:28,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 18:03:28,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 18:03:28,176 INFO L87 Difference]: Start difference. First operand 151 states and 166 transitions. Second operand 6 states. [2018-04-12 18:03:28,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:03:28,328 INFO L93 Difference]: Finished difference Result 185 states and 203 transitions. [2018-04-12 18:03:28,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 18:03:28,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-04-12 18:03:28,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:03:28,329 INFO L225 Difference]: With dead ends: 185 [2018-04-12 18:03:28,329 INFO L226 Difference]: Without dead ends: 185 [2018-04-12 18:03:28,330 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-12 18:03:28,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-04-12 18:03:28,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 161. [2018-04-12 18:03:28,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-12 18:03:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 177 transitions. [2018-04-12 18:03:28,332 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 177 transitions. Word has length 27 [2018-04-12 18:03:28,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:03:28,332 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 177 transitions. [2018-04-12 18:03:28,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 18:03:28,332 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 177 transitions. [2018-04-12 18:03:28,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 18:03:28,332 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:03:28,332 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-12 18:03:28,332 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:03:28,333 INFO L82 PathProgramCache]: Analyzing trace with hash -435040589, now seen corresponding path program 1 times [2018-04-12 18:03:28,333 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:03:28,333 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:03:28,334 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:28,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:03:28,334 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:03:28,338 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:03:28,400 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-12 18:03:28,400 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:03:28,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 18:03:28,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 18:03:28,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 18:03:28,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-12 18:03:28,401 INFO L87 Difference]: Start difference. First operand 161 states and 177 transitions. Second operand 6 states. [2018-04-12 18:03:28,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:03:28,533 INFO L93 Difference]: Finished difference Result 183 states and 199 transitions. [2018-04-12 18:03:28,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 18:03:28,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-04-12 18:03:28,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:03:28,534 INFO L225 Difference]: With dead ends: 183 [2018-04-12 18:03:28,534 INFO L226 Difference]: Without dead ends: 183 [2018-04-12 18:03:28,534 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-12 18:03:28,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-12 18:03:28,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 173. [2018-04-12 18:03:28,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-04-12 18:03:28,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 191 transitions. [2018-04-12 18:03:28,537 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 191 transitions. Word has length 28 [2018-04-12 18:03:28,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:03:28,537 INFO L459 AbstractCegarLoop]: Abstraction has 173 states and 191 transitions. [2018-04-12 18:03:28,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 18:03:28,537 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 191 transitions. [2018-04-12 18:03:28,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-12 18:03:28,537 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:03:28,537 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] [2018-04-12 18:03:28,537 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:03:28,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1484125475, now seen corresponding path program 1 times [2018-04-12 18:03:28,538 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:03:28,538 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:03:28,538 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:28,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:03:28,539 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:03:28,545 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:03:28,568 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-12 18:03:28,568 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:03:28,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 18:03:28,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 18:03:28,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 18:03:28,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 18:03:28,570 INFO L87 Difference]: Start difference. First operand 173 states and 191 transitions. Second operand 5 states. [2018-04-12 18:03:28,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:03:28,714 INFO L93 Difference]: Finished difference Result 233 states and 256 transitions. [2018-04-12 18:03:28,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 18:03:28,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-04-12 18:03:28,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:03:28,716 INFO L225 Difference]: With dead ends: 233 [2018-04-12 18:03:28,716 INFO L226 Difference]: Without dead ends: 233 [2018-04-12 18:03:28,716 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-12 18:03:28,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-12 18:03:28,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 172. [2018-04-12 18:03:28,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-04-12 18:03:28,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 189 transitions. [2018-04-12 18:03:28,720 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 189 transitions. Word has length 30 [2018-04-12 18:03:28,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:03:28,720 INFO L459 AbstractCegarLoop]: Abstraction has 172 states and 189 transitions. [2018-04-12 18:03:28,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 18:03:28,721 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 189 transitions. [2018-04-12 18:03:28,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-12 18:03:28,721 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:03:28,721 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:03:28,721 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:03:28,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1484125474, now seen corresponding path program 1 times [2018-04-12 18:03:28,722 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:03:28,722 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:03:28,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:28,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:03:28,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:03:28,731 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:03:28,763 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-12 18:03:28,763 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:03:28,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 18:03:28,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 18:03:28,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 18:03:28,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 18:03:28,764 INFO L87 Difference]: Start difference. First operand 172 states and 189 transitions. Second operand 5 states. [2018-04-12 18:03:28,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:03:28,904 INFO L93 Difference]: Finished difference Result 232 states and 254 transitions. [2018-04-12 18:03:28,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 18:03:28,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-04-12 18:03:28,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:03:28,905 INFO L225 Difference]: With dead ends: 232 [2018-04-12 18:03:28,905 INFO L226 Difference]: Without dead ends: 232 [2018-04-12 18:03:28,905 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-12 18:03:28,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-12 18:03:28,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 171. [2018-04-12 18:03:28,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-04-12 18:03:28,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2018-04-12 18:03:28,908 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 30 [2018-04-12 18:03:28,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:03:28,908 INFO L459 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2018-04-12 18:03:28,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 18:03:28,908 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2018-04-12 18:03:28,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-12 18:03:28,908 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:03:28,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, 1, 1, 1] [2018-04-12 18:03:28,908 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:03:28,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1808714207, now seen corresponding path program 1 times [2018-04-12 18:03:28,909 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:03:28,909 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:03:28,909 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:28,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:03:28,910 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:03:28,919 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:03:28,973 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-12 18:03:28,973 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:03:28,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-12 18:03:28,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 18:03:28,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 18:03:28,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-12 18:03:28,974 INFO L87 Difference]: Start difference. First operand 171 states and 187 transitions. Second operand 9 states. [2018-04-12 18:03:29,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:03:29,215 INFO L93 Difference]: Finished difference Result 172 states and 187 transitions. [2018-04-12 18:03:29,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 18:03:29,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-04-12 18:03:29,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:03:29,216 INFO L225 Difference]: With dead ends: 172 [2018-04-12 18:03:29,216 INFO L226 Difference]: Without dead ends: 172 [2018-04-12 18:03:29,216 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-04-12 18:03:29,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-12 18:03:29,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-04-12 18:03:29,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-04-12 18:03:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 186 transitions. [2018-04-12 18:03:29,218 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 186 transitions. Word has length 34 [2018-04-12 18:03:29,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:03:29,218 INFO L459 AbstractCegarLoop]: Abstraction has 170 states and 186 transitions. [2018-04-12 18:03:29,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 18:03:29,219 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 186 transitions. [2018-04-12 18:03:29,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-12 18:03:29,219 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:03:29,219 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] [2018-04-12 18:03:29,219 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:03:29,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1808714208, now seen corresponding path program 1 times [2018-04-12 18:03:29,219 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:03:29,219 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:03:29,220 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:29,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:03:29,220 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:03:29,226 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:03:29,324 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-12 18:03:29,324 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:03:29,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-12 18:03:29,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 18:03:29,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 18:03:29,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-12 18:03:29,325 INFO L87 Difference]: Start difference. First operand 170 states and 186 transitions. Second operand 10 states. [2018-04-12 18:03:29,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:03:29,590 INFO L93 Difference]: Finished difference Result 171 states and 186 transitions. [2018-04-12 18:03:29,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-12 18:03:29,591 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-04-12 18:03:29,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:03:29,591 INFO L225 Difference]: With dead ends: 171 [2018-04-12 18:03:29,591 INFO L226 Difference]: Without dead ends: 171 [2018-04-12 18:03:29,592 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-04-12 18:03:29,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-04-12 18:03:29,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2018-04-12 18:03:29,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-12 18:03:29,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 184 transitions. [2018-04-12 18:03:29,595 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 184 transitions. Word has length 34 [2018-04-12 18:03:29,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:03:29,595 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 184 transitions. [2018-04-12 18:03:29,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 18:03:29,596 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 184 transitions. [2018-04-12 18:03:29,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-12 18:03:29,596 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:03:29,597 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] [2018-04-12 18:03:29,597 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:03:29,597 INFO L82 PathProgramCache]: Analyzing trace with hash -917197866, now seen corresponding path program 1 times [2018-04-12 18:03:29,597 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:03:29,597 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:03:29,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:29,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:03:29,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:03:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:03:29,609 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:03:29,791 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:03:29,791 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:03:29,791 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-12 18:03:29,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:03:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:03:29,827 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:03:29,909 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:03:29,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:03:29,914 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-12 18:03:29,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:03:29,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:03:29,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-12 18:03:29,940 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-12 18:03:29,944 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-12 18:03:29,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:03:29,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:03:29,955 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-12 18:03:29,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-12 18:03:30,004 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 39 treesize of output 43 [2018-04-12 18:03:30,006 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-12 18:03:30,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:03:30,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:03:30,018 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-12 18:03:30,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-04-12 18:03:30,124 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-12 18:03:30,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:03:30,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 18:03:30,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:03:30,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-12 18:03:30,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:84 [2018-04-12 18:03:44,229 WARN L148 SmtUtils]: Spent 14035ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-12 18:03:58,281 WARN L148 SmtUtils]: Spent 14017ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-12 18:03:58,325 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 54 treesize of output 36 [2018-04-12 18:03:58,328 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-12 18:03:58,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:03:58,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:03:58,340 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 18:03:58,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:03:58,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2018-04-12 18:03:58,366 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-12 18:03:58,367 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:03:58,372 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-12 18:03:58,372 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:03:58,375 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:03:58,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-12 18:03:58,389 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:98, output treesize:46 [2018-04-12 18:03:58,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:03:58,526 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:03:58,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 31 [2018-04-12 18:03:58,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-12 18:03:58,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-12 18:03:58,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=855, Unknown=0, NotChecked=0, Total=992 [2018-04-12 18:03:58,528 INFO L87 Difference]: Start difference. First operand 168 states and 184 transitions. Second operand 32 states. [2018-04-12 18:04:23,289 WARN L151 SmtUtils]: Spent 24181ms on a formula simplification. DAG size of input: 73 DAG size of output 60 [2018-04-12 18:04:41,436 WARN L151 SmtUtils]: Spent 18044ms on a formula simplification. DAG size of input: 66 DAG size of output 40 [2018-04-12 18:04:59,822 WARN L151 SmtUtils]: Spent 18050ms on a formula simplification. DAG size of input: 73 DAG size of output 43 [2018-04-12 18:05:23,887 WARN L151 SmtUtils]: Spent 24039ms on a formula simplification. DAG size of input: 48 DAG size of output 40 [2018-04-12 18:05:48,127 WARN L151 SmtUtils]: Spent 24046ms on a formula simplification. DAG size of input: 55 DAG size of output 47 [2018-04-12 18:06:12,569 WARN L151 SmtUtils]: Spent 24040ms on a formula simplification. DAG size of input: 38 DAG size of output 37 [2018-04-12 18:06:12,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:06:12,923 INFO L93 Difference]: Finished difference Result 319 states and 347 transitions. [2018-04-12 18:06:12,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-12 18:06:12,923 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 39 [2018-04-12 18:06:12,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:06:12,924 INFO L225 Difference]: With dead ends: 319 [2018-04-12 18:06:12,924 INFO L226 Difference]: Without dead ends: 319 [2018-04-12 18:06:12,926 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 161.8s TimeCoverageRelationStatistics Valid=861, Invalid=3299, Unknown=0, NotChecked=0, Total=4160 [2018-04-12 18:06:12,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-04-12 18:06:12,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 193. [2018-04-12 18:06:12,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-12 18:06:12,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 213 transitions. [2018-04-12 18:06:12,929 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 213 transitions. Word has length 39 [2018-04-12 18:06:12,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:06:12,930 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 213 transitions. [2018-04-12 18:06:12,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-12 18:06:12,930 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 213 transitions. [2018-04-12 18:06:12,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-12 18:06:12,930 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:06:12,930 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:06:12,931 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:06:12,931 INFO L82 PathProgramCache]: Analyzing trace with hash -917197865, now seen corresponding path program 1 times [2018-04-12 18:06:12,931 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:06:12,931 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:06:12,932 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:06:12,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:06:12,933 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:06:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:06:12,947 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:06:13,209 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:06:13,209 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:06:13,209 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-12 18:06:13,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:06:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:06:13,242 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:06:13,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:06:13,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:06:13,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 18:06:13,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:06:13,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 18:06:13,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:06:13,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:06:13,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-12 18:06:13,317 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-12 18:06:13,319 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-12 18:06:13,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:06:13,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:06:13,339 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-12 18:06:13,341 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-12 18:06:13,341 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:06:13,343 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:06:13,350 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-12 18:06:13,350 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-12 18:06:13,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2018-04-12 18:06:13,398 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-12 18:06:13,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:06:13,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:06:13,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 29 treesize of output 30 [2018-04-12 18:06:13,416 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-12 18:06:13,417 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:06:13,420 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:06:13,427 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-12 18:06:13,427 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-04-12 18:06:13,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-04-12 18:06:13,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:06:13,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 18:06:13,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:06:13,619 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 73 treesize of output 60 [2018-04-12 18:06:13,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-04-12 18:06:13,625 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:06:13,646 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:06:13,653 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 81 treesize of output 68 [2018-04-12 18:06:13,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:06:13,663 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-12 18:06:13,688 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:06:13,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-12 18:06:13,710 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:89, output treesize:125 [2018-04-12 18:06:27,761 WARN L148 SmtUtils]: Spent 14022ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-12 18:06:41,854 WARN L148 SmtUtils]: Spent 14021ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-12 18:06:41,872 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 87 treesize of output 71 [2018-04-12 18:06:41,874 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-12 18:06:41,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:06:41,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:06:41,887 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 18:06:41,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:06:41,928 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 65 treesize of output 51 [2018-04-12 18:06:41,930 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 30 treesize of output 19 [2018-04-12 18:06:41,930 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:06:41,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:06:41,936 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:06:41,940 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:06:41,972 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 33 treesize of output 27 [2018-04-12 18:06:41,974 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-12 18:06:41,974 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:06:41,979 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-12 18:06:41,979 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 18:06:41,982 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:06:42,005 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 58 treesize of output 40 [2018-04-12 18:06:42,096 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-12 18:06:42,096 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-12 18:06:42,101 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-12 18:06:42,101 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-12 18:06:42,104 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:06:42,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 37 [2018-04-12 18:06:42,107 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-12 18:06:42,108 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-12 18:06:42,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:06:42,116 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-04-12 18:06:42,121 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:06:42,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:06:42,135 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 11 variables, input treesize:153, output treesize:23 [2018-04-12 18:06:42,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:06:42,190 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:06:42,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 31 [2018-04-12 18:06:42,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-12 18:06:42,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-12 18:06:42,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2018-04-12 18:06:42,191 INFO L87 Difference]: Start difference. First operand 193 states and 213 transitions. Second operand 32 states. [2018-04-12 18:07:06,936 WARN L151 SmtUtils]: Spent 24090ms on a formula simplification. DAG size of input: 80 DAG size of output 75 [2018-04-12 18:07:33,125 WARN L151 SmtUtils]: Spent 26064ms on a formula simplification. DAG size of input: 97 DAG size of output 57 [2018-04-12 18:07:59,406 WARN L151 SmtUtils]: Spent 26063ms on a formula simplification. DAG size of input: 100 DAG size of output 59 [2018-04-12 18:08:25,506 WARN L151 SmtUtils]: Spent 26072ms on a formula simplification. DAG size of input: 102 DAG size of output 62 [2018-04-12 18:08:39,587 WARN L148 SmtUtils]: Spent 14033ms on a formula simplification that was a NOOP. DAG size: 57 [2018-04-12 18:08:53,749 WARN L148 SmtUtils]: Spent 14032ms on a formula simplification that was a NOOP. DAG size: 68 [2018-04-12 18:09:08,094 WARN L148 SmtUtils]: Spent 14028ms on a formula simplification that was a NOOP. DAG size: 53 [2018-04-12 18:09:22,318 WARN L148 SmtUtils]: Spent 14031ms on a formula simplification that was a NOOP. DAG size: 65 [2018-04-12 18:09:22,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:09:22,522 INFO L93 Difference]: Finished difference Result 363 states and 397 transitions. [2018-04-12 18:09:22,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-12 18:09:22,522 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 39 [2018-04-12 18:09:22,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:09:22,524 INFO L225 Difference]: With dead ends: 363 [2018-04-12 18:09:22,524 INFO L226 Difference]: Without dead ends: 363 [2018-04-12 18:09:22,525 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 187.9s TimeCoverageRelationStatistics Valid=752, Invalid=3280, Unknown=0, NotChecked=0, Total=4032 [2018-04-12 18:09:22,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-04-12 18:09:22,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 191. [2018-04-12 18:09:22,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-12 18:09:22,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 210 transitions. [2018-04-12 18:09:22,530 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 210 transitions. Word has length 39 [2018-04-12 18:09:22,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:09:22,531 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 210 transitions. [2018-04-12 18:09:22,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-12 18:09:22,531 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 210 transitions. [2018-04-12 18:09:22,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-12 18:09:22,531 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:09:22,531 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] [2018-04-12 18:09:22,532 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:09:22,532 INFO L82 PathProgramCache]: Analyzing trace with hash 364674278, now seen corresponding path program 1 times [2018-04-12 18:09:22,532 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:09:22,532 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:09:22,533 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:09:22,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:09:22,533 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:09:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:09:22,543 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:09:22,776 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-12 18:09:22,776 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:09:22,776 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-12 18:09:22,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:09:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:09:22,796 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:09:22,820 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:09:22,820 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:09:22,821 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-12 18:09:22,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:09:22,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:09:22,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-12 18:09:22,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 18:09:22,845 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-12 18:09:22,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:09:22,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:09:22,852 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-12 18:09:22,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-12 18:09:22,892 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 39 treesize of output 43 [2018-04-12 18:09:22,894 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-12 18:09:22,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:09:22,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:09:22,902 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-12 18:09:22,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-04-12 18:09:22,973 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-12 18:09:22,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:09:22,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 18:09:22,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:09:23,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-12 18:09:23,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:84 [2018-04-12 18:09:37,040 WARN L148 SmtUtils]: Spent 14018ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-12 18:09:51,084 WARN L148 SmtUtils]: Spent 14017ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-12 18:09:51,098 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 54 treesize of output 36 [2018-04-12 18:09:51,099 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-12 18:09:51,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:09:51,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:09:51,106 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 18:09:51,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:09:51,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2018-04-12 18:09:51,126 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-12 18:09:51,127 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:09:51,130 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-12 18:09:51,131 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:09:51,133 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:09:51,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-12 18:09:51,144 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:98, output treesize:46 [2018-04-12 18:09:51,190 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-12 18:09:51,208 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:09:51,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 29 [2018-04-12 18:09:51,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-12 18:09:51,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-12 18:09:51,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2018-04-12 18:09:51,209 INFO L87 Difference]: Start difference. First operand 191 states and 210 transitions. Second operand 30 states. [2018-04-12 18:10:19,767 WARN L151 SmtUtils]: Spent 28075ms on a formula simplification. DAG size of input: 66 DAG size of output 60 [2018-04-12 18:10:47,941 WARN L151 SmtUtils]: Spent 28052ms on a formula simplification. DAG size of input: 66 DAG size of output 40 [2018-04-12 18:11:16,177 WARN L151 SmtUtils]: Spent 28041ms on a formula simplification. DAG size of input: 38 DAG size of output 37 [2018-04-12 18:11:34,296 WARN L151 SmtUtils]: Spent 18044ms on a formula simplification. DAG size of input: 76 DAG size of output 44 [2018-04-12 18:12:02,406 WARN L151 SmtUtils]: Spent 28054ms on a formula simplification. DAG size of input: 46 DAG size of output 45 [2018-04-12 18:12:12,602 WARN L151 SmtUtils]: Spent 10045ms on a formula simplification. DAG size of input: 64 DAG size of output 36 [2018-04-12 18:12:40,850 WARN L151 SmtUtils]: Spent 28043ms on a formula simplification. DAG size of input: 48 DAG size of output 40 [2018-04-12 18:12:40,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:12:40,995 INFO L93 Difference]: Finished difference Result 341 states and 373 transitions. [2018-04-12 18:12:40,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-12 18:12:40,995 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 40 [2018-04-12 18:12:40,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:12:40,996 INFO L225 Difference]: With dead ends: 341 [2018-04-12 18:12:40,996 INFO L226 Difference]: Without dead ends: 341 [2018-04-12 18:12:40,997 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 197.4s TimeCoverageRelationStatistics Valid=643, Invalid=2663, Unknown=0, NotChecked=0, Total=3306 [2018-04-12 18:12:40,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-04-12 18:12:40,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 199. [2018-04-12 18:12:40,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-12 18:12:40,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 220 transitions. [2018-04-12 18:12:40,999 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 220 transitions. Word has length 40 [2018-04-12 18:12:40,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:12:40,999 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 220 transitions. [2018-04-12 18:12:40,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-12 18:12:40,999 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 220 transitions. [2018-04-12 18:12:40,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-12 18:12:41,000 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:12:41,000 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] [2018-04-12 18:12:41,000 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:12:41,000 INFO L82 PathProgramCache]: Analyzing trace with hash 364674279, now seen corresponding path program 1 times [2018-04-12 18:12:41,000 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:12:41,000 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:12:41,001 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:12:41,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:12:41,001 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:12:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:12:41,010 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:12:41,101 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-12 18:12:41,101 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:12:41,102 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-12 18:12:41,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:12:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:12:41,121 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:12:41,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 18:12:41,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:12:41,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:12:41,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:12:41,136 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-12 18:12:41,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:12:41,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:12:41,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-12 18:12:41,149 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-12 18:12:41,151 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-12 18:12:41,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:12:41,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:12:41,168 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-12 18:12:41,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 18:12:41,170 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:12:41,172 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:12:41,180 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-12 18:12:41,181 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-12 18:12:41,218 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 56 [2018-04-12 18:12:41,230 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-12 18:12:41,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:12:41,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:12:41,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-12 18:12:41,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-12 18:12:41,245 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:12:41,248 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:12:41,254 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-12 18:12:41,254 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-04-12 18:12:41,316 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-12 18:12:41,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:12:41,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 18:12:41,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:12:41,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 71 [2018-04-12 18:12:41,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:12:41,355 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-12 18:12:41,365 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:12:41,368 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 73 treesize of output 63 [2018-04-12 18:12:41,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-04-12 18:12:41,371 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:12:41,377 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:12:41,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-12 18:12:41,396 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:89, output treesize:125 [2018-04-12 18:12:55,438 WARN L148 SmtUtils]: Spent 14024ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-12 18:13:09,483 WARN L148 SmtUtils]: Spent 14020ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-12 18:13:09,501 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 87 treesize of output 65 [2018-04-12 18:13:09,503 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-12 18:13:09,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:13:09,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:13:09,521 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 18:13:09,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:13:09,575 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 46 treesize of output 38 [2018-04-12 18:13:09,578 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-12 18:13:09,578 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:13:09,585 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-12 18:13:09,585 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:13:09,589 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:13:09,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-04-12 18:13:09,592 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-12 18:13:09,593 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:13:09,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:13:09,602 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-12 18:13:09,608 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:13:09,633 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 65 treesize of output 63 [2018-04-12 18:13:09,634 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-12 18:13:09,635 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-12 18:13:09,643 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-12 18:13:09,643 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-12 18:13:09,648 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:13:09,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2018-04-12 18:13:09,668 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-12 18:13:09,668 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-12 18:13:09,673 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-12 18:13:09,674 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-12 18:13:09,685 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:13:09,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:13:09,699 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 11 variables, input treesize:153, output treesize:23 [2018-04-12 18:13:09,719 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-12 18:13:09,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:13:09,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2018-04-12 18:13:09,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-12 18:13:09,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-12 18:13:09,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-04-12 18:13:09,745 INFO L87 Difference]: Start difference. First operand 199 states and 220 transitions. Second operand 19 states. [2018-04-12 18:13:34,034 WARN L151 SmtUtils]: Spent 24046ms on a formula simplification. DAG size of input: 54 DAG size of output 53 [2018-04-12 18:14:02,128 WARN L151 SmtUtils]: Spent 28065ms on a formula simplification. DAG size of input: 86 DAG size of output 54 [2018-04-12 18:14:16,308 WARN L148 SmtUtils]: Spent 14026ms on a formula simplification that was a NOOP. DAG size: 50 [2018-04-12 18:14:44,401 WARN L151 SmtUtils]: Spent 28062ms on a formula simplification. DAG size of input: 91 DAG size of output 59 [2018-04-12 18:14:54,562 WARN L151 SmtUtils]: Spent 10042ms on a formula simplification. DAG size of input: 90 DAG size of output 44 [2018-04-12 18:14:54,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:14:54,701 INFO L93 Difference]: Finished difference Result 296 states and 325 transitions. [2018-04-12 18:14:54,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-12 18:14:54,701 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2018-04-12 18:14:54,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:14:54,702 INFO L225 Difference]: With dead ends: 296 [2018-04-12 18:14:54,702 INFO L226 Difference]: Without dead ends: 296 [2018-04-12 18:14:54,702 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 132.7s TimeCoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2018-04-12 18:14:54,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-04-12 18:14:54,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 199. [2018-04-12 18:14:54,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-12 18:14:54,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 219 transitions. [2018-04-12 18:14:54,705 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 219 transitions. Word has length 40 [2018-04-12 18:14:54,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:14:54,705 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 219 transitions. [2018-04-12 18:14:54,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-12 18:14:54,705 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 219 transitions. [2018-04-12 18:14:54,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-12 18:14:54,705 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:14:54,705 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:14:54,705 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:14:54,706 INFO L82 PathProgramCache]: Analyzing trace with hash -275087979, now seen corresponding path program 1 times [2018-04-12 18:14:54,706 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:14:54,706 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:14:54,706 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:14:54,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:14:54,706 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:14:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:14:54,711 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:14:54,725 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-12 18:14:54,725 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:14:54,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 18:14:54,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 18:14:54,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 18:14:54,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 18:14:54,726 INFO L87 Difference]: Start difference. First operand 199 states and 219 transitions. Second operand 5 states. [2018-04-12 18:14:54,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:14:54,838 INFO L93 Difference]: Finished difference Result 236 states and 258 transitions. [2018-04-12 18:14:54,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 18:14:54,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-04-12 18:14:54,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:14:54,839 INFO L225 Difference]: With dead ends: 236 [2018-04-12 18:14:54,840 INFO L226 Difference]: Without dead ends: 236 [2018-04-12 18:14:54,840 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-12 18:14:54,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-04-12 18:14:54,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 199. [2018-04-12 18:14:54,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-12 18:14:54,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 218 transitions. [2018-04-12 18:14:54,843 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 218 transitions. Word has length 42 [2018-04-12 18:14:54,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:14:54,843 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 218 transitions. [2018-04-12 18:14:54,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 18:14:54,844 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 218 transitions. [2018-04-12 18:14:54,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-12 18:14:54,844 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:14:54,844 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] [2018-04-12 18:14:54,844 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:14:54,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1171852504, now seen corresponding path program 1 times [2018-04-12 18:14:54,845 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:14:54,845 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:14:54,846 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:14:54,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:14:54,846 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:14:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:14:54,857 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:14:55,105 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-12 18:14:55,105 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:14:55,105 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-12 18:14:55,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:14:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:14:55,127 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:14:55,159 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:14:55,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:14:55,160 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-12 18:14:55,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:14:55,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:14:55,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-12 18:14:55,180 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-12 18:14:55,182 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-12 18:14:55,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:14:55,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:14:55,189 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-12 18:14:55,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-12 18:14:55,232 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 39 treesize of output 35 [2018-04-12 18:14:55,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 18:14:55,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:14:55,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:14:55,241 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-12 18:14:55,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-04-12 18:14:55,315 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-12 18:14:55,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:14:55,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 18:14:55,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:14:55,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-12 18:14:55,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:84 [2018-04-12 18:15:09,385 WARN L148 SmtUtils]: Spent 14017ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-12 18:15:23,433 WARN L148 SmtUtils]: Spent 14019ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-12 18:15:23,440 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 54 treesize of output 36 [2018-04-12 18:15:23,442 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-12 18:15:23,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:15:23,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:15:23,475 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 18:15:23,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:15:23,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2018-04-12 18:15:23,503 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-12 18:15:23,503 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:15:23,508 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-12 18:15:23,508 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:15:23,512 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:15:23,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-12 18:15:23,524 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:98, output treesize:46 [2018-04-12 18:15:23,651 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-12 18:15:23,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:15:23,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 31 [2018-04-12 18:15:23,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-12 18:15:23,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-12 18:15:23,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2018-04-12 18:15:23,670 INFO L87 Difference]: Start difference. First operand 199 states and 218 transitions. Second operand 32 states. [2018-04-12 18:15:48,487 WARN L151 SmtUtils]: Spent 24067ms on a formula simplification. DAG size of input: 65 DAG size of output 55 [2018-04-12 18:16:06,694 WARN L151 SmtUtils]: Spent 18076ms on a formula simplification. DAG size of input: 64 DAG size of output 40 [2018-04-12 18:16:24,859 WARN L151 SmtUtils]: Spent 18046ms on a formula simplification. DAG size of input: 74 DAG size of output 43 [2018-04-12 18:16:43,015 WARN L151 SmtUtils]: Spent 18042ms on a formula simplification. DAG size of input: 74 DAG size of output 43 [2018-04-12 18:16:43,159 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 30 DAG size of output 25 [2018-04-12 18:16:44,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:16:44,212 INFO L93 Difference]: Finished difference Result 384 states and 417 transitions. [2018-04-12 18:16:44,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-12 18:16:44,212 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 46 [2018-04-12 18:16:44,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:16:44,214 INFO L225 Difference]: With dead ends: 384 [2018-04-12 18:16:44,214 INFO L226 Difference]: Without dead ends: 384 [2018-04-12 18:16:44,215 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1423 ImplicationChecksByTransitivity, 107.9s TimeCoverageRelationStatistics Valid=967, Invalid=4145, Unknown=0, NotChecked=0, Total=5112 [2018-04-12 18:16:44,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-04-12 18:16:44,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 246. [2018-04-12 18:16:44,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-04-12 18:16:44,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 273 transitions. [2018-04-12 18:16:44,219 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 273 transitions. Word has length 46 [2018-04-12 18:16:44,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:16:44,220 INFO L459 AbstractCegarLoop]: Abstraction has 246 states and 273 transitions. [2018-04-12 18:16:44,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-12 18:16:44,220 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 273 transitions. [2018-04-12 18:16:44,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-12 18:16:44,220 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:16:44,220 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] [2018-04-12 18:16:44,220 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:16:44,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1171852503, now seen corresponding path program 1 times [2018-04-12 18:16:44,221 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:16:44,221 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:16:44,222 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:16:44,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:16:44,222 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:16:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:16:44,233 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:16:44,610 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-12 18:16:44,610 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:16:44,610 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-12 18:16:44,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:16:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:16:44,639 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:16:44,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 18:16:44,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:16:44,683 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:16:44,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:16:44,684 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-12 18:16:44,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:16:44,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:16:44,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-12 18:16:44,716 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-12 18:16:44,728 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-12 18:16:44,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:16:44,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:16:44,741 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-12 18:16:44,742 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-12 18:16:44,742 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:16:44,744 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:16:44,749 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-12 18:16:44,750 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-12 18:16:44,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 56 [2018-04-12 18:16:44,795 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-12 18:16:44,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:16:44,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:16:44,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-12 18:16:44,814 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-12 18:16:44,814 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:16:44,818 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:16:44,825 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-12 18:16:44,825 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-04-12 18:16:44,902 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-12 18:16:44,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:16:44,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 18:16:44,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:16:44,945 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 73 treesize of output 60 [2018-04-12 18:16:44,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-12 18:16:44,949 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:16:44,955 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:16:44,958 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 81 treesize of output 68 [2018-04-12 18:16:44,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:16:44,965 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-12 18:16:44,981 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:16:45,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-12 18:16:45,001 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:89, output treesize:125 [2018-04-12 18:16:59,048 WARN L148 SmtUtils]: Spent 14020ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-12 18:17:13,105 WARN L148 SmtUtils]: Spent 14022ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-12 18:17:13,132 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 65 treesize of output 51 [2018-04-12 18:17:13,133 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 30 treesize of output 19 [2018-04-12 18:17:13,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:13,149 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-12 18:17:13,149 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:13,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:13,169 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 33 treesize of output 27 [2018-04-12 18:17:13,170 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-12 18:17:13,170 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:13,176 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-12 18:17:13,176 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:13,180 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:13,197 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 87 treesize of output 65 [2018-04-12 18:17:13,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:17:13,201 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-12 18:17:13,210 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-12 18:17:13,210 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:13,217 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:17:13,237 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 46 treesize of output 38 [2018-04-12 18:17:13,238 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-12 18:17:13,239 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:13,245 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-12 18:17:13,245 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:13,248 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:13,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-04-12 18:17:13,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:17:13,254 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-04-12 18:17:13,260 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-12 18:17:13,261 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:13,265 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:17:13,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:17:13,279 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 11 variables, input treesize:153, output treesize:23 [2018-04-12 18:17:13,332 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-12 18:17:13,349 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:17:13,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 31 [2018-04-12 18:17:13,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-12 18:17:13,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-12 18:17:13,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=885, Unknown=0, NotChecked=0, Total=992 [2018-04-12 18:17:13,350 INFO L87 Difference]: Start difference. First operand 246 states and 273 transitions. Second operand 32 states. [2018-04-12 18:17:38,355 WARN L151 SmtUtils]: Spent 24165ms on a formula simplification. DAG size of input: 93 DAG size of output 72 Received shutdown request... [2018-04-12 18:18:02,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-12 18:18:02,456 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-12 18:18:02,459 WARN L197 ceAbstractionStarter]: Timeout [2018-04-12 18:18:02,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.04 06:18:02 BoogieIcfgContainer [2018-04-12 18:18:02,459 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-12 18:18:02,460 INFO L168 Benchmark]: Toolchain (without parser) took 877758.43 ms. Allocated memory was 402.7 MB in the beginning and 642.8 MB in the end (delta: 240.1 MB). Free memory was 339.1 MB in the beginning and 434.5 MB in the end (delta: -95.3 MB). Peak memory consumption was 144.8 MB. Max. memory is 5.3 GB. [2018-04-12 18:18:02,460 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 402.7 MB. Free memory is still 365.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 18:18:02,460 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.87 ms. Allocated memory is still 402.7 MB. Free memory was 337.8 MB in the beginning and 310.0 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. [2018-04-12 18:18:02,461 INFO L168 Benchmark]: Boogie Preprocessor took 43.91 ms. Allocated memory is still 402.7 MB. Free memory was 310.0 MB in the beginning and 307.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-12 18:18:02,461 INFO L168 Benchmark]: RCFGBuilder took 526.19 ms. Allocated memory was 402.7 MB in the beginning and 612.9 MB in the end (delta: 210.2 MB). Free memory was 307.4 MB in the beginning and 528.0 MB in the end (delta: -220.6 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-04-12 18:18:02,461 INFO L168 Benchmark]: TraceAbstraction took 876887.26 ms. Allocated memory was 612.9 MB in the beginning and 642.8 MB in the end (delta: 29.9 MB). Free memory was 528.0 MB in the beginning and 434.5 MB in the end (delta: 93.5 MB). Peak memory consumption was 123.4 MB. Max. memory is 5.3 GB. [2018-04-12 18:18:02,462 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 402.7 MB. Free memory is still 365.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 297.87 ms. Allocated memory is still 402.7 MB. Free memory was 337.8 MB in the beginning and 310.0 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.91 ms. Allocated memory is still 402.7 MB. Free memory was 310.0 MB in the beginning and 307.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 526.19 ms. Allocated memory was 402.7 MB in the beginning and 612.9 MB in the end (delta: 210.2 MB). Free memory was 307.4 MB in the beginning and 528.0 MB in the end (delta: -220.6 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 876887.26 ms. Allocated memory was 612.9 MB in the beginning and 642.8 MB in the end (delta: 29.9 MB). Free memory was 528.0 MB in the beginning and 434.5 MB in the end (delta: 93.5 MB). Peak memory consumption was 123.4 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 (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 997]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1004]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 986]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1044]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1018]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1020]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1020). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1018]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1052). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1044]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1000]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 982]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 982). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1020]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1020). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 997]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1004]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 986]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1052). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1000]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (246states) and interpolant automaton (currently 19 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 156 locations, 65 error locations. TIMEOUT Result, 876.8s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 702.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1943 SDtfs, 8305 SDslu, 7764 SDs, 0 SdLazy, 12728 SolverSat, 1277 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 665 GetRequests, 215 SyntacticMatches, 9 SemanticMatches, 440 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4869 ImplicationChecksByTransitivity, 842.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=246occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 1177 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 173.8s InterpolantComputationTime, 853 NumberOfCodeBlocks, 853 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 826 ConstructedInterpolants, 107 QuantifiedInterpolants, 602215 SizeOfPredicates, 83 NumberOfNonLiveVariables, 1054 ConjunctsInSsa, 193 ConjunctsInUnsatCore, 27 InterpolantComputations, 15 PerfectInterpolantSequences, 2/46 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-reverse_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-12_18-18-02-466.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-reverse_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-12_18-18-02-466.csv Completed graceful shutdown