java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-queue_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 11:51:55,155 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 11:51:55,156 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 11:51:55,168 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 11:51:55,168 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 11:51:55,169 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 11:51:55,170 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 11:51:55,171 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 11:51:55,173 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 11:51:55,173 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 11:51:55,174 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 11:51:55,174 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 11:51:55,175 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 11:51:55,176 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 11:51:55,177 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 11:51:55,178 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 11:51:55,180 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 11:51:55,181 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 11:51:55,182 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 11:51:55,183 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 11:51:55,184 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 11:51:55,185 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 11:51:55,185 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 11:51:55,186 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 11:51:55,186 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 11:51:55,187 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 11:51:55,187 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 11:51:55,188 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 11:51:55,188 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 11:51:55,189 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 11:51:55,189 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 11:51:55,189 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-13 11:51:55,198 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 11:51:55,199 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 11:51:55,199 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 11:51:55,199 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 11:51:55,199 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 11:51:55,200 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 11:51:55,200 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 11:51:55,200 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 11:51:55,200 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 11:51:55,200 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 11:51:55,200 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 11:51:55,200 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 11:51:55,200 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 11:51:55,200 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 11:51:55,200 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 11:51:55,201 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 11:51:55,201 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 11:51:55,201 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 11:51:55,201 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 11:51:55,201 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 11:51:55,201 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 11:51:55,201 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 11:51:55,201 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 11:51:55,201 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 11:51:55,228 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 11:51:55,236 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 11:51:55,238 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 11:51:55,239 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 11:51:55,240 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 11:51:55,240 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,536 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGa76ea37ad [2018-04-13 11:51:55,681 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 11:51:55,681 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 11:51:55,682 INFO L168 CDTParser]: Scanning dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,689 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 11:51:55,689 INFO L215 ultiparseSymbolTable]: [2018-04-13 11:51:55,689 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 11:51:55,689 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,689 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 11:51:55,689 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__timer_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,690 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____int8_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,690 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,690 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____fsword_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,690 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__ssize_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,690 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_once_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,690 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_short in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,690 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__wchar_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,690 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__int8_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,690 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__ino_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,690 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____intptr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,690 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_int64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,691 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__loff_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,691 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____int64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,691 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__size_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,691 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__ldiv_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,691 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__off_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,691 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____u_int in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,691 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,691 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____useconds_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,691 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,691 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____socklen_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,691 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,691 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__register_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,691 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__quad_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,692 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__caddr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,692 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__fsid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,692 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____clockid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,692 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__SLL in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,692 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__div_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,692 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____clock_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,692 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____loff_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,692 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,692 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____uint8_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,692 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____key_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,692 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_int16_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,692 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__ushort in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,692 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____ino_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,693 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____time_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,693 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____uint32_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,693 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,693 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__int64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,693 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____sigset_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,693 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____rlim64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,693 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,693 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,693 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____daddr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,693 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____mode_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,693 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____fsid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,694 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____uint16_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,694 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____dev_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,694 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__fd_set in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,694 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,694 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_long in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,694 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__daddr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,694 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__gid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,694 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____caddr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,694 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____u_short in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,694 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__clock_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,694 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__mode_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,694 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__suseconds_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,695 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__sigset_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,695 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,695 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__blkcnt_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,695 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_int32_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,695 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____u_long in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,695 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_char in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,695 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__ulong in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,695 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_quad_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,695 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____int16_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,695 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____blksize_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,695 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__blksize_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____qaddr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____quad_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__int16_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____u_char in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_key_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____u_quad_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____off64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__time_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__uid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__lldiv_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____rlim_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__clockid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____int32_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____suseconds_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____blkcnt_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__dev_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____pid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____timer_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____gid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__id_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_int in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____ssize_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__nlink_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____id_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____fd_mask in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____ino64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____off_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__uint in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_int8_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____uid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____uint64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__fd_mask in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____nlink_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__key_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__int32_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__idtype_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:55,713 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGa76ea37ad [2018-04-13 11:51:55,717 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 11:51:55,718 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 11:51:55,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 11:51:55,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 11:51:55,722 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 11:51:55,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:51:55" (1/1) ... [2018-04-13 11:51:55,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a893f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:51:55, skipping insertion in model container [2018-04-13 11:51:55,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:51:55" (1/1) ... [2018-04-13 11:51:55,734 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 11:51:55,755 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 11:51:55,885 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 11:51:55,928 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 11:51:55,935 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-13 11:51:55,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:51:55 WrapperNode [2018-04-13 11:51:55,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 11:51:55,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 11:51:55,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 11:51:55,969 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 11:51:55,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:51:55" (1/1) ... [2018-04-13 11:51:55,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:51:55" (1/1) ... [2018-04-13 11:51:55,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:51:55" (1/1) ... [2018-04-13 11:51:55,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:51:55" (1/1) ... [2018-04-13 11:51:55,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:51:55" (1/1) ... [2018-04-13 11:51:56,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:51:55" (1/1) ... [2018-04-13 11:51:56,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:51:55" (1/1) ... [2018-04-13 11:51:56,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 11:51:56,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 11:51:56,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 11:51:56,011 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 11:51:56,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:51:55" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 11:51:56,096 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 11:51:56,096 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 11:51:56,096 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 11:51:56,096 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 11:51:56,096 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 11:51:56,096 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 11:51:56,096 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 11:51:56,096 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 11:51:56,096 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 11:51:56,096 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 11:51:56,096 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 11:51:56,097 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 11:51:56,097 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 11:51:56,097 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 11:51:56,097 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 11:51:56,097 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 11:51:56,097 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 11:51:56,097 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 11:51:56,097 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 11:51:56,097 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 11:51:56,097 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 11:51:56,097 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 11:51:56,098 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 11:51:56,098 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 11:51:56,098 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 11:51:56,098 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 11:51:56,098 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 11:51:56,098 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 11:51:56,098 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 11:51:56,098 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 11:51:56,098 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 11:51:56,098 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 11:51:56,098 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 11:51:56,099 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 11:51:56,099 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 11:51:56,099 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 11:51:56,099 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 11:51:56,099 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 11:51:56,099 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 11:51:56,099 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 11:51:56,099 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 11:51:56,099 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 11:51:56,100 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 11:51:56,100 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 11:51:56,100 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 11:51:56,100 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 11:51:56,100 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 11:51:56,100 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 11:51:56,100 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 11:51:56,100 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 11:51:56,100 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 11:51:56,100 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 11:51:56,101 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 11:51:56,101 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 11:51:56,101 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 11:51:56,101 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 11:51:56,101 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 11:51:56,101 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 11:51:56,101 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 11:51:56,101 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 11:51:56,101 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 11:51:56,101 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-13 11:51:56,101 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 11:51:56,101 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 11:51:56,101 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-13 11:51:56,102 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 11:51:56,102 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 11:51:56,102 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-13 11:51:56,102 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 11:51:56,102 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 11:51:56,102 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 11:51:56,102 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 11:51:56,102 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 11:51:56,102 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 11:51:56,102 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 11:51:56,102 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 11:51:56,102 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 11:51:56,102 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 11:51:56,103 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 11:51:56,103 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 11:51:56,103 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 11:51:56,103 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 11:51:56,103 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 11:51:56,103 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 11:51:56,103 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 11:51:56,103 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 11:51:56,103 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 11:51:56,103 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 11:51:56,103 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 11:51:56,103 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 11:51:56,103 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 11:51:56,103 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 11:51:56,103 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 11:51:56,103 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 11:51:56,104 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 11:51:56,104 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 11:51:56,104 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 11:51:56,104 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 11:51:56,104 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 11:51:56,104 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 11:51:56,104 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 11:51:56,104 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 11:51:56,104 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 11:51:56,104 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 11:51:56,105 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 11:51:56,105 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 11:51:56,105 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 11:51:56,105 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-13 11:51:56,105 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 11:51:56,105 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 11:51:56,105 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-13 11:51:56,105 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 11:51:56,105 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-13 11:51:56,105 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 11:51:56,106 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 11:51:56,106 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 11:51:56,106 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 11:51:56,106 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 11:51:56,524 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 11:51:56,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 11:51:56 BoogieIcfgContainer [2018-04-13 11:51:56,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 11:51:56,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 11:51:56,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 11:51:56,530 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 11:51:56,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:51:55" (1/3) ... [2018-04-13 11:51:56,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb07c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:51:56, skipping insertion in model container [2018-04-13 11:51:56,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:51:55" (2/3) ... [2018-04-13 11:51:56,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb07c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:51:56, skipping insertion in model container [2018-04-13 11:51:56,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 11:51:56" (3/3) ... [2018-04-13 11:51:56,533 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-13 11:51:56,539 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 11:51:56,545 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 61 error locations. [2018-04-13 11:51:56,570 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 11:51:56,571 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 11:51:56,571 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 11:51:56,571 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 11:51:56,571 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 11:51:56,571 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 11:51:56,571 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 11:51:56,571 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 11:51:56,571 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 11:51:56,572 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 11:51:56,582 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states. [2018-04-13 11:51:56,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-13 11:51:56,589 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:51:56,589 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:51:56,589 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:51:56,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1577217846, now seen corresponding path program 1 times [2018-04-13 11:51:56,593 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:51:56,594 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:51:56,628 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:51:56,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:51:56,628 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:51:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:51:56,657 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:51:56,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:51:56,694 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 11:51:56,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 11:51:56,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 11:51:56,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 11:51:56,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 11:51:56,706 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 4 states. [2018-04-13 11:51:56,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:51:56,860 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2018-04-13 11:51:56,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 11:51:56,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-13 11:51:56,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:51:56,869 INFO L225 Difference]: With dead ends: 177 [2018-04-13 11:51:56,869 INFO L226 Difference]: Without dead ends: 173 [2018-04-13 11:51:56,870 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 11:51:56,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-13 11:51:56,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 163. [2018-04-13 11:51:56,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-04-13 11:51:56,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 175 transitions. [2018-04-13 11:51:56,903 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 175 transitions. Word has length 8 [2018-04-13 11:51:56,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:51:56,903 INFO L459 AbstractCegarLoop]: Abstraction has 163 states and 175 transitions. [2018-04-13 11:51:56,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 11:51:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 175 transitions. [2018-04-13 11:51:56,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-13 11:51:56,904 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:51:56,904 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:51:56,904 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:51:56,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1577217845, now seen corresponding path program 1 times [2018-04-13 11:51:56,904 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:51:56,904 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:51:56,906 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:51:56,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:51:56,906 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:51:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:51:56,919 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:51:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:51:56,951 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 11:51:56,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 11:51:56,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 11:51:56,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 11:51:56,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 11:51:56,953 INFO L87 Difference]: Start difference. First operand 163 states and 175 transitions. Second operand 4 states. [2018-04-13 11:51:57,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:51:57,031 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2018-04-13 11:51:57,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 11:51:57,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-13 11:51:57,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:51:57,033 INFO L225 Difference]: With dead ends: 156 [2018-04-13 11:51:57,033 INFO L226 Difference]: Without dead ends: 156 [2018-04-13 11:51:57,033 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 11:51:57,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-13 11:51:57,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2018-04-13 11:51:57,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-13 11:51:57,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 163 transitions. [2018-04-13 11:51:57,041 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 163 transitions. Word has length 8 [2018-04-13 11:51:57,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:51:57,041 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 163 transitions. [2018-04-13 11:51:57,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 11:51:57,042 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 163 transitions. [2018-04-13 11:51:57,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-13 11:51:57,042 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:51:57,042 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:51:57,042 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:51:57,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1014420055, now seen corresponding path program 1 times [2018-04-13 11:51:57,043 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:51:57,043 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:51:57,044 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:51:57,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:51:57,045 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:51:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:51:57,063 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:51:57,069 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 11:51:57,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 11:51:57,069 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 11:51:57,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:51:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:51:57,105 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 11:51:57,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 11:51:57,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:57,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:57,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 11:51:57,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:51:57,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:51:57,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-13 11:51:57,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:57,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 11:51:57,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-13 11:51:57,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:51:57,175 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 11:51:57,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 11:51:57,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 11:51:57,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 11:51:57,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-13 11:51:57,176 INFO L87 Difference]: Start difference. First operand 152 states and 163 transitions. Second operand 6 states. [2018-04-13 11:51:57,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:51:57,386 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2018-04-13 11:51:57,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 11:51:57,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-04-13 11:51:57,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:51:57,387 INFO L225 Difference]: With dead ends: 158 [2018-04-13 11:51:57,387 INFO L226 Difference]: Without dead ends: 158 [2018-04-13 11:51:57,388 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-04-13 11:51:57,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-13 11:51:57,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2018-04-13 11:51:57,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-13 11:51:57,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2018-04-13 11:51:57,393 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 16 [2018-04-13 11:51:57,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:51:57,393 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2018-04-13 11:51:57,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 11:51:57,393 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2018-04-13 11:51:57,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-13 11:51:57,393 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:51:57,393 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:51:57,393 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:51:57,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1014420056, now seen corresponding path program 1 times [2018-04-13 11:51:57,394 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:51:57,394 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:51:57,395 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:51:57,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:51:57,395 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:51:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:51:57,408 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:51:57,411 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 11:51:57,411 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 11:51:57,411 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 11:51:57,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:51:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:51:57,436 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 11:51:57,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 11:51:57,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:57,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 11:51:57,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:57,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:57,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 11:51:57,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:51:57,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 11:51:57,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:57,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:51:57,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:51:57,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 11:51:57,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:57,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 11:51:57,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-04-13 11:51:57,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:51:57,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 11:51:57,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 11:51:57,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 11:51:57,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 11:51:57,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-13 11:51:57,513 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand 7 states. [2018-04-13 11:51:57,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:51:57,836 INFO L93 Difference]: Finished difference Result 234 states and 249 transitions. [2018-04-13 11:51:57,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 11:51:57,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-04-13 11:51:57,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:51:57,838 INFO L225 Difference]: With dead ends: 234 [2018-04-13 11:51:57,838 INFO L226 Difference]: Without dead ends: 234 [2018-04-13 11:51:57,838 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-04-13 11:51:57,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-04-13 11:51:57,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 161. [2018-04-13 11:51:57,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-13 11:51:57,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 176 transitions. [2018-04-13 11:51:57,845 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 176 transitions. Word has length 16 [2018-04-13 11:51:57,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:51:57,845 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 176 transitions. [2018-04-13 11:51:57,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 11:51:57,845 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 176 transitions. [2018-04-13 11:51:57,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-13 11:51:57,846 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:51:57,846 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:51:57,846 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:51:57,846 INFO L82 PathProgramCache]: Analyzing trace with hash -99903366, now seen corresponding path program 1 times [2018-04-13 11:51:57,846 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:51:57,846 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:51:57,847 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:51:57,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:51:57,847 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:51:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:51:57,856 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:51:57,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:51:57,873 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 11:51:57,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 11:51:57,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 11:51:57,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 11:51:57,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 11:51:57,873 INFO L87 Difference]: Start difference. First operand 161 states and 176 transitions. Second operand 5 states. [2018-04-13 11:51:58,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:51:58,010 INFO L93 Difference]: Finished difference Result 255 states and 276 transitions. [2018-04-13 11:51:58,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 11:51:58,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-13 11:51:58,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:51:58,011 INFO L225 Difference]: With dead ends: 255 [2018-04-13 11:51:58,011 INFO L226 Difference]: Without dead ends: 255 [2018-04-13 11:51:58,012 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-13 11:51:58,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-04-13 11:51:58,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 160. [2018-04-13 11:51:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-13 11:51:58,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 174 transitions. [2018-04-13 11:51:58,017 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 174 transitions. Word has length 18 [2018-04-13 11:51:58,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:51:58,018 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 174 transitions. [2018-04-13 11:51:58,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 11:51:58,018 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 174 transitions. [2018-04-13 11:51:58,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-13 11:51:58,018 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:51:58,019 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:51:58,023 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:51:58,023 INFO L82 PathProgramCache]: Analyzing trace with hash -99903365, now seen corresponding path program 1 times [2018-04-13 11:51:58,023 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:51:58,023 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:51:58,024 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:51:58,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:51:58,024 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:51:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:51:58,034 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:51:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:51:58,064 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 11:51:58,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 11:51:58,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 11:51:58,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 11:51:58,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 11:51:58,071 INFO L87 Difference]: Start difference. First operand 160 states and 174 transitions. Second operand 5 states. [2018-04-13 11:51:58,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:51:58,216 INFO L93 Difference]: Finished difference Result 264 states and 285 transitions. [2018-04-13 11:51:58,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 11:51:58,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-13 11:51:58,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:51:58,217 INFO L225 Difference]: With dead ends: 264 [2018-04-13 11:51:58,217 INFO L226 Difference]: Without dead ends: 264 [2018-04-13 11:51:58,218 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-13 11:51:58,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-04-13 11:51:58,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 159. [2018-04-13 11:51:58,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-04-13 11:51:58,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 172 transitions. [2018-04-13 11:51:58,222 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 172 transitions. Word has length 18 [2018-04-13 11:51:58,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:51:58,222 INFO L459 AbstractCegarLoop]: Abstraction has 159 states and 172 transitions. [2018-04-13 11:51:58,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 11:51:58,222 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 172 transitions. [2018-04-13 11:51:58,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-13 11:51:58,223 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:51:58,223 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-13 11:51:58,223 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:51:58,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1631135996, now seen corresponding path program 1 times [2018-04-13 11:51:58,223 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:51:58,223 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:51:58,224 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:51:58,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:51:58,225 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:51:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:51:58,242 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:51:58,245 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 11:51:58,245 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 11:51:58,245 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 11:51:58,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:51:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:51:58,281 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 11:51:58,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 11:51:58,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 11:51:58,301 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-13 11:51:58,302 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-13 11:51:58,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,309 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-13 11:51:58,311 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-13 11:51:58,311 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,312 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,317 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:34, output treesize:20 [2018-04-13 11:51:58,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-13 11:51:58,327 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-13 11:51:58,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2018-04-13 11:51:58,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-04-13 11:51:58,352 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 24 treesize of output 23 [2018-04-13 11:51:58,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 11:51:58,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2018-04-13 11:51:58,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2018-04-13 11:51:58,389 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 21 treesize of output 14 [2018-04-13 11:51:58,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-04-13 11:51:58,396 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,404 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:5 [2018-04-13 11:51:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:51:58,414 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 11:51:58,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-13 11:51:58,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 11:51:58,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 11:51:58,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-13 11:51:58,415 INFO L87 Difference]: Start difference. First operand 159 states and 172 transitions. Second operand 11 states. [2018-04-13 11:51:58,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:51:58,848 INFO L93 Difference]: Finished difference Result 232 states and 246 transitions. [2018-04-13 11:51:58,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 11:51:58,848 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-04-13 11:51:58,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:51:58,849 INFO L225 Difference]: With dead ends: 232 [2018-04-13 11:51:58,849 INFO L226 Difference]: Without dead ends: 232 [2018-04-13 11:51:58,849 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2018-04-13 11:51:58,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-13 11:51:58,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 161. [2018-04-13 11:51:58,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-13 11:51:58,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 175 transitions. [2018-04-13 11:51:58,853 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 175 transitions. Word has length 22 [2018-04-13 11:51:58,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:51:58,853 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 175 transitions. [2018-04-13 11:51:58,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 11:51:58,853 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 175 transitions. [2018-04-13 11:51:58,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-13 11:51:58,853 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:51:58,854 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-13 11:51:58,854 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:51:58,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1631135997, now seen corresponding path program 1 times [2018-04-13 11:51:58,854 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:51:58,854 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:51:58,855 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:51:58,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:51:58,855 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:51:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:51:58,865 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:51:58,868 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 11:51:58,868 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 11:51:58,868 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 11:51:58,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:51:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:51:58,901 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 11:51:58,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 11:51:58,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 11:51:58,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:51:58,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:51:58,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 11:51:58,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 11:51:58,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-13 11:51:58,947 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-13 11:51:58,948 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-13 11:51:58,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,955 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-13 11:51:58,956 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-13 11:51:58,956 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,957 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,961 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-13 11:51:58,961 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-13 11:51:58,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-13 11:51:58,984 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-13 11:51:58,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:58,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-04-13 11:51:58,999 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-13 11:51:58,999 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:59,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:59,009 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-13 11:51:59,009 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-04-13 11:51:59,029 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 51 treesize of output 37 [2018-04-13 11:51:59,033 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-13 11:51:59,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:59,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-13 11:51:59,039 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:59,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:59,051 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 24 treesize of output 22 [2018-04-13 11:51:59,053 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-13 11:51:59,053 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:59,056 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-13 11:51:59,056 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:59,057 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:59,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:59,060 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-04-13 11:51:59,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:51:59,075 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 11:51:59,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-13 11:51:59,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 11:51:59,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 11:51:59,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-04-13 11:51:59,076 INFO L87 Difference]: Start difference. First operand 161 states and 175 transitions. Second operand 11 states. [2018-04-13 11:51:59,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:51:59,547 INFO L93 Difference]: Finished difference Result 225 states and 239 transitions. [2018-04-13 11:51:59,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 11:51:59,547 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-04-13 11:51:59,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:51:59,548 INFO L225 Difference]: With dead ends: 225 [2018-04-13 11:51:59,548 INFO L226 Difference]: Without dead ends: 225 [2018-04-13 11:51:59,548 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=242, Invalid=514, Unknown=0, NotChecked=0, Total=756 [2018-04-13 11:51:59,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-04-13 11:51:59,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 154. [2018-04-13 11:51:59,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-13 11:51:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 167 transitions. [2018-04-13 11:51:59,550 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 167 transitions. Word has length 22 [2018-04-13 11:51:59,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:51:59,550 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 167 transitions. [2018-04-13 11:51:59,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 11:51:59,551 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 167 transitions. [2018-04-13 11:51:59,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 11:51:59,551 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:51:59,551 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:51:59,551 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:51:59,551 INFO L82 PathProgramCache]: Analyzing trace with hash 382306449, now seen corresponding path program 1 times [2018-04-13 11:51:59,551 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:51:59,552 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:51:59,552 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:51:59,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:51:59,552 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:51:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:51:59,557 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:51:59,559 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 11:51:59,559 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 11:51:59,559 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 11:51:59,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:51:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:51:59,566 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 11:51:59,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:51:59,592 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 11:51:59,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 11:51:59,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 11:51:59,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 11:51:59,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 11:51:59,593 INFO L87 Difference]: Start difference. First operand 154 states and 167 transitions. Second operand 4 states. [2018-04-13 11:51:59,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:51:59,612 INFO L93 Difference]: Finished difference Result 195 states and 211 transitions. [2018-04-13 11:51:59,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 11:51:59,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-04-13 11:51:59,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:51:59,613 INFO L225 Difference]: With dead ends: 195 [2018-04-13 11:51:59,613 INFO L226 Difference]: Without dead ends: 195 [2018-04-13 11:51:59,613 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 11:51:59,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-04-13 11:51:59,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 173. [2018-04-13 11:51:59,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-04-13 11:51:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 190 transitions. [2018-04-13 11:51:59,617 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 190 transitions. Word has length 29 [2018-04-13 11:51:59,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:51:59,617 INFO L459 AbstractCegarLoop]: Abstraction has 173 states and 190 transitions. [2018-04-13 11:51:59,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 11:51:59,617 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 190 transitions. [2018-04-13 11:51:59,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-13 11:51:59,618 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:51:59,618 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-13 11:51:59,618 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:51:59,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1034202541, now seen corresponding path program 1 times [2018-04-13 11:51:59,618 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:51:59,618 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:51:59,619 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:51:59,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:51:59,619 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:51:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:51:59,625 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:51:59,627 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 11:51:59,627 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 11:51:59,627 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 11:51:59,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:51:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:51:59,640 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 11:51:59,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:51:59,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 11:51:59,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 11:51:59,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 11:51:59,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 11:51:59,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-13 11:51:59,663 INFO L87 Difference]: Start difference. First operand 173 states and 190 transitions. Second operand 4 states. [2018-04-13 11:51:59,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:51:59,696 INFO L93 Difference]: Finished difference Result 177 states and 193 transitions. [2018-04-13 11:51:59,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 11:51:59,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-04-13 11:51:59,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:51:59,698 INFO L225 Difference]: With dead ends: 177 [2018-04-13 11:51:59,698 INFO L226 Difference]: Without dead ends: 177 [2018-04-13 11:51:59,698 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-13 11:51:59,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-13 11:51:59,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2018-04-13 11:51:59,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-04-13 11:51:59,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 189 transitions. [2018-04-13 11:51:59,702 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 189 transitions. Word has length 30 [2018-04-13 11:51:59,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:51:59,702 INFO L459 AbstractCegarLoop]: Abstraction has 173 states and 189 transitions. [2018-04-13 11:51:59,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 11:51:59,702 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 189 transitions. [2018-04-13 11:51:59,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-13 11:51:59,703 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:51:59,703 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:51:59,703 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:51:59,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1970729022, now seen corresponding path program 1 times [2018-04-13 11:51:59,703 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:51:59,703 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:51:59,704 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:51:59,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:51:59,704 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:51:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:51:59,710 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:51:59,712 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 11:51:59,712 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 11:51:59,712 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 11:51:59,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:51:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:51:59,724 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 11:51:59,729 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-13 11:51:59,732 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-13 11:51:59,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:59,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:59,740 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-13 11:51:59,741 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-13 11:51:59,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:59,743 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:59,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:59,747 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-04-13 11:51:59,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-13 11:51:59,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:51:59,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-13 11:51:59,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:59,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:59,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-13 11:51:59,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:51:59,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-13 11:51:59,779 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:59,782 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:59,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:59,787 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-13 11:51:59,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-13 11:51:59,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:51:59,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-13 11:51:59,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:59,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:59,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-13 11:51:59,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:51:59,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-13 11:51:59,807 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:51:59,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:59,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:51:59,811 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-04-13 11:51:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:51:59,823 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 11:51:59,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 11:51:59,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 11:51:59,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 11:51:59,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-13 11:51:59,824 INFO L87 Difference]: Start difference. First operand 173 states and 189 transitions. Second operand 7 states. [2018-04-13 11:51:59,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:51:59,916 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2018-04-13 11:51:59,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 11:51:59,917 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-04-13 11:51:59,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:51:59,917 INFO L225 Difference]: With dead ends: 172 [2018-04-13 11:51:59,917 INFO L226 Difference]: Without dead ends: 172 [2018-04-13 11:51:59,918 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-13 11:51:59,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-13 11:51:59,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 167. [2018-04-13 11:51:59,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-04-13 11:51:59,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 179 transitions. [2018-04-13 11:51:59,920 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 179 transitions. Word has length 31 [2018-04-13 11:51:59,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:51:59,920 INFO L459 AbstractCegarLoop]: Abstraction has 167 states and 179 transitions. [2018-04-13 11:51:59,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 11:51:59,920 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 179 transitions. [2018-04-13 11:51:59,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-13 11:51:59,921 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:51:59,921 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] [2018-04-13 11:51:59,921 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:51:59,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1040476521, now seen corresponding path program 1 times [2018-04-13 11:51:59,921 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:51:59,921 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:51:59,922 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:51:59,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:51:59,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:51:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:51:59,927 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:51:59,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:51:59,981 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 11:51:59,981 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 11:51:59,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:51:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:51:59,995 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 11:51:59,999 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-13 11:52:00,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 11:52:00,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:00,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:00,009 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-13 11:52:00,010 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-13 11:52:00,011 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:00,012 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:00,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:00,016 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-04-13 11:52:00,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-13 11:52:00,029 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:52:00,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-13 11:52:00,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:00,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:00,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-13 11:52:00,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:52:00,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-13 11:52:00,055 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:00,058 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:00,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:00,062 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-13 11:52:00,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-13 11:52:00,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:52:00,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-13 11:52:00,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:00,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:00,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-13 11:52:00,114 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:52:00,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-13 11:52:00,115 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:00,118 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:00,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:00,121 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-04-13 11:52:00,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:52:00,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 11:52:00,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2018-04-13 11:52:00,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 11:52:00,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 11:52:00,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-13 11:52:00,129 INFO L87 Difference]: Start difference. First operand 167 states and 179 transitions. Second operand 9 states. [2018-04-13 11:52:00,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:52:00,292 INFO L93 Difference]: Finished difference Result 203 states and 219 transitions. [2018-04-13 11:52:00,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 11:52:00,292 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-04-13 11:52:00,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:52:00,293 INFO L225 Difference]: With dead ends: 203 [2018-04-13 11:52:00,293 INFO L226 Difference]: Without dead ends: 203 [2018-04-13 11:52:00,293 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-04-13 11:52:00,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-04-13 11:52:00,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 180. [2018-04-13 11:52:00,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-13 11:52:00,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 193 transitions. [2018-04-13 11:52:00,296 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 193 transitions. Word has length 36 [2018-04-13 11:52:00,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:52:00,296 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 193 transitions. [2018-04-13 11:52:00,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 11:52:00,296 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 193 transitions. [2018-04-13 11:52:00,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-13 11:52:00,296 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:52:00,296 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:52:00,297 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:52:00,297 INFO L82 PathProgramCache]: Analyzing trace with hash -2104967361, now seen corresponding path program 1 times [2018-04-13 11:52:00,297 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:52:00,297 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:52:00,298 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:52:00,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:52:00,298 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:52:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:52:00,304 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:52:00,306 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 11:52:00,306 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 11:52:00,306 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 11:52:00,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:52:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:52:00,320 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 11:52:00,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:52:00,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 11:52:00,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-13 11:52:00,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 11:52:00,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 11:52:00,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=27, Unknown=3, NotChecked=0, Total=42 [2018-04-13 11:52:00,361 INFO L87 Difference]: Start difference. First operand 180 states and 193 transitions. Second operand 7 states. [2018-04-13 11:52:00,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:52:00,499 INFO L93 Difference]: Finished difference Result 192 states and 204 transitions. [2018-04-13 11:52:00,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 11:52:00,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-04-13 11:52:00,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:52:00,500 INFO L225 Difference]: With dead ends: 192 [2018-04-13 11:52:00,500 INFO L226 Difference]: Without dead ends: 169 [2018-04-13 11:52:00,500 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=60, Unknown=3, NotChecked=0, Total=90 [2018-04-13 11:52:00,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-04-13 11:52:00,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-04-13 11:52:00,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-04-13 11:52:00,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 181 transitions. [2018-04-13 11:52:00,510 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 181 transitions. Word has length 37 [2018-04-13 11:52:00,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:52:00,510 INFO L459 AbstractCegarLoop]: Abstraction has 169 states and 181 transitions. [2018-04-13 11:52:00,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 11:52:00,510 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 181 transitions. [2018-04-13 11:52:00,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-13 11:52:00,511 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:52:00,511 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:52:00,511 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:52:00,511 INFO L82 PathProgramCache]: Analyzing trace with hash 557618967, now seen corresponding path program 1 times [2018-04-13 11:52:00,511 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:52:00,512 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:52:00,513 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:52:00,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:52:00,513 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:52:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:52:00,532 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:52:00,536 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 11:52:00,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 11:52:00,537 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 11:52:00,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:52:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:52:00,605 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 11:52:00,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:52:00,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:52:00,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 11:52:00,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:00,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:00,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-13 11:52:00,641 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-13 11:52:00,642 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-13 11:52:00,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:00,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:00,648 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-13 11:52:00,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-13 11:52:00,664 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-13 11:52:00,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 11:52:00,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:00,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:00,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 11:52:00,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-13 11:52:00,709 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 38 treesize of output 26 [2018-04-13 11:52:00,711 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-13 11:52:00,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:00,717 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-13 11:52:00,718 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:00,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:00,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 11:52:00,725 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-04-13 11:52:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:52:00,743 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 11:52:00,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 11:52:00,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 11:52:00,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 11:52:00,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-04-13 11:52:00,744 INFO L87 Difference]: Start difference. First operand 169 states and 181 transitions. Second operand 9 states. [2018-04-13 11:52:01,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:52:01,002 INFO L93 Difference]: Finished difference Result 247 states and 262 transitions. [2018-04-13 11:52:01,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 11:52:01,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-04-13 11:52:01,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:52:01,003 INFO L225 Difference]: With dead ends: 247 [2018-04-13 11:52:01,003 INFO L226 Difference]: Without dead ends: 247 [2018-04-13 11:52:01,004 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-04-13 11:52:01,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-13 11:52:01,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 168. [2018-04-13 11:52:01,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-13 11:52:01,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 180 transitions. [2018-04-13 11:52:01,007 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 180 transitions. Word has length 42 [2018-04-13 11:52:01,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:52:01,007 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 180 transitions. [2018-04-13 11:52:01,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 11:52:01,007 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 180 transitions. [2018-04-13 11:52:01,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-13 11:52:01,008 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:52:01,008 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:52:01,008 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:52:01,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1821501930, now seen corresponding path program 1 times [2018-04-13 11:52:01,008 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:52:01,008 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:52:01,009 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:52:01,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:52:01,009 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:52:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:52:01,015 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:52:01,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:52:01,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 11:52:01,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 11:52:01,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 11:52:01,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 11:52:01,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 11:52:01,044 INFO L87 Difference]: Start difference. First operand 168 states and 180 transitions. Second operand 3 states. [2018-04-13 11:52:01,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:52:01,058 INFO L93 Difference]: Finished difference Result 248 states and 266 transitions. [2018-04-13 11:52:01,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 11:52:01,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-04-13 11:52:01,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:52:01,059 INFO L225 Difference]: With dead ends: 248 [2018-04-13 11:52:01,059 INFO L226 Difference]: Without dead ends: 248 [2018-04-13 11:52:01,059 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 11:52:01,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-04-13 11:52:01,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 193. [2018-04-13 11:52:01,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-13 11:52:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 206 transitions. [2018-04-13 11:52:01,063 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 206 transitions. Word has length 49 [2018-04-13 11:52:01,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:52:01,064 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 206 transitions. [2018-04-13 11:52:01,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 11:52:01,064 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 206 transitions. [2018-04-13 11:52:01,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-13 11:52:01,064 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:52:01,064 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:52:01,065 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:52:01,065 INFO L82 PathProgramCache]: Analyzing trace with hash -114058552, now seen corresponding path program 1 times [2018-04-13 11:52:01,065 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:52:01,065 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:52:01,065 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:52:01,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:52:01,066 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:52:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:52:01,073 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:52:01,076 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 11:52:01,077 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 11:52:01,077 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 11:52:01,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:52:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:52:01,102 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 11:52:01,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:52:01,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:52:01,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 11:52:01,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:01,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:01,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-13 11:52:01,167 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-13 11:52:01,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-13 11:52:01,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:01,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:01,186 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-13 11:52:01,188 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-13 11:52:01,188 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:01,196 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:01,218 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-13 11:52:01,218 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-04-13 11:52:01,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-04-13 11:52:01,242 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-13 11:52:01,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:01,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:01,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:01,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:35 [2018-04-13 11:52:01,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 41 [2018-04-13 11:52:01,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:52:01,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 36 [2018-04-13 11:52:01,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:01,505 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 28 treesize of output 27 [2018-04-13 11:52:01,505 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:01,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:01,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 11:52:01,521 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:44 [2018-04-13 11:52:01,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 57 [2018-04-13 11:52:01,602 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 44 treesize of output 55 [2018-04-13 11:52:01,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 11:52:01,653 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 39 treesize of output 38 [2018-04-13 11:52:01,654 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:01,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 11:52:01,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-13 11:52:01,704 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:92 [2018-04-13 11:52:01,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 63 [2018-04-13 11:52:01,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2018-04-13 11:52:01,819 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 11:52:01,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2018-04-13 11:52:01,868 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 11:52:01,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-13 11:52:01,902 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:01,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 41 [2018-04-13 11:52:01,942 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 11:52:01,990 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 35 treesize of output 26 [2018-04-13 11:52:01,990 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:02,043 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 37 treesize of output 28 [2018-04-13 11:52:02,044 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:02,071 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 31 treesize of output 22 [2018-04-13 11:52:02,072 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:02,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 42 [2018-04-13 11:52:02,175 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-13 11:52:02,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-04-13 11:52:02,235 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:02,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-04-13 11:52:02,345 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 34 [2018-04-13 11:52:02,347 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-13 11:52:02,347 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:02,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-13 11:52:02,352 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:02,355 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:02,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-04-13 11:52:02,399 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:127, output treesize:109 [2018-04-13 11:52:02,450 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-13 11:52:02,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 11:52:02,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 11:52:02,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 11:52:02,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 11:52:02,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-04-13 11:52:02,451 INFO L87 Difference]: Start difference. First operand 193 states and 206 transitions. Second operand 15 states. [2018-04-13 11:52:02,880 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 53 DAG size of output 46 [2018-04-13 11:52:03,083 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 60 DAG size of output 49 [2018-04-13 11:52:03,239 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 55 DAG size of output 46 [2018-04-13 11:52:03,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:52:03,469 INFO L93 Difference]: Finished difference Result 275 states and 296 transitions. [2018-04-13 11:52:03,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 11:52:03,469 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2018-04-13 11:52:03,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:52:03,470 INFO L225 Difference]: With dead ends: 275 [2018-04-13 11:52:03,470 INFO L226 Difference]: Without dead ends: 275 [2018-04-13 11:52:03,471 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2018-04-13 11:52:03,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-13 11:52:03,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 226. [2018-04-13 11:52:03,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-04-13 11:52:03,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 244 transitions. [2018-04-13 11:52:03,476 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 244 transitions. Word has length 56 [2018-04-13 11:52:03,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:52:03,476 INFO L459 AbstractCegarLoop]: Abstraction has 226 states and 244 transitions. [2018-04-13 11:52:03,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 11:52:03,476 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 244 transitions. [2018-04-13 11:52:03,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-13 11:52:03,477 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:52:03,477 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:52:03,477 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:52:03,477 INFO L82 PathProgramCache]: Analyzing trace with hash -114058551, now seen corresponding path program 1 times [2018-04-13 11:52:03,477 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:52:03,477 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:52:03,478 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:52:03,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:52:03,478 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:52:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:52:03,489 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:52:03,492 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 11:52:03,492 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 11:52:03,492 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 11:52:03,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:52:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:52:03,528 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 11:52:03,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 11:52:03,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:03,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:52:03,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:52:03,570 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-13 11:52:03,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:03,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:03,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-04-13 11:52:03,598 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-13 11:52:03,600 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-13 11:52:03,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:03,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:03,614 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-13 11:52:03,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 11:52:03,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:03,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:03,625 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-13 11:52:03,625 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:37 [2018-04-13 11:52:03,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:52:03,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2018-04-13 11:52:03,663 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-13 11:52:03,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:03,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:03,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-13 11:52:03,687 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-13 11:52:03,687 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:03,691 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:03,701 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-13 11:52:03,701 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:79, output treesize:63 [2018-04-13 11:52:03,756 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-13 11:52:03,763 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-13 11:52:03,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 11:52:03,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 11:52:03,800 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:52:03,801 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 65 [2018-04-13 11:52:03,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-04-13 11:52:03,803 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:03,811 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:03,815 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-13 11:52:03,817 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:52:03,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-04-13 11:52:03,818 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:03,825 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:03,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-13 11:52:03,847 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:98, output treesize:143 [2018-04-13 11:52:09,897 WARN L148 SmtUtils]: Spent 6031ms on a formula simplification that was a NOOP. DAG size: 59 [2018-04-13 11:52:09,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 79 [2018-04-13 11:52:09,936 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-13 11:52:09,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 11:52:09,953 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:52:09,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2018-04-13 11:52:09,953 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:09,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 11:52:10,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-04-13 11:52:10,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-13 11:52:10,037 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:10,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-13 11:52:10,054 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:10,064 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:10,067 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 47 [2018-04-13 11:52:10,070 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-13 11:52:10,070 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:10,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-13 11:52:10,085 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:10,095 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:10,136 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 74 treesize of output 72 [2018-04-13 11:52:10,138 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:52:10,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-13 11:52:10,138 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:10,152 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-13 11:52:10,152 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:10,174 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:10,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2018-04-13 11:52:10,208 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-13 11:52:10,208 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:10,216 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:52:10,217 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 19 treesize of output 13 [2018-04-13 11:52:10,217 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:10,224 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:10,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 11:52:10,250 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 13 variables, input treesize:171, output treesize:23 [2018-04-13 11:52:10,319 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-13 11:52:10,319 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 11:52:10,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 11:52:10,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 11:52:10,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 11:52:10,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-04-13 11:52:10,320 INFO L87 Difference]: Start difference. First operand 226 states and 244 transitions. Second operand 15 states. [2018-04-13 11:52:16,688 WARN L151 SmtUtils]: Spent 6038ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-04-13 11:52:22,827 WARN L151 SmtUtils]: Spent 6042ms on a formula simplification. DAG size of input: 72 DAG size of output 69 [2018-04-13 11:52:28,887 WARN L151 SmtUtils]: Spent 6040ms on a formula simplification. DAG size of input: 71 DAG size of output 68 [2018-04-13 11:52:34,952 WARN L151 SmtUtils]: Spent 6038ms on a formula simplification. DAG size of input: 78 DAG size of output 68 [2018-04-13 11:52:35,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:52:35,197 INFO L93 Difference]: Finished difference Result 264 states and 285 transitions. [2018-04-13 11:52:35,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 11:52:35,198 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2018-04-13 11:52:35,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:52:35,198 INFO L225 Difference]: With dead ends: 264 [2018-04-13 11:52:35,198 INFO L226 Difference]: Without dead ends: 264 [2018-04-13 11:52:35,199 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 30.6s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2018-04-13 11:52:35,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-04-13 11:52:35,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 230. [2018-04-13 11:52:35,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-13 11:52:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 247 transitions. [2018-04-13 11:52:35,202 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 247 transitions. Word has length 56 [2018-04-13 11:52:35,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:52:35,202 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 247 transitions. [2018-04-13 11:52:35,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 11:52:35,202 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 247 transitions. [2018-04-13 11:52:35,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-13 11:52:35,203 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:52:35,203 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:52:35,203 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:52:35,203 INFO L82 PathProgramCache]: Analyzing trace with hash -947949420, now seen corresponding path program 1 times [2018-04-13 11:52:35,203 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:52:35,203 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:52:35,204 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:52:35,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:52:35,205 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:52:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:52:35,214 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:52:35,216 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 11:52:35,216 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 11:52:35,216 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 11:52:35,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:52:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:52:35,248 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 11:52:35,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:52:35,288 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:52:35,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 11:52:35,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:35,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:35,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-13 11:52:35,313 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-13 11:52:35,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 11:52:35,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:35,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:35,327 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-13 11:52:35,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2018-04-13 11:52:35,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:52:35,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-04-13 11:52:35,366 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-13 11:52:35,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:52:35,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:52:35,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 11:52:35,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-04-13 11:52:35,452 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-13 11:52:35,462 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-13 11:52:35,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 11:52:35,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 11:52:35,503 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-13 11:52:35,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:90 [2018-04-13 11:52:51,549 WARN L148 SmtUtils]: Spent 16028ms on a formula simplification that was a NOOP. DAG size: 34 [2018-04-13 11:53:09,640 WARN L148 SmtUtils]: Spent 18030ms on a formula simplification that was a NOOP. DAG size: 36 [2018-04-13 11:53:29,719 WARN L148 SmtUtils]: Spent 20033ms on a formula simplification that was a NOOP. DAG size: 38 [2018-04-13 11:53:29,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 40 [2018-04-13 11:53:29,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:53:29,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:53:29,725 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 13 treesize of output 11 [2018-04-13 11:53:29,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:53:29,731 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-13 11:53:29,732 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 11:53:29,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:53:29,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2018-04-13 11:53:29,752 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-13 11:53:29,752 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 11:53:29,757 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-13 11:53:29,757 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 11:53:29,760 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:53:29,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:53:29,766 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:106, output treesize:19 [2018-04-13 11:53:29,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:53:29,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-13 11:53:29,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:53:29,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 11:53:29,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:15 [2018-04-13 11:53:29,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:53:29,847 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 11:53:29,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 11:53:29,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 11:53:29,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 11:53:29,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-04-13 11:53:29,847 INFO L87 Difference]: Start difference. First operand 230 states and 247 transitions. Second operand 18 states. [2018-04-13 11:53:46,149 WARN L148 SmtUtils]: Spent 16025ms on a formula simplification that was a NOOP. DAG size: 37 [2018-04-13 11:54:04,199 WARN L148 SmtUtils]: Spent 18030ms on a formula simplification that was a NOOP. DAG size: 39 [2018-04-13 11:54:40,393 WARN L151 SmtUtils]: Spent 36067ms on a formula simplification. DAG size of input: 49 DAG size of output 43 [2018-04-13 11:55:16,476 WARN L151 SmtUtils]: Spent 36066ms on a formula simplification. DAG size of input: 56 DAG size of output 48 [2018-04-13 11:55:16,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:55:16,680 INFO L93 Difference]: Finished difference Result 277 states and 298 transitions. [2018-04-13 11:55:16,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 11:55:16,680 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 63 [2018-04-13 11:55:16,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:55:16,681 INFO L225 Difference]: With dead ends: 277 [2018-04-13 11:55:16,681 INFO L226 Difference]: Without dead ends: 277 [2018-04-13 11:55:16,682 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 160.8s TimeCoverageRelationStatistics Valid=239, Invalid=951, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 11:55:16,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-04-13 11:55:16,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 256. [2018-04-13 11:55:16,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-13 11:55:16,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 283 transitions. [2018-04-13 11:55:16,686 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 283 transitions. Word has length 63 [2018-04-13 11:55:16,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:55:16,687 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 283 transitions. [2018-04-13 11:55:16,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 11:55:16,687 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 283 transitions. [2018-04-13 11:55:16,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-13 11:55:16,688 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:55:16,688 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:55:16,688 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:55:16,688 INFO L82 PathProgramCache]: Analyzing trace with hash -947949419, now seen corresponding path program 1 times [2018-04-13 11:55:16,688 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:55:16,688 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:55:16,689 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:55:16,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:55:16,689 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:55:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:55:16,699 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:55:16,702 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 11:55:16,702 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 11:55:16,702 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 11:55:16,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:55:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:55:16,734 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 11:55:16,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 6 treesize of output 5 [2018-04-13 11:55:16,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:16,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:16,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 11:55:16,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:16,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 11:55:16,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:16,799 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:16,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:16,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-13 11:55:16,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:16,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:16,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-04-13 11:55:16,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-13 11:55:16,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 11:55:16,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:16,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:16,827 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-13 11:55:16,829 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-13 11:55:16,829 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:16,830 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:16,840 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-13 11:55:16,841 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:44 [2018-04-13 11:55:16,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:16,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 40 [2018-04-13 11:55:16,884 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-13 11:55:16,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:16,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:16,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:16,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-04-13 11:55:16,919 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-13 11:55:16,920 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:16,924 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:16,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 11:55:16,934 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:93, output treesize:77 [2018-04-13 11:55:16,997 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-13 11:55:16,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:17,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-13 11:55:17,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:17,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:17,025 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 54 treesize of output 49 [2018-04-13 11:55:17,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:17,027 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:55:17,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 44 [2018-04-13 11:55:17,028 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:17,034 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:17,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 11:55:17,047 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:119, output treesize:103 [2018-04-13 11:55:17,096 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 1 [2018-04-13 11:55:17,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:17,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 11:55:17,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:108, output treesize:98 [2018-04-13 11:55:17,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 51 [2018-04-13 11:55:17,168 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-13 11:55:17,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:17,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:17,181 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-13 11:55:17,181 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:17,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:17,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-04-13 11:55:17,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:17,210 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-13 11:55:17,211 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:17,220 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 21 treesize of output 10 [2018-04-13 11:55:17,220 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:17,224 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:17,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 11:55:17,231 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:109, output treesize:21 [2018-04-13 11:55:17,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:55:17,313 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 11:55:17,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 11:55:17,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 11:55:17,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 11:55:17,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-04-13 11:55:17,314 INFO L87 Difference]: Start difference. First operand 256 states and 283 transitions. Second operand 16 states. [2018-04-13 11:55:18,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:55:18,204 INFO L93 Difference]: Finished difference Result 278 states and 299 transitions. [2018-04-13 11:55:18,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 11:55:18,227 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2018-04-13 11:55:18,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:55:18,227 INFO L225 Difference]: With dead ends: 278 [2018-04-13 11:55:18,227 INFO L226 Difference]: Without dead ends: 278 [2018-04-13 11:55:18,228 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=289, Invalid=766, Unknown=1, NotChecked=0, Total=1056 [2018-04-13 11:55:18,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-04-13 11:55:18,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2018-04-13 11:55:18,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-13 11:55:18,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 282 transitions. [2018-04-13 11:55:18,230 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 282 transitions. Word has length 63 [2018-04-13 11:55:18,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:55:18,231 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 282 transitions. [2018-04-13 11:55:18,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 11:55:18,231 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 282 transitions. [2018-04-13 11:55:18,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-13 11:55:18,231 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:55:18,231 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:55:18,231 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:55:18,231 INFO L82 PathProgramCache]: Analyzing trace with hash 678337908, now seen corresponding path program 1 times [2018-04-13 11:55:18,231 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:55:18,231 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:55:18,232 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:55:18,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:55:18,232 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:55:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:55:18,239 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:55:18,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 11:55:18,284 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 11:55:18,284 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 11:55:18,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:55:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:55:18,307 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 11:55:18,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-04-13 11:55:18,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-13 11:55:18,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:18,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:18,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-13 11:55:18,368 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 12 treesize of output 4 [2018-04-13 11:55:18,369 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:18,370 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:18,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-04-13 11:55:18,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-13 11:55:18,378 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:18,381 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:18,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-13 11:55:18,386 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 12 treesize of output 4 [2018-04-13 11:55:18,386 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:18,387 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:18,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 11:55:18,389 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:47, output treesize:9 [2018-04-13 11:55:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 11:55:18,396 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 11:55:18,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2018-04-13 11:55:18,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 11:55:18,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 11:55:18,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-04-13 11:55:18,397 INFO L87 Difference]: Start difference. First operand 256 states and 282 transitions. Second operand 9 states. [2018-04-13 11:55:18,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:55:18,619 INFO L93 Difference]: Finished difference Result 285 states and 312 transitions. [2018-04-13 11:55:18,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 11:55:18,619 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-04-13 11:55:18,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:55:18,620 INFO L225 Difference]: With dead ends: 285 [2018-04-13 11:55:18,620 INFO L226 Difference]: Without dead ends: 285 [2018-04-13 11:55:18,620 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-04-13 11:55:18,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-04-13 11:55:18,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 264. [2018-04-13 11:55:18,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-04-13 11:55:18,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 288 transitions. [2018-04-13 11:55:18,624 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 288 transitions. Word has length 64 [2018-04-13 11:55:18,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:55:18,624 INFO L459 AbstractCegarLoop]: Abstraction has 264 states and 288 transitions. [2018-04-13 11:55:18,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 11:55:18,624 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 288 transitions. [2018-04-13 11:55:18,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-13 11:55:18,625 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:55:18,625 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:55:18,625 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:55:18,625 INFO L82 PathProgramCache]: Analyzing trace with hash -446313196, now seen corresponding path program 1 times [2018-04-13 11:55:18,625 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:55:18,625 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:55:18,626 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:55:18,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:55:18,628 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:55:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:55:18,637 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:55:18,640 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 11:55:18,641 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 11:55:18,641 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 11:55:18,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:55:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:55:18,670 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 11:55:18,703 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-13 11:55:18,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 11:55:18,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:18,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:18,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:18,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 [2018-04-13 11:55:18,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 41 [2018-04-13 11:55:18,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:18,751 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:55:18,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 43 [2018-04-13 11:55:18,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:18,765 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 25 treesize of output 24 [2018-04-13 11:55:18,765 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:18,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:18,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 11:55:18,776 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-04-13 11:55:18,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 46 treesize of output 67 [2018-04-13 11:55:18,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:18,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-04-13 11:55:18,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:18,996 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 36 treesize of output 35 [2018-04-13 11:55:18,996 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:19,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:19,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 11:55:19,016 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:38 [2018-04-13 11:55:19,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-04-13 11:55:19,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2018-04-13 11:55:19,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:19,135 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 18 treesize of output 11 [2018-04-13 11:55:19,135 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:19,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:19,143 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 23 treesize of output 13 [2018-04-13 11:55:19,143 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:19,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:19,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:19,149 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:3 [2018-04-13 11:55:19,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:55:19,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 11:55:19,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 11:55:19,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 11:55:19,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 11:55:19,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-04-13 11:55:19,176 INFO L87 Difference]: Start difference. First operand 264 states and 288 transitions. Second operand 16 states. [2018-04-13 11:55:19,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:55:19,802 INFO L93 Difference]: Finished difference Result 277 states and 297 transitions. [2018-04-13 11:55:19,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 11:55:19,803 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2018-04-13 11:55:19,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:55:19,803 INFO L225 Difference]: With dead ends: 277 [2018-04-13 11:55:19,803 INFO L226 Difference]: Without dead ends: 277 [2018-04-13 11:55:19,804 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=305, Invalid=687, Unknown=0, NotChecked=0, Total=992 [2018-04-13 11:55:19,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-04-13 11:55:19,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 266. [2018-04-13 11:55:19,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-04-13 11:55:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 290 transitions. [2018-04-13 11:55:19,819 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 290 transitions. Word has length 65 [2018-04-13 11:55:19,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:55:19,820 INFO L459 AbstractCegarLoop]: Abstraction has 266 states and 290 transitions. [2018-04-13 11:55:19,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 11:55:19,820 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 290 transitions. [2018-04-13 11:55:19,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-13 11:55:19,820 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:55:19,820 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:55:19,820 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:55:19,820 INFO L82 PathProgramCache]: Analyzing trace with hash -950806728, now seen corresponding path program 1 times [2018-04-13 11:55:19,820 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:55:19,820 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:55:19,822 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:55:19,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:55:19,822 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:55:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:55:19,830 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:55:19,860 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-13 11:55:19,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 11:55:19,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 11:55:19,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 11:55:19,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 11:55:19,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 11:55:19,862 INFO L87 Difference]: Start difference. First operand 266 states and 290 transitions. Second operand 4 states. [2018-04-13 11:55:19,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:55:19,931 INFO L93 Difference]: Finished difference Result 269 states and 292 transitions. [2018-04-13 11:55:19,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 11:55:19,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-04-13 11:55:19,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:55:19,932 INFO L225 Difference]: With dead ends: 269 [2018-04-13 11:55:19,932 INFO L226 Difference]: Without dead ends: 269 [2018-04-13 11:55:19,932 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 11:55:19,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-13 11:55:19,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 265. [2018-04-13 11:55:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-04-13 11:55:19,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 289 transitions. [2018-04-13 11:55:19,935 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 289 transitions. Word has length 66 [2018-04-13 11:55:19,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:55:19,936 INFO L459 AbstractCegarLoop]: Abstraction has 265 states and 289 transitions. [2018-04-13 11:55:19,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 11:55:19,936 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 289 transitions. [2018-04-13 11:55:19,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-13 11:55:19,936 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:55:19,937 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:55:19,937 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:55:19,937 INFO L82 PathProgramCache]: Analyzing trace with hash -2055850988, now seen corresponding path program 1 times [2018-04-13 11:55:19,937 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:55:19,937 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:55:19,938 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:55:19,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:55:19,938 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:55:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:55:19,945 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:55:19,964 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:55:19,964 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 11:55:19,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 11:55:19,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 11:55:19,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 11:55:19,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 11:55:19,965 INFO L87 Difference]: Start difference. First operand 265 states and 289 transitions. Second operand 4 states. [2018-04-13 11:55:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:55:19,992 INFO L93 Difference]: Finished difference Result 300 states and 322 transitions. [2018-04-13 11:55:19,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 11:55:19,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-04-13 11:55:19,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:55:19,993 INFO L225 Difference]: With dead ends: 300 [2018-04-13 11:55:19,993 INFO L226 Difference]: Without dead ends: 300 [2018-04-13 11:55:19,993 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 11:55:19,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-04-13 11:55:19,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 274. [2018-04-13 11:55:19,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-04-13 11:55:19,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 299 transitions. [2018-04-13 11:55:19,997 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 299 transitions. Word has length 66 [2018-04-13 11:55:19,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:55:19,998 INFO L459 AbstractCegarLoop]: Abstraction has 274 states and 299 transitions. [2018-04-13 11:55:19,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 11:55:19,998 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 299 transitions. [2018-04-13 11:55:19,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-13 11:55:19,998 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:55:19,999 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:55:19,999 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:55:19,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1468045743, now seen corresponding path program 1 times [2018-04-13 11:55:19,999 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:55:19,999 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:55:20,000 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:55:20,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:55:20,000 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:55:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:55:20,009 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:55:20,014 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 11:55:20,014 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 11:55:20,014 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 11:55:20,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:55:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:55:20,039 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 11:55:20,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:20,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:20,053 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-13 11:55:20,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:20,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:20,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-13 11:55:20,070 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-13 11:55:20,072 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-13 11:55:20,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:20,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:20,084 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-13 11:55:20,086 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-13 11:55:20,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:20,088 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:20,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:20,095 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:22 [2018-04-13 11:55:20,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:20,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2018-04-13 11:55:20,128 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-13 11:55:20,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:20,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:20,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-13 11:55:20,150 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-13 11:55:20,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:20,155 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:20,163 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-13 11:55:20,163 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:48 [2018-04-13 11:55:20,223 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-13 11:55:20,233 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-13 11:55:20,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 11:55:20,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 11:55:20,294 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 79 treesize of output 66 [2018-04-13 11:55:20,306 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-13 11:55:20,307 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-13 11:55:20,324 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 11:55:20,327 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 71 treesize of output 58 [2018-04-13 11:55:20,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-13 11:55:20,329 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:20,335 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:20,356 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-13 11:55:20,357 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:90, output treesize:131 [2018-04-13 11:55:20,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2018-04-13 11:55:20,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-04-13 11:55:20,465 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 11:55:20,474 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:55:20,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-13 11:55:20,474 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:20,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 11:55:20,494 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 40 treesize of output 34 [2018-04-13 11:55:20,496 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2018-04-13 11:55:20,496 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:20,502 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:55:20,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-13 11:55:20,502 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:20,506 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:20,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:20,512 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:88, output treesize:7 [2018-04-13 11:55:20,558 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:55:20,558 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 11:55:20,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 11:55:20,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 11:55:20,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 11:55:20,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-04-13 11:55:20,559 INFO L87 Difference]: Start difference. First operand 274 states and 299 transitions. Second operand 16 states. [2018-04-13 11:55:21,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:55:21,312 INFO L93 Difference]: Finished difference Result 270 states and 290 transitions. [2018-04-13 11:55:21,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 11:55:21,312 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2018-04-13 11:55:21,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:55:21,313 INFO L225 Difference]: With dead ends: 270 [2018-04-13 11:55:21,313 INFO L226 Difference]: Without dead ends: 270 [2018-04-13 11:55:21,313 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2018-04-13 11:55:21,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-04-13 11:55:21,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 266. [2018-04-13 11:55:21,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-04-13 11:55:21,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 286 transitions. [2018-04-13 11:55:21,316 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 286 transitions. Word has length 68 [2018-04-13 11:55:21,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:55:21,316 INFO L459 AbstractCegarLoop]: Abstraction has 266 states and 286 transitions. [2018-04-13 11:55:21,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 11:55:21,316 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 286 transitions. [2018-04-13 11:55:21,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-13 11:55:21,317 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:55:21,317 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:55:21,317 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:55:21,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1082274548, now seen corresponding path program 2 times [2018-04-13 11:55:21,317 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:55:21,317 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:55:21,318 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:55:21,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:55:21,318 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:55:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:55:21,326 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:55:21,330 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 11:55:21,330 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 11:55:21,330 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 11:55:21,331 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 11:55:21,359 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 11:55:21,359 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 11:55:21,362 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 11:55:21,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 11:55:21,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:21,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:21,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 11:55:21,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:21,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:21,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-13 11:55:21,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:21,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 11:55:21,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:21,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:21,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-13 11:55:21,430 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-13 11:55:21,432 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-13 11:55:21,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:21,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:21,446 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-13 11:55:21,448 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-13 11:55:21,448 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:21,450 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:21,459 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-13 11:55:21,459 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2018-04-13 11:55:21,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-04-13 11:55:21,484 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-13 11:55:21,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:21,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:21,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:21,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:37 [2018-04-13 11:55:21,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:21,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-04-13 11:55:21,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 11:55:21,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:21,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:21,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:21,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:38 [2018-04-13 11:55:21,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:21,594 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:55:21,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2018-04-13 11:55:21,622 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 14 treesize of output 19 [2018-04-13 11:55:21,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 11:55:21,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 11:55:21,652 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-13 11:55:21,653 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-13 11:55:21,653 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:21,654 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:21,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 11:55:21,670 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:72, output treesize:93 [2018-04-13 11:55:21,717 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 11:55:21,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:21,726 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 21 treesize of output 3 [2018-04-13 11:55:21,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:21,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 11:55:21,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:121, output treesize:51 [2018-04-13 11:55:21,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 45 [2018-04-13 11:55:21,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:21,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 21 [2018-04-13 11:55:21,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-13 11:55:21,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-13 11:55:21,860 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 11:55:21,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-13 11:55:21,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-04-13 11:55:21,923 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 1 case distinctions, treesize of input 11 treesize of output 8 [2018-04-13 11:55:21,924 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-13 11:55:21,929 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 11:55:21,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-04-13 11:55:21,933 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 11 treesize of output 4 [2018-04-13 11:55:21,933 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:21,936 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:21,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-04-13 11:55:21,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 11:55:21,940 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:21,943 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:21,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-13 11:55:21,966 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:76, output treesize:28 [2018-04-13 11:55:22,035 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:55:22,035 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 11:55:22,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 11:55:22,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 11:55:22,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 11:55:22,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-04-13 11:55:22,036 INFO L87 Difference]: Start difference. First operand 266 states and 286 transitions. Second operand 19 states. [2018-04-13 11:55:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:55:22,942 INFO L93 Difference]: Finished difference Result 275 states and 294 transitions. [2018-04-13 11:55:22,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 11:55:22,942 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 70 [2018-04-13 11:55:22,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:55:22,943 INFO L225 Difference]: With dead ends: 275 [2018-04-13 11:55:22,943 INFO L226 Difference]: Without dead ends: 275 [2018-04-13 11:55:22,943 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 11:55:22,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-13 11:55:22,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2018-04-13 11:55:22,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-04-13 11:55:22,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 281 transitions. [2018-04-13 11:55:22,946 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 281 transitions. Word has length 70 [2018-04-13 11:55:22,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:55:22,946 INFO L459 AbstractCegarLoop]: Abstraction has 261 states and 281 transitions. [2018-04-13 11:55:22,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 11:55:22,946 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 281 transitions. [2018-04-13 11:55:22,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-13 11:55:22,946 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:55:22,946 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:55:22,946 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:55:22,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1176212003, now seen corresponding path program 1 times [2018-04-13 11:55:22,947 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:55:22,947 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:55:22,947 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:55:22,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 11:55:22,947 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:55:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:55:22,953 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:55:22,965 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-13 11:55:22,966 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 11:55:22,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 11:55:22,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 11:55:22,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 11:55:22,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 11:55:22,966 INFO L87 Difference]: Start difference. First operand 261 states and 281 transitions. Second operand 3 states. [2018-04-13 11:55:22,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:55:22,981 INFO L93 Difference]: Finished difference Result 346 states and 372 transitions. [2018-04-13 11:55:22,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 11:55:22,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-04-13 11:55:22,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:55:22,982 INFO L225 Difference]: With dead ends: 346 [2018-04-13 11:55:22,982 INFO L226 Difference]: Without dead ends: 346 [2018-04-13 11:55:22,983 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 11:55:22,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-04-13 11:55:22,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 287. [2018-04-13 11:55:22,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-04-13 11:55:22,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 308 transitions. [2018-04-13 11:55:22,985 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 308 transitions. Word has length 70 [2018-04-13 11:55:22,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:55:22,985 INFO L459 AbstractCegarLoop]: Abstraction has 287 states and 308 transitions. [2018-04-13 11:55:22,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 11:55:22,985 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 308 transitions. [2018-04-13 11:55:22,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-13 11:55:22,986 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:55:22,986 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:55:22,986 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:55:22,986 INFO L82 PathProgramCache]: Analyzing trace with hash -2126794385, now seen corresponding path program 1 times [2018-04-13 11:55:22,986 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:55:22,986 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:55:22,987 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:55:22,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:55:22,987 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:55:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:55:22,994 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:55:22,997 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 11:55:22,997 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 11:55:22,997 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 11:55:22,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:55:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:55:23,037 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 11:55:23,064 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:23,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:23,066 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:23,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-04-13 11:55:23,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:23,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:23,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-13 11:55:23,095 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-13 11:55:23,097 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-13 11:55:23,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:23,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:23,119 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-13 11:55:23,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-13 11:55:23,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:23,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-04-13 11:55:23,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 11:55:23,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:23,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:23,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 11:55:23,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-04-13 11:55:23,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-04-13 11:55:23,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-13 11:55:23,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 11:55:23,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 11:55:23,279 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 2 xjuncts. [2018-04-13 11:55:23,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:82 [2018-04-13 11:55:23,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:23,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:23,307 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:23,307 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:23,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:23,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 51 [2018-04-13 11:55:23,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:23,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:23,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:52 [2018-04-13 11:55:23,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-13 11:55:23,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 11:55:23,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:23,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:23,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-04-13 11:55:23,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-13 11:55:23,360 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:23,365 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:23,383 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-13 11:55:23,383 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:76, output treesize:65 [2018-04-13 11:55:23,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 95 [2018-04-13 11:55:23,428 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 14 treesize of output 13 [2018-04-13 11:55:23,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:23,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:23,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2018-04-13 11:55:23,466 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-13 11:55:23,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:23,470 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:23,481 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-13 11:55:23,481 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:107, output treesize:91 [2018-04-13 11:55:23,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 150 [2018-04-13 11:55:23,585 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 36 treesize of output 59 [2018-04-13 11:55:23,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 11:55:23,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 11:55:23,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 137 [2018-04-13 11:55:23,673 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 32 treesize of output 37 [2018-04-13 11:55:23,674 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:23,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:23,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 145 [2018-04-13 11:55:23,697 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 32 treesize of output 55 [2018-04-13 11:55:23,697 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-13 11:55:23,716 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 11:55:23,752 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-13 11:55:23,753 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:197, output treesize:287 [2018-04-13 11:55:23,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 71 [2018-04-13 11:55:23,825 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 5 [2018-04-13 11:55:23,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:23,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-13 11:55:23,834 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:23,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-13 11:55:23,839 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:23,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:23,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 11:55:23,850 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:138, output treesize:89 [2018-04-13 11:55:23,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 50 [2018-04-13 11:55:23,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-13 11:55:23,906 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 11:55:23,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-04-13 11:55:23,911 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:23,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 11:55:23,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 11:55:23,921 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:86, output treesize:28 [2018-04-13 11:55:23,962 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:55:23,963 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 11:55:23,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 11:55:23,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 11:55:23,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 11:55:23,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=416, Unknown=1, NotChecked=0, Total=506 [2018-04-13 11:55:23,963 INFO L87 Difference]: Start difference. First operand 287 states and 308 transitions. Second operand 23 states. [2018-04-13 11:55:24,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:55:24,961 INFO L93 Difference]: Finished difference Result 367 states and 394 transitions. [2018-04-13 11:55:24,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 11:55:24,962 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2018-04-13 11:55:24,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:55:24,963 INFO L225 Difference]: With dead ends: 367 [2018-04-13 11:55:24,963 INFO L226 Difference]: Without dead ends: 367 [2018-04-13 11:55:24,963 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=321, Invalid=1657, Unknown=2, NotChecked=0, Total=1980 [2018-04-13 11:55:24,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-04-13 11:55:24,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 323. [2018-04-13 11:55:24,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-04-13 11:55:24,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 346 transitions. [2018-04-13 11:55:24,967 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 346 transitions. Word has length 70 [2018-04-13 11:55:24,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:55:24,968 INFO L459 AbstractCegarLoop]: Abstraction has 323 states and 346 transitions. [2018-04-13 11:55:24,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 11:55:24,968 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 346 transitions. [2018-04-13 11:55:24,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-13 11:55:24,968 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:55:24,969 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:55:24,969 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 11:55:24,969 INFO L82 PathProgramCache]: Analyzing trace with hash -2126794384, now seen corresponding path program 1 times [2018-04-13 11:55:24,969 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:55:24,969 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:55:24,970 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:55:24,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:55:24,970 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:55:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:55:24,981 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:55:24,985 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 11:55:24,985 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 11:55:24,985 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 11:55:24,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:55:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:55:25,034 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 11:55:25,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 11:55:25,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,071 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:25,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:25,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-13 11:55:25,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-13 11:55:25,095 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-13 11:55:25,096 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-13 11:55:25,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,111 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-13 11:55:25,112 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-13 11:55:25,112 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,114 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,123 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-13 11:55:25,123 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:48 [2018-04-13 11:55:25,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:25,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2018-04-13 11:55:25,162 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 18 treesize of output 17 [2018-04-13 11:55:25,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 54 [2018-04-13 11:55:25,189 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 18 treesize of output 17 [2018-04-13 11:55:25,189 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,194 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,204 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:98, output treesize:82 [2018-04-13 11:55:25,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:25,262 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:55:25,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 102 [2018-04-13 11:55:25,271 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:25,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 63 [2018-04-13 11:55:25,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 77 [2018-04-13 11:55:25,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:25,307 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:55:25,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 60 [2018-04-13 11:55:25,307 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,316 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,328 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:159, output treesize:110 [2018-04-13 11:55:25,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:25,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-13 11:55:25,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:25,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:25,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:25,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2018-04-13 11:55:25,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:121, output treesize:113 [2018-04-13 11:55:25,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:25,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 98 [2018-04-13 11:55:25,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:25,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 57 [2018-04-13 11:55:25,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:25,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 96 [2018-04-13 11:55:25,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:25,454 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:55:25,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 92 [2018-04-13 11:55:25,456 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,467 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,481 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:140, output treesize:120 [2018-04-13 11:55:25,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:25,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:25,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:25,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 138 [2018-04-13 11:55:25,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 11:55:25,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:25,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:25,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:25,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 134 [2018-04-13 11:55:25,582 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 14 treesize of output 13 [2018-04-13 11:55:25,582 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,595 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,609 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-13 11:55:25,609 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:162, output treesize:132 [2018-04-13 11:55:25,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:25,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 201 [2018-04-13 11:55:25,733 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:55:25,734 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 32 treesize of output 48 [2018-04-13 11:55:25,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:55:25,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:25,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:25,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 179 [2018-04-13 11:55:25,779 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 32 treesize of output 51 [2018-04-13 11:55:25,779 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-13 11:55:25,799 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 11:55:25,838 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-13 11:55:25,838 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:240, output treesize:367 [2018-04-13 11:55:51,934 WARN L148 SmtUtils]: Spent 26059ms on a formula simplification that was a NOOP. DAG size: 62 [2018-04-13 11:55:51,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:51,961 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 223 treesize of output 217 [2018-04-13 11:55:51,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:52,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:55:52,015 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 181 treesize of output 175 [2018-04-13 11:55:52,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:55:52,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-13 11:55:52,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:405, output treesize:377 [2018-04-13 11:56:20,147 WARN L148 SmtUtils]: Spent 28060ms on a formula simplification that was a NOOP. DAG size: 62 [2018-04-13 11:56:46,240 WARN L148 SmtUtils]: Spent 26056ms on a formula simplification that was a NOOP. DAG size: 60 [2018-04-13 11:56:46,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:56:46,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:56:46,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 137 [2018-04-13 11:56:46,250 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-13 11:56:46,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:56:46,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 39 [2018-04-13 11:56:46,270 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 11:56:46,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 35 [2018-04-13 11:56:46,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:56:46,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 11:56:46,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 55 [2018-04-13 11:56:46,323 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 22 treesize of output 11 [2018-04-13 11:56:46,323 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 11:56:46,333 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-13 11:56:46,333 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 11:56:46,340 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-13 11:56:46,340 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 11:56:46,345 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:56:46,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:56:46,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 181 [2018-04-13 11:56:46,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:56:46,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-13 11:56:46,375 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 11:56:46,390 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 1 [2018-04-13 11:56:46,390 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 11:56:46,402 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 113 treesize of output 94 [2018-04-13 11:56:46,402 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 11:56:46,412 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:56:46,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:56:46,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:56:46,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 79 [2018-04-13 11:56:46,442 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 46 [2018-04-13 11:56:46,443 INFO L267 ElimStorePlain]: Start of recursive call 15: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-13 11:56:46,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2018-04-13 11:56:46,477 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-13 11:56:46,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 72 [2018-04-13 11:56:46,482 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-04-13 11:56:46,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:56:46,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 62 [2018-04-13 11:56:46,485 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-13 11:56:46,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 39 [2018-04-13 11:56:46,520 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-13 11:56:46,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, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 33 [2018-04-13 11:56:46,521 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-13 11:56:46,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 37 [2018-04-13 11:56:46,522 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-13 11:56:46,545 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-13 11:56:46,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-13 11:56:46,573 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 9 variables, input treesize:387, output treesize:89 [2018-04-13 11:56:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:56:46,655 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 11:56:46,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 11:56:46,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 11:56:46,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 11:56:46,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2018-04-13 11:56:46,656 INFO L87 Difference]: Start difference. First operand 323 states and 346 transitions. Second operand 23 states. [2018-04-13 11:57:39,750 WARN L151 SmtUtils]: Spent 52154ms on a formula simplification. DAG size of input: 67 DAG size of output 67 [2018-04-13 11:58:44,113 WARN L151 SmtUtils]: Spent 64185ms on a formula simplification. DAG size of input: 74 DAG size of output 71 [2018-04-13 11:59:44,308 WARN L151 SmtUtils]: Spent 60167ms on a formula simplification. DAG size of input: 72 DAG size of output 69 [2018-04-13 12:00:44,554 WARN L151 SmtUtils]: Spent 60192ms on a formula simplification. DAG size of input: 86 DAG size of output 76 [2018-04-13 12:01:40,766 WARN L151 SmtUtils]: Spent 56143ms on a formula simplification. DAG size of input: 91 DAG size of output 79 [2018-04-13 12:01:41,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 12:01:41,059 INFO L93 Difference]: Finished difference Result 366 states and 393 transitions. [2018-04-13 12:01:41,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 12:01:41,060 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2018-04-13 12:01:41,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 12:01:41,060 INFO L225 Difference]: With dead ends: 366 [2018-04-13 12:01:41,060 INFO L226 Difference]: Without dead ends: 366 [2018-04-13 12:01:41,061 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 374.3s TimeCoverageRelationStatistics Valid=335, Invalid=1735, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 12:01:41,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-04-13 12:01:41,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 323. [2018-04-13 12:01:41,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-04-13 12:01:41,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 345 transitions. [2018-04-13 12:01:41,064 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 345 transitions. Word has length 70 [2018-04-13 12:01:41,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 12:01:41,064 INFO L459 AbstractCegarLoop]: Abstraction has 323 states and 345 transitions. [2018-04-13 12:01:41,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 12:01:41,064 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 345 transitions. [2018-04-13 12:01:41,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-04-13 12:01:41,065 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 12:01:41,065 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 12:01:41,065 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 12:01:41,065 INFO L82 PathProgramCache]: Analyzing trace with hash 809226236, now seen corresponding path program 2 times [2018-04-13 12:01:41,065 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 12:01:41,065 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 12:01:41,066 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 12:01:41,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 12:01:41,066 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 12:01:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 12:01:41,075 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 12:01:41,077 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 12:01:41,077 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 12:01:41,078 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 12:01:41,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 12:01:41,105 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 12:01:41,105 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 12:01:41,108 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 12:01: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, 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-13 12:01:41,169 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-13 12:01:41,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 12:01:41,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:01:41,178 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-13 12:01:41,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:37 [2018-04-13 12:01:41,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:01:41,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 54 [2018-04-13 12:01:41,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 12:01:41,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 12:01:41,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:01:41,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 12:01:41,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-04-13 12:01:41,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:01:41,320 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 58 treesize of output 56 [2018-04-13 12:01:41,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-13 12:01:41,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 12:01:41,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 12:01:41,355 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-13 12:01:41,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:100 [2018-04-13 12:01:55,390 WARN L148 SmtUtils]: Spent 14021ms on a formula simplification that was a NOOP. DAG size: 35 [2018-04-13 12:02:11,464 WARN L148 SmtUtils]: Spent 16032ms on a formula simplification that was a NOOP. DAG size: 37 [2018-04-13 12:02:11,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:02:11,468 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 62 treesize of output 50 [2018-04-13 12:02:11,469 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 33 treesize of output 22 [2018-04-13 12:02:11,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 12:02:11,478 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-13 12:02:11,478 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 12:02:11,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 12:02:11,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:02:11,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 51 treesize of output 45 [2018-04-13 12:02:11,502 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-13 12:02:11,502 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 12:02:11,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2018-04-13 12:02:11,508 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 12:02:11,510 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:02:11,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:02:11,517 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:114, output treesize:23 [2018-04-13 12:02:11,824 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 12:02:11,824 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 12:02:11,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 12:02:11,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 12:02:11,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 12:02:11,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=270, Unknown=30, NotChecked=0, Total=342 [2018-04-13 12:02:11,825 INFO L87 Difference]: Start difference. First operand 323 states and 345 transitions. Second operand 19 states. [2018-04-13 12:02:40,231 WARN L151 SmtUtils]: Spent 28056ms on a formula simplification. DAG size of input: 44 DAG size of output 40 [2018-04-13 12:03:04,634 WARN L151 SmtUtils]: Spent 24059ms on a formula simplification. DAG size of input: 44 DAG size of output 39 [2018-04-13 12:03:24,736 WARN L151 SmtUtils]: Spent 20051ms on a formula simplification. DAG size of input: 52 DAG size of output 43 [2018-04-13 12:03:25,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 12:03:25,053 INFO L93 Difference]: Finished difference Result 334 states and 355 transitions. [2018-04-13 12:03:25,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 12:03:25,053 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 71 [2018-04-13 12:03:25,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 12:03:25,054 INFO L225 Difference]: With dead ends: 334 [2018-04-13 12:03:25,054 INFO L226 Difference]: Without dead ends: 285 [2018-04-13 12:03:25,055 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 102.9s TimeCoverageRelationStatistics Valid=107, Invalid=725, Unknown=38, NotChecked=0, Total=870 [2018-04-13 12:03:25,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-04-13 12:03:25,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-04-13 12:03:25,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-04-13 12:03:25,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 305 transitions. [2018-04-13 12:03:25,058 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 305 transitions. Word has length 71 [2018-04-13 12:03:25,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 12:03:25,059 INFO L459 AbstractCegarLoop]: Abstraction has 285 states and 305 transitions. [2018-04-13 12:03:25,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 12:03:25,059 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 305 transitions. [2018-04-13 12:03:25,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-13 12:03:25,060 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 12:03:25,060 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 12:03:25,060 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 12:03:25,060 INFO L82 PathProgramCache]: Analyzing trace with hash -855508223, now seen corresponding path program 1 times [2018-04-13 12:03:25,060 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 12:03:25,060 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 12:03:25,061 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 12:03:25,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 12:03:25,061 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 12:03:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 12:03:25,070 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 12:03:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-13 12:03:25,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 12:03:25,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 12:03:25,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 12:03:25,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 12:03:25,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 12:03:25,109 INFO L87 Difference]: Start difference. First operand 285 states and 305 transitions. Second operand 6 states. [2018-04-13 12:03:25,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 12:03:25,243 INFO L93 Difference]: Finished difference Result 331 states and 357 transitions. [2018-04-13 12:03:25,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 12:03:25,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-04-13 12:03:25,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 12:03:25,244 INFO L225 Difference]: With dead ends: 331 [2018-04-13 12:03:25,244 INFO L226 Difference]: Without dead ends: 331 [2018-04-13 12:03:25,244 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-04-13 12:03:25,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-04-13 12:03:25,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 294. [2018-04-13 12:03:25,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-04-13 12:03:25,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 318 transitions. [2018-04-13 12:03:25,247 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 318 transitions. Word has length 82 [2018-04-13 12:03:25,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 12:03:25,248 INFO L459 AbstractCegarLoop]: Abstraction has 294 states and 318 transitions. [2018-04-13 12:03:25,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 12:03:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 318 transitions. [2018-04-13 12:03:25,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-13 12:03:25,248 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 12:03:25,249 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 12:03:25,249 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 12:03:25,249 INFO L82 PathProgramCache]: Analyzing trace with hash -855508222, now seen corresponding path program 1 times [2018-04-13 12:03:25,249 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 12:03:25,249 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 12:03:25,250 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 12:03:25,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 12:03:25,250 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 12:03:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 12:03:25,263 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 12:03:25,268 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 12:03:25,268 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 12:03:25,268 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 12:03:25,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 12:03:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 12:03:25,329 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 12:03:25,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 12:03:25,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:25,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:03:25,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:03:25,373 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-13 12:03:25,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:25,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:03:25,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-13 12:03:25,394 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-13 12:03:25,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 12:03:25,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:25,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:03:25,418 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-13 12:03:25,420 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-13 12:03:25,420 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:25,421 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:03:25,431 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-13 12:03:25,431 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-04-13 12:03:25,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:03:25,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2018-04-13 12:03:25,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 12:03:25,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:25,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:03:25,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-13 12:03:25,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 12:03:25,504 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:25,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:03:25,529 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-13 12:03:25,529 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:81, output treesize:65 [2018-04-13 12:03:25,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 49 [2018-04-13 12:03:25,626 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 12:03:25,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-04-13 12:03:25,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:25,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:03:25,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 64 [2018-04-13 12:03:25,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-13 12:03:25,675 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-13 12:03:25,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 12:03:25,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 12:03:25,741 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:103, output treesize:169 [2018-04-13 12:03:25,820 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:03:25,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-13 12:03:25,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:25,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:03:25,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:03:25,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:03:25,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:03:25,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:03:25,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 51 [2018-04-13 12:03:25,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:25,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:03:25,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:91 [2018-04-13 12:03:25,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-04-13 12:03:25,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:25,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2018-04-13 12:03:25,921 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 18 treesize of output 11 [2018-04-13 12:03:25,921 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:25,926 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:03:25,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:03:25,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2018-04-13 12:03:25,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-04-13 12:03:25,943 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:25,948 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:03:25,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:03:25,958 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:118, output treesize:62 [2018-04-13 12:03:25,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-04-13 12:03:25,998 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-13 12:03:25,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:26,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:03:26,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:03:26,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:03:26,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 84 [2018-04-13 12:03:26,021 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 14 treesize of output 13 [2018-04-13 12:03:26,021 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:26,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:03:26,040 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-13 12:03:26,040 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:104, output treesize:88 [2018-04-13 12:03:26,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:03:26,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:03:26,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 120 [2018-04-13 12:03:26,165 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 28 treesize of output 43 [2018-04-13 12:03:26,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 12:03:26,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 12:03:26,219 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 12:03:26,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 113 [2018-04-13 12:03:26,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-04-13 12:03:26,221 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:26,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:03:26,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 124 [2018-04-13 12:03:26,238 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 12:03:26,238 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 24 treesize of output 36 [2018-04-13 12:03:26,238 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:26,250 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:03:26,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-13 12:03:26,278 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:163, output treesize:225 [2018-04-13 12:03:46,361 WARN L148 SmtUtils]: Spent 20056ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-13 12:03:46,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:03:46,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:03:46,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 97 [2018-04-13 12:03:46,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 12:03:46,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 12:03:46,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2018-04-13 12:03:46,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 12:03:46,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 17 [2018-04-13 12:03:46,445 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:46,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-04-13 12:03:46,446 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:46,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 12:03:46,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2018-04-13 12:03:46,506 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-13 12:03:46,506 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:46,514 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-13 12:03:46,514 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:46,519 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:03:46,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2018-04-13 12:03:46,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-13 12:03:46,523 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:46,530 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-13 12:03:46,530 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:46,535 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:03:46,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 92 [2018-04-13 12:03:46,566 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-13 12:03:46,566 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:46,574 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-13 12:03:46,575 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:46,581 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:03:46,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:03:46,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:03:46,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 59 [2018-04-13 12:03:46,608 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-13 12:03:46,608 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:46,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-13 12:03:46,614 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 12:03:46,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-04-13 12:03:46,622 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-13 12:03:46,629 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 12:03:46,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-13 12:03:46,661 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 9 variables, input treesize:247, output treesize:58 [2018-04-13 12:03:46,789 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 12:03:46,789 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 12:03:46,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-13 12:03:46,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 12:03:46,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 12:03:46,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-04-13 12:03:46,790 INFO L87 Difference]: Start difference. First operand 294 states and 318 transitions. Second operand 22 states. [2018-04-13 12:04:27,647 WARN L151 SmtUtils]: Spent 40108ms on a formula simplification. DAG size of input: 59 DAG size of output 59 [2018-04-13 12:05:07,918 WARN L151 SmtUtils]: Spent 40135ms on a formula simplification. DAG size of input: 71 DAG size of output 64 [2018-04-13 12:05:48,107 WARN L151 SmtUtils]: Spent 40159ms on a formula simplification. DAG size of input: 70 DAG size of output 63 [2018-04-13 12:06:20,254 WARN L151 SmtUtils]: Spent 32113ms on a formula simplification. DAG size of input: 69 DAG size of output 63 [2018-04-13 12:06:20,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 12:06:20,511 INFO L93 Difference]: Finished difference Result 344 states and 375 transitions. [2018-04-13 12:06:20,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 12:06:20,511 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 82 [2018-04-13 12:06:20,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 12:06:20,512 INFO L225 Difference]: With dead ends: 344 [2018-04-13 12:06:20,512 INFO L226 Difference]: Without dead ends: 344 [2018-04-13 12:06:20,513 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 173.6s TimeCoverageRelationStatistics Valid=311, Invalid=1581, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 12:06:20,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-04-13 12:06:20,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 310. [2018-04-13 12:06:20,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-04-13 12:06:20,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 337 transitions. [2018-04-13 12:06:20,515 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 337 transitions. Word has length 82 [2018-04-13 12:06:20,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 12:06:20,515 INFO L459 AbstractCegarLoop]: Abstraction has 310 states and 337 transitions. [2018-04-13 12:06:20,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 12:06:20,515 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 337 transitions. [2018-04-13 12:06:20,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-13 12:06:20,515 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 12:06:20,515 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 12:06:20,515 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 12:06:20,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1105727035, now seen corresponding path program 1 times [2018-04-13 12:06:20,516 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 12:06:20,516 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 12:06:20,516 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 12:06:20,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 12:06:20,516 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 12:06:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 12:06:20,523 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 12:06:20,525 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 12:06:20,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 12:06:20,525 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 12:06:20,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 12:06:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 12:06:20,565 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 12:06:20,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 12:06:20,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 12:06:20,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:06:20,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:06:20,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 12:06:20,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 12:06:20,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:06:20,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-13 12:06:20,614 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-13 12:06:20,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 12:06:20,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 12:06:20,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:06:20,648 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-13 12:06:20,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:41 [2018-04-13 12:06:20,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:06:20,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-04-13 12:06:20,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 12:06:20,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 12:06:20,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:06:20,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 12:06:20,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2018-04-13 12:06:20,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2018-04-13 12:06:20,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-13 12:06:20,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 12:06:20,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 12:06:20,827 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 2 xjuncts. [2018-04-13 12:06:20,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:100 [2018-04-13 12:06:20,867 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 17 treesize of output 11 [2018-04-13 12:06:20,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 12:06:20,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:06:20,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:39 [2018-04-13 12:06:20,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:06:20,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:06:20,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:06:20,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:06:20,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-04-13 12:06:20,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 12:06:20,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:06:20,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:40 [2018-04-13 12:06:20,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-13 12:06:20,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 12:06:20,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 12:06:20,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:06:20,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-04-13 12:06:20,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-13 12:06:20,970 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 12:06:20,973 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:06:20,982 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-13 12:06:20,982 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:54 [2018-04-13 12:06:21,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 86 [2018-04-13 12:06:21,027 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 14 treesize of output 13 [2018-04-13 12:06:21,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 12:06:21,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:06:21,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 52 [2018-04-13 12:06:21,059 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-13 12:06:21,059 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 12:06:21,064 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 12:06:21,077 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-13 12:06:21,077 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:112, output treesize:100 [2018-04-13 12:06:21,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 168 treesize of output 174 [2018-04-13 12:06:21,194 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-13 12:06:21,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 12:06:21,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 193 [2018-04-13 12:06:21,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. Received shutdown request... [2018-04-13 12:06:25,804 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-13 12:06:25,805 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-13 12:06:25,808 WARN L197 ceAbstractionStarter]: Timeout [2018-04-13 12:06:25,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 12:06:25 BoogieIcfgContainer [2018-04-13 12:06:25,809 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 12:06:25,809 INFO L168 Benchmark]: Toolchain (without parser) took 870092.00 ms. Allocated memory was 402.1 MB in the beginning and 693.1 MB in the end (delta: 291.0 MB). Free memory was 335.0 MB in the beginning and 565.3 MB in the end (delta: -230.4 MB). Peak memory consumption was 234.3 MB. Max. memory is 5.3 GB. [2018-04-13 12:06:25,810 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 402.1 MB. Free memory is still 361.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 12:06:25,810 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.30 ms. Allocated memory is still 402.1 MB. Free memory was 333.6 MB in the beginning and 305.8 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. [2018-04-13 12:06:25,810 INFO L168 Benchmark]: Boogie Preprocessor took 42.26 ms. Allocated memory is still 402.1 MB. Free memory was 305.8 MB in the beginning and 303.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-13 12:06:25,811 INFO L168 Benchmark]: RCFGBuilder took 516.29 ms. Allocated memory was 402.1 MB in the beginning and 608.2 MB in the end (delta: 206.0 MB). Free memory was 303.1 MB in the beginning and 517.8 MB in the end (delta: -214.6 MB). Peak memory consumption was 24.2 MB. Max. memory is 5.3 GB. [2018-04-13 12:06:25,811 INFO L168 Benchmark]: TraceAbstraction took 869280.80 ms. Allocated memory was 608.2 MB in the beginning and 693.1 MB in the end (delta: 84.9 MB). Free memory was 517.8 MB in the beginning and 565.3 MB in the end (delta: -47.5 MB). Peak memory consumption was 211.1 MB. Max. memory is 5.3 GB. [2018-04-13 12:06:25,811 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.19 ms. Allocated memory is still 402.1 MB. Free memory is still 361.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 250.30 ms. Allocated memory is still 402.1 MB. Free memory was 333.6 MB in the beginning and 305.8 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.26 ms. Allocated memory is still 402.1 MB. Free memory was 305.8 MB in the beginning and 303.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 516.29 ms. Allocated memory was 402.1 MB in the beginning and 608.2 MB in the end (delta: 206.0 MB). Free memory was 303.1 MB in the beginning and 517.8 MB in the end (delta: -214.6 MB). Peak memory consumption was 24.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 869280.80 ms. Allocated memory was 608.2 MB in the beginning and 693.1 MB in the end (delta: 84.9 MB). Free memory was 517.8 MB in the beginning and 565.3 MB in the end (delta: -47.5 MB). Peak memory consumption was 211.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1045]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1045). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1007]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1035]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1053). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 983]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 983). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 997]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1045]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1045). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1035]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1052). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 997]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1053). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1052). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1044]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1007]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1044]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 213. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 174 locations, 61 error locations. TIMEOUT Result, 869.2s OverallTime, 32 OverallIterations, 3 TraceHistogramMax, 661.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3919 SDtfs, 9936 SDslu, 15960 SDs, 0 SdLazy, 12248 SolverSat, 588 SolverUnsat, 52 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1369 GetRequests, 835 SyntacticMatches, 7 SemanticMatches, 527 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2618 ImplicationChecksByTransitivity, 847.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=323occurred in iteration=27, 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, 31 MinimizatonAttempts, 1046 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 201.2s InterpolantComputationTime, 2543 NumberOfCodeBlocks, 2543 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 1531 ConstructedInterpolants, 452 QuantifiedInterpolants, 3858709 SizeOfPredicates, 240 NumberOfNonLiveVariables, 3664 ConjunctsInSsa, 622 ConjunctsInUnsatCore, 33 InterpolantComputations, 17 PerfectInterpolantSequences, 94/236 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-queue_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_12-06-25-817.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-queue_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_12-06-25-817.csv Completed graceful shutdown