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/sll-optional_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 17:47:49,879 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 17:47:49,881 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 17:47:49,893 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 17:47:49,893 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 17:47:49,894 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 17:47:49,895 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 17:47:49,896 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 17:47:49,898 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 17:47:49,899 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 17:47:49,900 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 17:47:49,900 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 17:47:49,901 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 17:47:49,902 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 17:47:49,902 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 17:47:49,904 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 17:47:49,905 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 17:47:49,907 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 17:47:49,908 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 17:47:49,909 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 17:47:49,910 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 17:47:49,910 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 17:47:49,911 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 17:47:49,911 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 17:47:49,912 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 17:47:49,913 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 17:47:49,913 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 17:47:49,914 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 17:47:49,914 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 17:47:49,914 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 17:47:49,915 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 17:47:49,915 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-11 17:47:49,935 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 17:47:49,936 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 17:47:49,937 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 17:47:49,937 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 17:47:49,937 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 17:47:49,937 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 17:47:49,937 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 17:47:49,937 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 17:47:49,937 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 17:47:49,937 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 17:47:49,937 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 17:47:49,938 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 17:47:49,938 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 17:47:49,938 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 17:47:49,938 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 17:47:49,938 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 17:47:49,938 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 17:47:49,938 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 17:47:49,938 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 17:47:49,938 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 17:47:49,939 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 17:47:49,939 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 17:47:49,939 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 17:47:49,939 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 17:47:49,966 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 17:47:49,975 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 17:47:49,978 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 17:47:49,980 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 17:47:49,980 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 17:47:49,981 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,278 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG351ccfd13 [2018-04-11 17:47:50,421 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 17:47:50,421 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 17:47:50,421 INFO L168 CDTParser]: Scanning sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,426 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 17:47:50,426 INFO L215 ultiparseSymbolTable]: [2018-04-11 17:47:50,426 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 17:47:50,426 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,426 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 17:47:50,426 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,427 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____uint64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,427 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____uid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,427 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__ssize_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,427 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fsword_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,427 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_once_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,427 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,427 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__off_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,427 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____int8_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,427 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__timer_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,427 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__register_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,427 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____nlink_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,427 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,427 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_int64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,427 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__ino_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,427 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____useconds_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,427 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,427 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__loff_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,427 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__wchar_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fd_mask in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__ldiv_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_int8_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____int64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____uint8_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____key_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____time_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____timer_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__int8_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____daddr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__fd_mask in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__ushort in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____blkcnt_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____int32_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__clockid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__time_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____ssize_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__idtype_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__key_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__uint in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__id_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__int32_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____u_int in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____off_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__nlink_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__dev_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____ino64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__sigset_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_int32_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_quad_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__ulong in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_char in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____caddr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__blkcnt_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_key_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__lldiv_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____dev_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__uid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__int16_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____uint16_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__daddr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____id_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____gid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____blksize_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____u_char in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____off64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____suseconds_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____quad_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____qaddr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_int in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____rlim64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____pid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____u_short in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__int64_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____sigset_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__suseconds_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____loff_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____rlim_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__size_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__fsid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_int16_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____u_quad_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____clock_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____intptr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____clockid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_long in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__quad_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__mode_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____socklen_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____uint32_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__clock_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__fd_set in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__gid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____fsid_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____int16_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__div_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__SLL in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____u_long in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__u_short in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__caddr_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____mode_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i__blksize_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_optional_true_unreach_call_true_valid_memsafety_i____ino_t in sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:50,445 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG351ccfd13 [2018-04-11 17:47:50,449 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 17:47:50,450 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 17:47:50,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 17:47:50,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 17:47:50,456 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 17:47:50,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 05:47:50" (1/1) ... [2018-04-11 17:47:50,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@588e8c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:47:50, skipping insertion in model container [2018-04-11 17:47:50,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 05:47:50" (1/1) ... [2018-04-11 17:47:50,470 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 17:47:50,496 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 17:47:50,628 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 17:47:50,664 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 17:47:50,670 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-11 17:47:50,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:47:50 WrapperNode [2018-04-11 17:47:50,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 17:47:50,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 17:47:50,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 17:47:50,708 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 17:47:50,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:47:50" (1/1) ... [2018-04-11 17:47:50,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:47:50" (1/1) ... [2018-04-11 17:47:50,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:47:50" (1/1) ... [2018-04-11 17:47:50,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:47:50" (1/1) ... [2018-04-11 17:47:50,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:47:50" (1/1) ... [2018-04-11 17:47:50,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:47:50" (1/1) ... [2018-04-11 17:47:50,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:47:50" (1/1) ... [2018-04-11 17:47:50,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 17:47:50,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 17:47:50,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 17:47:50,750 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 17:47:50,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:47:50" (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-11 17:47:50,829 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 17:47:50,829 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 17:47:50,829 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 17:47:50,830 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 17:47:50,830 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 17:47:50,830 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 17:47:50,830 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 17:47:50,830 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 17:47:50,830 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 17:47:50,830 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 17:47:50,830 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 17:47:50,831 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 17:47:50,831 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 17:47:50,831 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 17:47:50,831 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 17:47:50,831 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 17:47:50,831 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 17:47:50,831 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 17:47:50,832 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 17:47:50,832 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 17:47:50,832 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 17:47:50,832 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 17:47:50,832 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 17:47:50,832 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 17:47:50,832 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 17:47:50,832 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 17:47:50,832 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 17:47:50,832 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 17:47:50,832 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 17:47:50,833 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 17:47:50,833 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 17:47:50,833 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 17:47:50,833 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 17:47:50,833 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 17:47:50,833 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 17:47:50,833 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 17:47:50,833 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 17:47:50,834 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 17:47:50,834 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 17:47:50,834 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 17:47:50,834 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 17:47:50,834 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 17:47:50,834 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 17:47:50,834 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 17:47:50,834 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 17:47:50,834 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 17:47:50,835 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 17:47:50,835 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 17:47:50,835 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 17:47:50,835 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 17:47:50,835 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 17:47:50,835 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 17:47:50,835 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 17:47:50,835 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 17:47:50,835 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 17:47:50,835 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 17:47:50,836 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 17:47:50,836 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 17:47:50,836 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 17:47:50,836 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 17:47:50,836 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 17:47:50,836 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-11 17:47:50,836 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 17:47:50,836 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 17:47:50,836 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-11 17:47:50,837 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 17:47:50,837 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 17:47:50,837 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-11 17:47:50,837 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 17:47:50,837 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 17:47:50,837 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 17:47:50,837 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 17:47:50,837 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 17:47:50,837 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 17:47:50,837 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 17:47:50,838 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 17:47:50,838 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 17:47:50,838 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 17:47:50,838 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 17:47:50,838 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 17:47:50,838 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 17:47:50,838 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 17:47:50,838 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 17:47:50,838 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 17:47:50,838 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 17:47:50,838 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 17:47:50,838 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 17:47:50,838 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 17:47:50,838 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 17:47:50,839 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 17:47:50,839 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 17:47:50,839 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 17:47:50,839 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 17:47:50,839 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 17:47:50,839 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 17:47:50,839 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 17:47:50,839 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 17:47:50,839 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 17:47:50,839 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 17:47:50,839 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 17:47:50,840 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 17:47:50,840 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 17:47:50,840 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 17:47:50,840 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 17:47:50,840 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 17:47:50,840 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 17:47:50,840 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 17:47:50,840 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 17:47:50,840 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 17:47:50,841 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 17:47:50,841 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 17:47:50,841 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 17:47:50,841 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 17:47:50,841 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 17:47:50,841 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 17:47:50,841 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 17:47:50,841 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 17:47:50,841 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 17:47:51,263 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 17:47:51,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 05:47:51 BoogieIcfgContainer [2018-04-11 17:47:51,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 17:47:51,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 17:47:51,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 17:47:51,265 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 17:47:51,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 05:47:50" (1/3) ... [2018-04-11 17:47:51,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1eae2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 05:47:51, skipping insertion in model container [2018-04-11 17:47:51,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:47:50" (2/3) ... [2018-04-11 17:47:51,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1eae2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 05:47:51, skipping insertion in model container [2018-04-11 17:47:51,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 05:47:51" (3/3) ... [2018-04-11 17:47:51,268 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-optional_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:47:51,274 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 17:47:51,280 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 63 error locations. [2018-04-11 17:47:51,305 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 17:47:51,305 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 17:47:51,305 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 17:47:51,305 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 17:47:51,305 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 17:47:51,305 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 17:47:51,306 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 17:47:51,306 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 17:47:51,306 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 17:47:51,306 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 17:47:51,317 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2018-04-11 17:47:51,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 17:47:51,325 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:47:51,325 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:47:51,325 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:47:51,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1599603740, now seen corresponding path program 1 times [2018-04-11 17:47:51,329 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:47:51,329 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:47:51,362 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:51,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:47:51,362 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:47:51,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:47:51,428 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-11 17:47:51,430 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:47:51,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 17:47:51,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 17:47:51,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 17:47:51,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 17:47:51,442 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2018-04-11 17:47:51,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:47:51,618 INFO L93 Difference]: Finished difference Result 168 states and 180 transitions. [2018-04-11 17:47:51,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 17:47:51,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 17:47:51,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:47:51,629 INFO L225 Difference]: With dead ends: 168 [2018-04-11 17:47:51,630 INFO L226 Difference]: Without dead ends: 164 [2018-04-11 17:47:51,631 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-11 17:47:51,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-11 17:47:51,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 138. [2018-04-11 17:47:51,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-11 17:47:51,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2018-04-11 17:47:51,662 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 8 [2018-04-11 17:47:51,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:47:51,662 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2018-04-11 17:47:51,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 17:47:51,662 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2018-04-11 17:47:51,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 17:47:51,662 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:47:51,663 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:47:51,663 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:47:51,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1599603741, now seen corresponding path program 1 times [2018-04-11 17:47:51,663 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:47:51,663 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:47:51,665 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:51,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:47:51,665 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:47:51,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:47:51,719 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-11 17:47:51,719 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:47:51,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 17:47:51,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 17:47:51,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 17:47:51,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 17:47:51,722 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 4 states. [2018-04-11 17:47:51,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:47:51,853 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2018-04-11 17:47:51,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 17:47:51,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 17:47:51,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:47:51,854 INFO L225 Difference]: With dead ends: 135 [2018-04-11 17:47:51,854 INFO L226 Difference]: Without dead ends: 135 [2018-04-11 17:47:51,855 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-11 17:47:51,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-11 17:47:51,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 130. [2018-04-11 17:47:51,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-11 17:47:51,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2018-04-11 17:47:51,862 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 8 [2018-04-11 17:47:51,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:47:51,862 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2018-04-11 17:47:51,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 17:47:51,862 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2018-04-11 17:47:51,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 17:47:51,863 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:47:51,863 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:47:51,863 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:47:51,863 INFO L82 PathProgramCache]: Analyzing trace with hash 723052242, now seen corresponding path program 1 times [2018-04-11 17:47:51,863 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:47:51,863 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:47:51,864 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:51,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:47:51,864 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:47:51,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:47:51,923 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-11 17:47:51,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:47:51,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 17:47:51,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 17:47:51,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 17:47:51,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:47:51,925 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand 5 states. [2018-04-11 17:47:52,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:47:52,164 INFO L93 Difference]: Finished difference Result 279 states and 303 transitions. [2018-04-11 17:47:52,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 17:47:52,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-11 17:47:52,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:47:52,168 INFO L225 Difference]: With dead ends: 279 [2018-04-11 17:47:52,168 INFO L226 Difference]: Without dead ends: 279 [2018-04-11 17:47:52,168 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-11 17:47:52,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-04-11 17:47:52,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 129. [2018-04-11 17:47:52,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 17:47:52,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2018-04-11 17:47:52,176 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 15 [2018-04-11 17:47:52,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:47:52,176 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2018-04-11 17:47:52,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 17:47:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2018-04-11 17:47:52,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 17:47:52,177 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:47:52,177 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:47:52,177 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:47:52,177 INFO L82 PathProgramCache]: Analyzing trace with hash 723052243, now seen corresponding path program 1 times [2018-04-11 17:47:52,177 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:47:52,177 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:47:52,179 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:52,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:47:52,179 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:47:52,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:47:52,243 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-11 17:47:52,243 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:47:52,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 17:47:52,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 17:47:52,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 17:47:52,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:47:52,244 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand 5 states. [2018-04-11 17:47:52,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:47:52,433 INFO L93 Difference]: Finished difference Result 235 states and 255 transitions. [2018-04-11 17:47:52,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 17:47:52,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-11 17:47:52,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:47:52,434 INFO L225 Difference]: With dead ends: 235 [2018-04-11 17:47:52,434 INFO L226 Difference]: Without dead ends: 235 [2018-04-11 17:47:52,434 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-11 17:47:52,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-04-11 17:47:52,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 128. [2018-04-11 17:47:52,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 17:47:52,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2018-04-11 17:47:52,438 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 15 [2018-04-11 17:47:52,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:47:52,438 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2018-04-11 17:47:52,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 17:47:52,438 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2018-04-11 17:47:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 17:47:52,438 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:47:52,438 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:47:52,438 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:47:52,438 INFO L82 PathProgramCache]: Analyzing trace with hash 863312645, now seen corresponding path program 1 times [2018-04-11 17:47:52,439 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:47:52,439 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:47:52,441 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:52,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:47:52,441 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:47:52,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:47:52,458 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:47:52,458 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:47:52,458 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:47:52,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:47:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:47:52,485 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:47:52,507 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-11 17:47:52,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:52,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:52,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 17:47:52,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:47:52,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:47:52,523 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-11 17:47:52,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:52,527 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-11 17:47:52,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-11 17:47:52,539 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-11 17:47:52,539 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:47:52,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 17:47:52,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 17:47:52,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 17:47:52,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 17:47:52,540 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand 6 states. [2018-04-11 17:47:52,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:47:52,753 INFO L93 Difference]: Finished difference Result 187 states and 204 transitions. [2018-04-11 17:47:52,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 17:47:52,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-04-11 17:47:52,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:47:52,754 INFO L225 Difference]: With dead ends: 187 [2018-04-11 17:47:52,754 INFO L226 Difference]: Without dead ends: 187 [2018-04-11 17:47:52,754 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-11 17:47:52,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-04-11 17:47:52,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 124. [2018-04-11 17:47:52,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-11 17:47:52,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2018-04-11 17:47:52,760 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 19 [2018-04-11 17:47:52,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:47:52,760 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2018-04-11 17:47:52,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 17:47:52,760 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2018-04-11 17:47:52,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 17:47:52,760 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:47:52,760 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:47:52,760 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:47:52,761 INFO L82 PathProgramCache]: Analyzing trace with hash 863312646, now seen corresponding path program 1 times [2018-04-11 17:47:52,761 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:47:52,763 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:47:52,763 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:52,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:47:52,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:47:52,770 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:47:52,773 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:47:52,773 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:47:52,773 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:47:52,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:47:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:47:52,790 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:47:52,798 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-11 17:47:52,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:52,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:52,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:47:52,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 17:47:52,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:52,828 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-11 17:47:52,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2018-04-11 17:47:52,833 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-11 17:47:52,834 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:47:52,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 17:47:52,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 17:47:52,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 17:47:52,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 17:47:52,834 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand 6 states. [2018-04-11 17:47:52,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:47:52,959 INFO L93 Difference]: Finished difference Result 174 states and 191 transitions. [2018-04-11 17:47:52,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 17:47:52,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-04-11 17:47:52,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:47:52,960 INFO L225 Difference]: With dead ends: 174 [2018-04-11 17:47:52,960 INFO L226 Difference]: Without dead ends: 174 [2018-04-11 17:47:52,960 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-11 17:47:52,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-04-11 17:47:52,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 154. [2018-04-11 17:47:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-11 17:47:52,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 176 transitions. [2018-04-11 17:47:52,965 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 176 transitions. Word has length 19 [2018-04-11 17:47:52,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:47:52,965 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 176 transitions. [2018-04-11 17:47:52,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 17:47:52,965 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2018-04-11 17:47:52,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 17:47:52,966 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:47:52,966 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-11 17:47:52,966 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:47:52,966 INFO L82 PathProgramCache]: Analyzing trace with hash 682869627, now seen corresponding path program 1 times [2018-04-11 17:47:52,966 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:47:52,966 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:47:52,967 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:52,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:47:52,968 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:47:52,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:47:53,001 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-11 17:47:53,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:47:53,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 17:47:53,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 17:47:53,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 17:47:53,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 17:47:53,002 INFO L87 Difference]: Start difference. First operand 154 states and 176 transitions. Second operand 6 states. [2018-04-11 17:47:53,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:47:53,174 INFO L93 Difference]: Finished difference Result 222 states and 255 transitions. [2018-04-11 17:47:53,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 17:47:53,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-04-11 17:47:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:47:53,175 INFO L225 Difference]: With dead ends: 222 [2018-04-11 17:47:53,175 INFO L226 Difference]: Without dead ends: 222 [2018-04-11 17:47:53,175 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-11 17:47:53,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-11 17:47:53,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 153. [2018-04-11 17:47:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-11 17:47:53,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 175 transitions. [2018-04-11 17:47:53,179 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 175 transitions. Word has length 22 [2018-04-11 17:47:53,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:47:53,179 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 175 transitions. [2018-04-11 17:47:53,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 17:47:53,180 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 175 transitions. [2018-04-11 17:47:53,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 17:47:53,180 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:47:53,180 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-11 17:47:53,180 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:47:53,181 INFO L82 PathProgramCache]: Analyzing trace with hash 682869628, now seen corresponding path program 1 times [2018-04-11 17:47:53,181 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:47:53,181 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:47:53,182 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:53,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:47:53,182 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:47:53,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:47:53,234 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-11 17:47:53,234 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:47:53,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 17:47:53,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 17:47:53,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 17:47:53,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 17:47:53,235 INFO L87 Difference]: Start difference. First operand 153 states and 175 transitions. Second operand 6 states. [2018-04-11 17:47:53,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:47:53,475 INFO L93 Difference]: Finished difference Result 236 states and 274 transitions. [2018-04-11 17:47:53,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 17:47:53,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-04-11 17:47:53,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:47:53,476 INFO L225 Difference]: With dead ends: 236 [2018-04-11 17:47:53,476 INFO L226 Difference]: Without dead ends: 236 [2018-04-11 17:47:53,477 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-11 17:47:53,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-04-11 17:47:53,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 137. [2018-04-11 17:47:53,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-11 17:47:53,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2018-04-11 17:47:53,480 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 22 [2018-04-11 17:47:53,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:47:53,480 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2018-04-11 17:47:53,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 17:47:53,480 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2018-04-11 17:47:53,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 17:47:53,481 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:47:53,481 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] [2018-04-11 17:47:53,481 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:47:53,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1146686030, now seen corresponding path program 1 times [2018-04-11 17:47:53,481 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:47:53,481 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:47:53,482 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:53,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:47:53,482 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:47:53,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:47:53,525 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-11 17:47:53,525 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:47:53,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 17:47:53,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 17:47:53,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 17:47:53,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:47:53,526 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 5 states. [2018-04-11 17:47:53,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:47:53,621 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2018-04-11 17:47:53,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 17:47:53,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-11 17:47:53,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:47:53,622 INFO L225 Difference]: With dead ends: 158 [2018-04-11 17:47:53,622 INFO L226 Difference]: Without dead ends: 158 [2018-04-11 17:47:53,622 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 17:47:53,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-11 17:47:53,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 137. [2018-04-11 17:47:53,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-11 17:47:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2018-04-11 17:47:53,625 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 25 [2018-04-11 17:47:53,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:47:53,625 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2018-04-11 17:47:53,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 17:47:53,625 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2018-04-11 17:47:53,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 17:47:53,625 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:47:53,626 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:47:53,626 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:47:53,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1880164707, now seen corresponding path program 1 times [2018-04-11 17:47:53,626 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:47:53,626 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:47:53,627 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:53,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:47:53,627 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:47:53,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:47:53,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-11 17:47:53,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:47:53,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 17:47:53,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 17:47:53,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 17:47:53,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 17:47:53,662 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand 4 states. [2018-04-11 17:47:53,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:47:53,678 INFO L93 Difference]: Finished difference Result 163 states and 186 transitions. [2018-04-11 17:47:53,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 17:47:53,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-04-11 17:47:53,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:47:53,679 INFO L225 Difference]: With dead ends: 163 [2018-04-11 17:47:53,679 INFO L226 Difference]: Without dead ends: 163 [2018-04-11 17:47:53,680 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-11 17:47:53,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-11 17:47:53,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 141. [2018-04-11 17:47:53,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-04-11 17:47:53,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 160 transitions. [2018-04-11 17:47:53,684 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 160 transitions. Word has length 28 [2018-04-11 17:47:53,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:47:53,684 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 160 transitions. [2018-04-11 17:47:53,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 17:47:53,684 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2018-04-11 17:47:53,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 17:47:53,685 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:47:53,685 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-11 17:47:53,685 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:47:53,686 INFO L82 PathProgramCache]: Analyzing trace with hash -925635600, now seen corresponding path program 1 times [2018-04-11 17:47:53,686 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:47:53,686 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:47:53,689 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:53,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:47:53,689 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:47:53,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:47:53,728 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-11 17:47:53,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:47:53,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 17:47:53,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 17:47:53,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 17:47:53,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:47:53,729 INFO L87 Difference]: Start difference. First operand 141 states and 160 transitions. Second operand 5 states. [2018-04-11 17:47:53,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:47:53,908 INFO L93 Difference]: Finished difference Result 243 states and 277 transitions. [2018-04-11 17:47:53,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 17:47:53,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-11 17:47:53,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:47:53,909 INFO L225 Difference]: With dead ends: 243 [2018-04-11 17:47:53,909 INFO L226 Difference]: Without dead ends: 243 [2018-04-11 17:47:53,909 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-11 17:47:53,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-11 17:47:53,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 140. [2018-04-11 17:47:53,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-04-11 17:47:53,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 159 transitions. [2018-04-11 17:47:53,913 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 159 transitions. Word has length 29 [2018-04-11 17:47:53,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:47:53,913 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 159 transitions. [2018-04-11 17:47:53,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 17:47:53,913 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 159 transitions. [2018-04-11 17:47:53,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 17:47:53,914 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:47:53,914 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-11 17:47:53,914 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:47:53,914 INFO L82 PathProgramCache]: Analyzing trace with hash -925635599, now seen corresponding path program 1 times [2018-04-11 17:47:53,914 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:47:53,914 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:47:53,915 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:53,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:47:53,915 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:47:53,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:47:54,019 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-11 17:47:54,020 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:47:54,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 17:47:54,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 17:47:54,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 17:47:54,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:47:54,020 INFO L87 Difference]: Start difference. First operand 140 states and 159 transitions. Second operand 5 states. [2018-04-11 17:47:54,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:47:54,209 INFO L93 Difference]: Finished difference Result 252 states and 288 transitions. [2018-04-11 17:47:54,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 17:47:54,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-11 17:47:54,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:47:54,210 INFO L225 Difference]: With dead ends: 252 [2018-04-11 17:47:54,210 INFO L226 Difference]: Without dead ends: 252 [2018-04-11 17:47:54,211 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-11 17:47:54,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-04-11 17:47:54,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 139. [2018-04-11 17:47:54,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-04-11 17:47:54,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 158 transitions. [2018-04-11 17:47:54,214 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 158 transitions. Word has length 29 [2018-04-11 17:47:54,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:47:54,214 INFO L459 AbstractCegarLoop]: Abstraction has 139 states and 158 transitions. [2018-04-11 17:47:54,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 17:47:54,214 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 158 transitions. [2018-04-11 17:47:54,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 17:47:54,215 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:47:54,215 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-11 17:47:54,215 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:47:54,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1714976192, now seen corresponding path program 1 times [2018-04-11 17:47:54,215 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:47:54,215 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:47:54,216 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:54,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:47:54,217 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:47:54,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:47:54,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:47:54,337 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:47:54,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 17:47:54,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 17:47:54,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 17:47:54,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-04-11 17:47:54,338 INFO L87 Difference]: Start difference. First operand 139 states and 158 transitions. Second operand 10 states. [2018-04-11 17:47:54,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:47:54,560 INFO L93 Difference]: Finished difference Result 249 states and 282 transitions. [2018-04-11 17:47:54,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 17:47:54,561 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-04-11 17:47:54,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:47:54,561 INFO L225 Difference]: With dead ends: 249 [2018-04-11 17:47:54,561 INFO L226 Difference]: Without dead ends: 249 [2018-04-11 17:47:54,562 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-04-11 17:47:54,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-04-11 17:47:54,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 156. [2018-04-11 17:47:54,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-04-11 17:47:54,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 179 transitions. [2018-04-11 17:47:54,565 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 179 transitions. Word has length 30 [2018-04-11 17:47:54,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:47:54,565 INFO L459 AbstractCegarLoop]: Abstraction has 156 states and 179 transitions. [2018-04-11 17:47:54,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 17:47:54,565 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 179 transitions. [2018-04-11 17:47:54,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 17:47:54,566 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:47:54,566 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-11 17:47:54,566 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:47:54,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1714976193, now seen corresponding path program 1 times [2018-04-11 17:47:54,566 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:47:54,566 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:47:54,567 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:54,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:47:54,567 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:47:54,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:47:54,696 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-11 17:47:54,696 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:47:54,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 17:47:54,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 17:47:54,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 17:47:54,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-04-11 17:47:54,697 INFO L87 Difference]: Start difference. First operand 156 states and 179 transitions. Second operand 9 states. [2018-04-11 17:47:55,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:47:55,042 INFO L93 Difference]: Finished difference Result 230 states and 258 transitions. [2018-04-11 17:47:55,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 17:47:55,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-04-11 17:47:55,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:47:55,043 INFO L225 Difference]: With dead ends: 230 [2018-04-11 17:47:55,044 INFO L226 Difference]: Without dead ends: 230 [2018-04-11 17:47:55,044 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2018-04-11 17:47:55,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-04-11 17:47:55,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 152. [2018-04-11 17:47:55,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-11 17:47:55,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 173 transitions. [2018-04-11 17:47:55,047 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 173 transitions. Word has length 30 [2018-04-11 17:47:55,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:47:55,047 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 173 transitions. [2018-04-11 17:47:55,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 17:47:55,048 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 173 transitions. [2018-04-11 17:47:55,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 17:47:55,048 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:47:55,048 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:47:55,048 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:47:55,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1951010669, now seen corresponding path program 1 times [2018-04-11 17:47:55,049 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:47:55,049 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:47:55,050 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:55,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:47:55,050 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:47:55,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:47:55,062 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:47:55,062 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:47:55,062 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:47:55,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:47:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:47:55,091 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:47:55,107 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-11 17:47:55,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:55,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:55,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 17:47:55,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:47:55,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:47:55,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:55,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:55,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:47:55,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:47:55,139 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:55,140 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:55,144 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-11 17:47:55,144 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:24 [2018-04-11 17:47:55,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 61 [2018-04-11 17:47:55,183 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 59 treesize of output 58 [2018-04-11 17:47:55,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:55,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:55,230 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 42 treesize of output 58 [2018-04-11 17:47:55,235 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 43 treesize of output 42 [2018-04-11 17:47:55,236 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:55,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:55,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:47:55,257 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:82, output treesize:62 [2018-04-11 17:47:55,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2018-04-11 17:47:55,302 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 31 treesize of output 26 [2018-04-11 17:47:55,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:55,312 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:47:55,312 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 26 treesize of output 20 [2018-04-11 17:47:55,313 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:55,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:47:55,323 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:47:55,324 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:47:55,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-04-11 17:47:55,324 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:55,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:55,336 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-11 17:47:55,336 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:70, output treesize:42 [2018-04-11 17:47:55,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 36 treesize of output 24 [2018-04-11 17:47:55,470 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-11 17:47:55,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:55,498 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-11 17:47:55,498 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:55,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:55,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:55,505 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:42, output treesize:5 [2018-04-11 17:47:55,519 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-11 17:47:55,520 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:47:55,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-11 17:47:55,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 17:47:55,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 17:47:55,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-04-11 17:47:55,520 INFO L87 Difference]: Start difference. First operand 152 states and 173 transitions. Second operand 14 states. [2018-04-11 17:47:56,205 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 86 DAG size of output 76 [2018-04-11 17:47:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:47:57,022 INFO L93 Difference]: Finished difference Result 404 states and 459 transitions. [2018-04-11 17:47:57,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 17:47:57,023 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-04-11 17:47:57,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:47:57,024 INFO L225 Difference]: With dead ends: 404 [2018-04-11 17:47:57,024 INFO L226 Difference]: Without dead ends: 404 [2018-04-11 17:47:57,025 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 17:47:57,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-04-11 17:47:57,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 168. [2018-04-11 17:47:57,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-11 17:47:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 193 transitions. [2018-04-11 17:47:57,029 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 193 transitions. Word has length 33 [2018-04-11 17:47:57,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:47:57,029 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 193 transitions. [2018-04-11 17:47:57,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 17:47:57,029 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 193 transitions. [2018-04-11 17:47:57,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 17:47:57,030 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:47:57,030 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:47:57,030 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:47:57,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1951010668, now seen corresponding path program 1 times [2018-04-11 17:47:57,031 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:47:57,031 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:47:57,032 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:57,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:47:57,032 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:47:57,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:47:57,051 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:47:57,051 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:47:57,051 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:47:57,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:47:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:47:57,079 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:47:57,089 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-11 17:47:57,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:57,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:57,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 17:47:57,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:47:57,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:47:57,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:57,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:57,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:47:57,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:47:57,120 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:57,121 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:57,128 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-11 17:47:57,128 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:24 [2018-04-11 17:47:57,176 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 42 treesize of output 58 [2018-04-11 17:47:57,179 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 43 treesize of output 42 [2018-04-11 17:47:57,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:57,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:57,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 53 [2018-04-11 17:47:57,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:47:57,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2018-04-11 17:47:57,236 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:47:57,245 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:47:57,265 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-11 17:47:57,265 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:57,275 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:57,285 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-11 17:47:57,285 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:82, output treesize:62 [2018-04-11 17:47:57,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-04-11 17:47:57,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-04-11 17:47:57,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:57,531 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-11 17:47:57,531 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:57,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:57,555 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 29 treesize of output 25 [2018-04-11 17:47:57,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-04-11 17:47:57,558 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:57,565 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-11 17:47:57,565 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:57,569 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:57,576 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-11 17:47:57,576 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:71, output treesize:12 [2018-04-11 17:47:57,600 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-11 17:47:57,601 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:47:57,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-11 17:47:57,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 17:47:57,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 17:47:57,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-04-11 17:47:57,602 INFO L87 Difference]: Start difference. First operand 168 states and 193 transitions. Second operand 14 states. [2018-04-11 17:47:58,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:47:58,713 INFO L93 Difference]: Finished difference Result 331 states and 375 transitions. [2018-04-11 17:47:58,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 17:47:58,714 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-04-11 17:47:58,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:47:58,715 INFO L225 Difference]: With dead ends: 331 [2018-04-11 17:47:58,715 INFO L226 Difference]: Without dead ends: 331 [2018-04-11 17:47:58,715 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=225, Invalid=531, Unknown=0, NotChecked=0, Total=756 [2018-04-11 17:47:58,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-04-11 17:47:58,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 168. [2018-04-11 17:47:58,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-11 17:47:58,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 192 transitions. [2018-04-11 17:47:58,719 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 192 transitions. Word has length 33 [2018-04-11 17:47:58,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:47:58,719 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 192 transitions. [2018-04-11 17:47:58,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 17:47:58,719 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 192 transitions. [2018-04-11 17:47:58,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 17:47:58,720 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:47:58,720 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] [2018-04-11 17:47:58,720 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:47:58,720 INFO L82 PathProgramCache]: Analyzing trace with hash -594222086, now seen corresponding path program 1 times [2018-04-11 17:47:58,720 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:47:58,720 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:47:58,721 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:58,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:47:58,721 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:47:58,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:47:58,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:47:58,740 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:47:58,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 17:47:58,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 17:47:58,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 17:47:58,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 17:47:58,740 INFO L87 Difference]: Start difference. First operand 168 states and 192 transitions. Second operand 4 states. [2018-04-11 17:47:58,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:47:58,755 INFO L93 Difference]: Finished difference Result 179 states and 203 transitions. [2018-04-11 17:47:58,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 17:47:58,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-04-11 17:47:58,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:47:58,756 INFO L225 Difference]: With dead ends: 179 [2018-04-11 17:47:58,756 INFO L226 Difference]: Without dead ends: 179 [2018-04-11 17:47:58,756 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-11 17:47:58,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-04-11 17:47:58,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 172. [2018-04-11 17:47:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-04-11 17:47:58,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 196 transitions. [2018-04-11 17:47:58,758 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 196 transitions. Word has length 36 [2018-04-11 17:47:58,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:47:58,759 INFO L459 AbstractCegarLoop]: Abstraction has 172 states and 196 transitions. [2018-04-11 17:47:58,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 17:47:58,759 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 196 transitions. [2018-04-11 17:47:58,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 17:47:58,759 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:47:58,759 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] [2018-04-11 17:47:58,760 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:47:58,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1495087999, now seen corresponding path program 1 times [2018-04-11 17:47:58,760 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:47:58,760 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:47:58,761 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:58,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:47:58,761 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:47:58,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:47:58,769 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:47:58,769 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:47:58,769 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:47:58,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:47:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:47:58,785 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:47:58,793 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-11 17:47:58,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:47:58,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:58,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:58,804 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-11 17:47:58,806 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-11 17:47:58,806 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:58,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:58,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:58,813 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-11 17:47:58,824 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-11 17:47:58,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:47:58,828 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-11 17:47:58,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:58,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:58,840 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-11 17:47:58,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:47:58,843 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:47:58,844 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 30 [2018-04-11 17:47:58,844 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:58,847 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:58,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:58,852 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-11 17:47:58,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-04-11 17:47:58,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:47:58,930 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:47:58,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:47:58,931 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:47:58,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-11 17:47:58,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:58,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:58,945 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-11 17:47:58,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:47:58,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:47:58,947 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:47:58,947 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:47:58,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2018-04-11 17:47:58,948 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:58,951 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:58,955 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-11 17:47:58,955 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:68, output treesize:10 [2018-04-11 17:47:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:47:58,976 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:47:58,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 17:47:58,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 17:47:58,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 17:47:58,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-04-11 17:47:58,977 INFO L87 Difference]: Start difference. First operand 172 states and 196 transitions. Second operand 12 states. [2018-04-11 17:47:59,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:47:59,364 INFO L93 Difference]: Finished difference Result 252 states and 282 transitions. [2018-04-11 17:47:59,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 17:47:59,365 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-04-11 17:47:59,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:47:59,365 INFO L225 Difference]: With dead ends: 252 [2018-04-11 17:47:59,365 INFO L226 Difference]: Without dead ends: 252 [2018-04-11 17:47:59,365 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2018-04-11 17:47:59,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-04-11 17:47:59,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 184. [2018-04-11 17:47:59,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-04-11 17:47:59,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 208 transitions. [2018-04-11 17:47:59,368 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 208 transitions. Word has length 38 [2018-04-11 17:47:59,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:47:59,368 INFO L459 AbstractCegarLoop]: Abstraction has 184 states and 208 transitions. [2018-04-11 17:47:59,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 17:47:59,368 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 208 transitions. [2018-04-11 17:47:59,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 17:47:59,368 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:47:59,368 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] [2018-04-11 17:47:59,368 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:47:59,368 INFO L82 PathProgramCache]: Analyzing trace with hash -2098711726, now seen corresponding path program 1 times [2018-04-11 17:47:59,368 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:47:59,369 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:47:59,369 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:59,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:47:59,369 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:47:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:47:59,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:47:59,375 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:47:59,375 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:47:59,375 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:47:59,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:47:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:47:59,391 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:47:59,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-11 17:47:59,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-11 17:47:59,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:59,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:59,427 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-11 17:47:59,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, 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-11 17:47:59,429 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:59,430 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:59,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:59,434 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-11 17:47:59,450 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-11 17:47:59,452 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:47:59,453 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-11 17:47:59,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:59,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:59,465 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-11 17:47:59,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:47:59,467 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-11 17:47:59,467 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:59,470 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:59,476 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-11 17:47:59,476 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:30 [2018-04-11 17:47:59,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-04-11 17:47:59,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 17:47:59,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:59,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:59,546 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 37 treesize of output 45 [2018-04-11 17:47:59,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:47:59,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:47:59,568 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:47:59,569 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:47:59,569 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 31 treesize of output 53 [2018-04-11 17:47:59,569 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:59,588 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 34 treesize of output 33 [2018-04-11 17:47:59,588 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:59,596 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:59,604 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-11 17:47:59,604 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:64, output treesize:56 [2018-04-11 17:47:59,715 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-11 17:47:59,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, 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-11 17:47:59,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:59,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:47:59,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:47:59,728 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:47:59,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-04-11 17:47:59,729 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:59,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:47:59,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:47:59,740 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:47:59,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-04-11 17:47:59,742 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:59,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:59,760 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 40 treesize of output 38 [2018-04-11 17:47:59,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2018-04-11 17:47:59,762 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:59,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:47:59,779 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:47:59,779 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:47:59,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-04-11 17:47:59,780 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:59,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:47:59,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:47:59,791 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:47:59,792 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:47:59,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2018-04-11 17:47:59,792 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:47:59,798 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:47:59,803 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-11 17:47:59,803 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:85, output treesize:10 [2018-04-11 17:47:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:47:59,835 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:47:59,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 17:47:59,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 17:47:59,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 17:47:59,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-04-11 17:47:59,835 INFO L87 Difference]: Start difference. First operand 184 states and 208 transitions. Second operand 15 states. [2018-04-11 17:48:00,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:48:00,637 INFO L93 Difference]: Finished difference Result 226 states and 252 transitions. [2018-04-11 17:48:00,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 17:48:00,637 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-04-11 17:48:00,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:48:00,637 INFO L225 Difference]: With dead ends: 226 [2018-04-11 17:48:00,638 INFO L226 Difference]: Without dead ends: 226 [2018-04-11 17:48:00,638 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=366, Invalid=1039, Unknown=1, NotChecked=0, Total=1406 [2018-04-11 17:48:00,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-04-11 17:48:00,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 187. [2018-04-11 17:48:00,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-04-11 17:48:00,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 212 transitions. [2018-04-11 17:48:00,641 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 212 transitions. Word has length 41 [2018-04-11 17:48:00,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:48:00,641 INFO L459 AbstractCegarLoop]: Abstraction has 187 states and 212 transitions. [2018-04-11 17:48:00,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 17:48:00,641 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 212 transitions. [2018-04-11 17:48:00,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 17:48:00,642 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:48:00,642 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] [2018-04-11 17:48:00,642 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:48:00,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1591086459, now seen corresponding path program 1 times [2018-04-11 17:48:00,642 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:48:00,642 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:48:00,643 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:48:00,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:48:00,643 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:48:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:48:00,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:48:00,655 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:48:00,655 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:48:00,655 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:48:00,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:48:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:48:00,680 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:48:00,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:48:00,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:48:00,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:00,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:00,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:00,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-04-11 17:48:00,737 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-11 17:48:00,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:48:00,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:00,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:00,747 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-11 17:48:00,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-11 17:48:00,759 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-11 17:48:00,760 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-11 17:48:00,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:00,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:00,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:00,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-04-11 17:48:00,808 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-11 17:48:00,810 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 24 treesize of output 23 [2018-04-11 17:48:00,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:00,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:00,837 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-11 17:48:00,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-04-11 17:48:00,855 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-11 17:48:00,857 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-11 17:48:00,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:00,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:00,860 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-11 17:48:00,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-04-11 17:48:00,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 17:48:00,880 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:48:00,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-11 17:48:00,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 17:48:00,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 17:48:00,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-04-11 17:48:00,881 INFO L87 Difference]: Start difference. First operand 187 states and 212 transitions. Second operand 13 states. [2018-04-11 17:48:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:48:01,355 INFO L93 Difference]: Finished difference Result 351 states and 386 transitions. [2018-04-11 17:48:01,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 17:48:01,390 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-04-11 17:48:01,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:48:01,390 INFO L225 Difference]: With dead ends: 351 [2018-04-11 17:48:01,390 INFO L226 Difference]: Without dead ends: 351 [2018-04-11 17:48:01,391 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=256, Invalid=614, Unknown=0, NotChecked=0, Total=870 [2018-04-11 17:48:01,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-04-11 17:48:01,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 218. [2018-04-11 17:48:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-11 17:48:01,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 247 transitions. [2018-04-11 17:48:01,394 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 247 transitions. Word has length 43 [2018-04-11 17:48:01,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:48:01,394 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 247 transitions. [2018-04-11 17:48:01,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 17:48:01,394 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 247 transitions. [2018-04-11 17:48:01,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 17:48:01,395 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:48:01,395 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] [2018-04-11 17:48:01,395 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:48:01,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1980177539, now seen corresponding path program 1 times [2018-04-11 17:48:01,395 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:48:01,395 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:48:01,396 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:48:01,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:48:01,396 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:48:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:48:01,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:48:01,405 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:48:01,405 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:48:01,406 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:48:01,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:48:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:48:01,428 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:48:01,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:48:01,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:48:01,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:01,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:01,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:01,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-04-11 17:48:01,464 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-11 17:48:01,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 8 treesize of output 7 [2018-04-11 17:48:01,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:01,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:01,473 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-11 17:48:01,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-11 17:48:01,486 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-11 17:48:01,487 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-11 17:48:01,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:01,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:01,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:01,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-04-11 17:48:01,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:01,543 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 3 case distinctions, treesize of input 23 treesize of output 44 [2018-04-11 17:48:01,546 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:48:01,546 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 29 treesize of output 20 [2018-04-11 17:48:01,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:01,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 17:48:01,560 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:01,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:48:01,576 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-11 17:48:01,576 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:48 [2018-04-11 17:48:01,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:01,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:01,653 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 30 treesize of output 32 [2018-04-11 17:48:01,660 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2018-04-11 17:48:01,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:01,667 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-11 17:48:01,668 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:01,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:01,681 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 19 [2018-04-11 17:48:01,682 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:48:01,683 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-11 17:48:01,683 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:01,686 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:01,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:48:01,692 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:54, output treesize:7 [2018-04-11 17:48:01,712 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-11 17:48:01,713 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:48:01,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 17:48:01,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 17:48:01,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 17:48:01,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-04-11 17:48:01,713 INFO L87 Difference]: Start difference. First operand 218 states and 247 transitions. Second operand 14 states. [2018-04-11 17:48:02,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:48:02,725 INFO L93 Difference]: Finished difference Result 433 states and 475 transitions. [2018-04-11 17:48:02,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 17:48:02,725 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-04-11 17:48:02,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:48:02,726 INFO L225 Difference]: With dead ends: 433 [2018-04-11 17:48:02,726 INFO L226 Difference]: Without dead ends: 433 [2018-04-11 17:48:02,726 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2018-04-11 17:48:02,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-04-11 17:48:02,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 222. [2018-04-11 17:48:02,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-04-11 17:48:02,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 253 transitions. [2018-04-11 17:48:02,730 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 253 transitions. Word has length 43 [2018-04-11 17:48:02,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:48:02,731 INFO L459 AbstractCegarLoop]: Abstraction has 222 states and 253 transitions. [2018-04-11 17:48:02,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 17:48:02,731 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 253 transitions. [2018-04-11 17:48:02,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 17:48:02,731 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:48:02,731 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] [2018-04-11 17:48:02,732 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:48:02,732 INFO L82 PathProgramCache]: Analyzing trace with hash -912010883, now seen corresponding path program 1 times [2018-04-11 17:48:02,732 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:48:02,732 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:48:02,733 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:48:02,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:48:02,733 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:48:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:48:02,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:48:02,747 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:48:02,747 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:48:02,747 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:48:02,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:48:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:48:02,770 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:48:02,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:48:02,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:48:02,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:02,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:02,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:02,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-04-11 17:48:02,824 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-11 17:48:02,826 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-11 17:48:02,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:02,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:02,834 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-11 17:48:02,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-11 17:48:02,846 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-11 17:48:02,848 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-11 17:48:02,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:02,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:02,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:02,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-04-11 17:48:02,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:02,884 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 3 case distinctions, treesize of input 23 treesize of output 44 [2018-04-11 17:48:02,887 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 35 treesize of output 31 [2018-04-11 17:48:02,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:02,909 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:48:02,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:02,910 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 21 treesize of output 20 [2018-04-11 17:48:02,910 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:02,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:48:02,925 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-11 17:48:02,925 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:48 [2018-04-11 17:48:02,990 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 19 [2018-04-11 17:48:02,992 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:48:02,993 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-11 17:48:02,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:02,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:03,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:03,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:03,007 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 30 treesize of output 32 [2018-04-11 17:48:03,012 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 [2018-04-11 17:48:03,012 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:48:03,020 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-11 17:48:03,020 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:03,024 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:03,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:48:03,030 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:54, output treesize:7 [2018-04-11 17:48:03,055 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-11 17:48:03,055 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:48:03,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 17:48:03,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 17:48:03,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 17:48:03,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-04-11 17:48:03,056 INFO L87 Difference]: Start difference. First operand 222 states and 253 transitions. Second operand 14 states. [2018-04-11 17:48:03,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:48:03,697 INFO L93 Difference]: Finished difference Result 478 states and 526 transitions. [2018-04-11 17:48:03,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 17:48:03,697 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-04-11 17:48:03,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:48:03,699 INFO L225 Difference]: With dead ends: 478 [2018-04-11 17:48:03,699 INFO L226 Difference]: Without dead ends: 478 [2018-04-11 17:48:03,699 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2018-04-11 17:48:03,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-04-11 17:48:03,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 248. [2018-04-11 17:48:03,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-11 17:48:03,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 285 transitions. [2018-04-11 17:48:03,703 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 285 transitions. Word has length 43 [2018-04-11 17:48:03,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:48:03,703 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 285 transitions. [2018-04-11 17:48:03,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 17:48:03,703 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 285 transitions. [2018-04-11 17:48:03,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 17:48:03,704 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:48:03,704 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:48:03,704 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:48:03,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1962075886, now seen corresponding path program 1 times [2018-04-11 17:48:03,704 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:48:03,704 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:48:03,705 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:48:03,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:48:03,706 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:48:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:48:03,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:48:03,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 17:48:03,784 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:48:03,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 17:48:03,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 17:48:03,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 17:48:03,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 17:48:03,785 INFO L87 Difference]: Start difference. First operand 248 states and 285 transitions. Second operand 8 states. [2018-04-11 17:48:03,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:48:03,922 INFO L93 Difference]: Finished difference Result 381 states and 431 transitions. [2018-04-11 17:48:03,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 17:48:03,922 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-04-11 17:48:03,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:48:03,923 INFO L225 Difference]: With dead ends: 381 [2018-04-11 17:48:03,923 INFO L226 Difference]: Without dead ends: 381 [2018-04-11 17:48:03,923 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-04-11 17:48:03,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-04-11 17:48:03,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 346. [2018-04-11 17:48:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-04-11 17:48:03,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 404 transitions. [2018-04-11 17:48:03,929 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 404 transitions. Word has length 45 [2018-04-11 17:48:03,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:48:03,929 INFO L459 AbstractCegarLoop]: Abstraction has 346 states and 404 transitions. [2018-04-11 17:48:03,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 17:48:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 404 transitions. [2018-04-11 17:48:03,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 17:48:03,930 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:48:03,930 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:48:03,930 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:48:03,930 INFO L82 PathProgramCache]: Analyzing trace with hash -357570926, now seen corresponding path program 1 times [2018-04-11 17:48:03,930 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:48:03,930 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:48:03,931 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:48:03,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:48:03,931 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:48:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:48:03,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:48:03,946 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:48:03,946 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:48:03,947 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:48:03,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:48:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:48:03,985 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:48:04,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:04,004 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 5 [2018-04-11 17:48:04,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:04,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:04,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-04-11 17:48:04,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:48:04,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:48:04,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:04,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:04,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 13 treesize of output 10 [2018-04-11 17:48:04,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:48:04,029 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:04,030 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:04,035 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-11 17:48:04,035 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:24 [2018-04-11 17:48:04,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 17:48:04,045 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 15 treesize of output 7 [2018-04-11 17:48:04,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:04,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:04,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:04,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-04-11 17:48:04,092 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-11 17:48:04,095 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 24 treesize of output 23 [2018-04-11 17:48:04,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:04,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:04,123 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-11 17:48:04,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-04-11 17:48:04,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:04,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:04,164 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 23 treesize of output 39 [2018-04-11 17:48:04,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:04,181 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-11 17:48:04,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:52 [2018-04-11 17:48:04,213 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-11 17:48:04,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 8 treesize of output 7 [2018-04-11 17:48:04,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:04,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:04,261 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 4 case distinctions, treesize of input 40 treesize of output 51 [2018-04-11 17:48:04,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:04,266 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 40 treesize of output 49 [2018-04-11 17:48:04,267 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:04,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:04,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:04,303 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:48:04,306 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 34 treesize of output 47 [2018-04-11 17:48:04,306 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:04,330 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:48:04,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 17:48:04,362 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:74, output treesize:122 [2018-04-11 17:48:04,424 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-11 17:48:04,426 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-11 17:48:04,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:04,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:04,434 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-11 17:48:04,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:47 [2018-04-11 17:48:04,475 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 46 treesize of output 52 [2018-04-11 17:48:04,477 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 47 treesize of output 46 [2018-04-11 17:48:04,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:04,496 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:48:04,498 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 38 treesize of output 46 [2018-04-11 17:48:04,498 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-11 17:48:04,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:48:04,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 17:48:04,528 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:61, output treesize:110 [2018-04-11 17:48:04,569 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 65 treesize of output 62 [2018-04-11 17:48:04,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:48:04,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:04,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:04,583 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 70 treesize of output 67 [2018-04-11 17:48:04,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 10 treesize of output 9 [2018-04-11 17:48:04,584 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:04,593 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:04,616 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 2 xjuncts. [2018-04-11 17:48:04,616 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:136, output treesize:128 [2018-04-11 17:48:04,696 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 71 treesize of output 62 [2018-04-11 17:48:04,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:04,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:04,700 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:48:04,703 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 33 treesize of output 45 [2018-04-11 17:48:04,704 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-11 17:48:04,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:48:04,765 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 79 treesize of output 83 [2018-04-11 17:48:04,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:04,768 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 78 treesize of output 85 [2018-04-11 17:48:04,768 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:04,804 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:48:04,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:04,805 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:48:04,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 69 treesize of output 82 [2018-04-11 17:48:04,807 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:48:04,836 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:48:04,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-04-11 17:48:04,873 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:151, output treesize:179 [2018-04-11 17:48:04,983 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 84 treesize of output 88 [2018-04-11 17:48:04,985 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 84 treesize of output 77 [2018-04-11 17:48:04,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:05,016 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 77 treesize of output 70 [2018-04-11 17:48:05,016 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:05,047 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:48:05,047 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 80 treesize of output 76 [2018-04-11 17:48:05,047 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:05,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:48:05,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2018-04-11 17:48:05,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 17:48:05,115 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:05,123 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:05,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-04-11 17:48:05,162 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:143, output treesize:177 [2018-04-11 17:48:05,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2018-04-11 17:48:05,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:05,321 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-11 17:48:05,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:05,327 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 28 treesize of output 19 [2018-04-11 17:48:05,328 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-11 17:48:05,331 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-11 17:48:05,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:48:05,337 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:70, output treesize:15 [2018-04-11 17:48:05,369 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-11 17:48:05,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:48:05,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 17:48:05,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 17:48:05,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 17:48:05,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2018-04-11 17:48:05,370 INFO L87 Difference]: Start difference. First operand 346 states and 404 transitions. Second operand 21 states. [2018-04-11 17:48:06,419 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 132 DAG size of output 104 [2018-04-11 17:48:06,964 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 150 DAG size of output 110 [2018-04-11 17:48:07,155 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 179 DAG size of output 143 [2018-04-11 17:48:08,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:48:08,240 INFO L93 Difference]: Finished difference Result 616 states and 705 transitions. [2018-04-11 17:48:08,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 17:48:08,241 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2018-04-11 17:48:08,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:48:08,242 INFO L225 Difference]: With dead ends: 616 [2018-04-11 17:48:08,242 INFO L226 Difference]: Without dead ends: 616 [2018-04-11 17:48:08,243 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=373, Invalid=1432, Unknown=1, NotChecked=0, Total=1806 [2018-04-11 17:48:08,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-04-11 17:48:08,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 372. [2018-04-11 17:48:08,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-04-11 17:48:08,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 436 transitions. [2018-04-11 17:48:08,246 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 436 transitions. Word has length 46 [2018-04-11 17:48:08,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:48:08,246 INFO L459 AbstractCegarLoop]: Abstraction has 372 states and 436 transitions. [2018-04-11 17:48:08,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 17:48:08,246 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 436 transitions. [2018-04-11 17:48:08,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 17:48:08,247 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:48:08,247 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:48:08,247 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:48:08,247 INFO L82 PathProgramCache]: Analyzing trace with hash -357570925, now seen corresponding path program 1 times [2018-04-11 17:48:08,247 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:48:08,247 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:48:08,248 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:48:08,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:48:08,248 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:48:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:48:08,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:48:08,259 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:48:08,259 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:48:08,259 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:48:08,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:48:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:48:08,291 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:48:08,295 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-11 17:48:08,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,299 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-11 17:48:08,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 17:48:08,313 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:08,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 17:48:08,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:08,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:08,322 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-11 17:48:08,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 17:48:08,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:48:08,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:48:08,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:48:08,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:48:08,351 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,352 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,359 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-11 17:48:08,359 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:44 [2018-04-11 17:48:08,395 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 68 treesize of output 62 [2018-04-11 17:48:08,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, 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-11 17:48:08,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-11 17:48:08,415 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-11 17:48:08,415 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,418 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,429 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-11 17:48:08,429 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:90, output treesize:70 [2018-04-11 17:48:08,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:08,476 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 23 treesize of output 36 [2018-04-11 17:48:08,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:08,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:08,494 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-11 17:48:08,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,507 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-11 17:48:08,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:87, output treesize:80 [2018-04-11 17:48:08,535 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 62 [2018-04-11 17:48:08,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:08,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 71 [2018-04-11 17:48:08,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,571 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 34 treesize of output 42 [2018-04-11 17:48:08,573 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:08,574 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-11 17:48:08,574 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,580 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,596 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-11 17:48:08,596 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:102, output treesize:88 [2018-04-11 17:48:08,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:08,682 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 102 [2018-04-11 17:48:08,693 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 85 treesize of output 86 [2018-04-11 17:48:08,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,730 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 80 treesize of output 79 [2018-04-11 17:48:08,730 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:08,780 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 84 [2018-04-11 17:48:08,783 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 63 treesize of output 62 [2018-04-11 17:48:08,783 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,801 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,817 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-11 17:48:08,817 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:114, output treesize:110 [2018-04-11 17:48:08,865 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 141 [2018-04-11 17:48:08,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:08,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 145 [2018-04-11 17:48:08,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:08,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:08,950 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 2 case distinctions, treesize of input 106 treesize of output 129 [2018-04-11 17:48:08,950 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 17:48:08,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:48:09,029 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 120 treesize of output 99 [2018-04-11 17:48:09,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:09,032 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 25 treesize of output 40 [2018-04-11 17:48:09,032 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:09,044 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:09,063 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 156 [2018-04-11 17:48:09,066 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:09,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 126 treesize of output 149 [2018-04-11 17:48:09,072 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 17:48:09,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:09,126 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 121 treesize of output 132 [2018-04-11 17:48:09,126 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:09,160 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:48:09,197 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-11 17:48:09,198 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:153, output treesize:245 [2018-04-11 17:48:09,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 93 [2018-04-11 17:48:09,326 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 86 treesize of output 81 [2018-04-11 17:48:09,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:09,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:09,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 73 [2018-04-11 17:48:09,366 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:09,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 50 [2018-04-11 17:48:09,390 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:48:09,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:09,417 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 1 case distinctions, treesize of input 80 treesize of output 79 [2018-04-11 17:48:09,418 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 17:48:09,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:09,456 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 46 [2018-04-11 17:48:09,457 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:09,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:09,459 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 67 treesize of output 52 [2018-04-11 17:48:09,459 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:48:09,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 17:48:09,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 60 [2018-04-11 17:48:09,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:09,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-04-11 17:48:09,523 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:09,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-04-11 17:48:09,552 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:09,571 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 32 [2018-04-11 17:48:09,571 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:09,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:09,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 41 [2018-04-11 17:48:09,592 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:09,607 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 35 treesize of output 28 [2018-04-11 17:48:09,607 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:09,617 INFO L267 ElimStorePlain]: Start of recursive call 9: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:09,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 54 [2018-04-11 17:48:09,624 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 50 treesize of output 43 [2018-04-11 17:48:09,624 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:09,649 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 43 treesize of output 38 [2018-04-11 17:48:09,649 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:09,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:09,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-04-11 17:48:09,668 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:09,690 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 46 treesize of output 39 [2018-04-11 17:48:09,690 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:09,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:09,721 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 1 case distinctions, treesize of input 39 treesize of output 38 [2018-04-11 17:48:09,722 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-04-11 17:48:09,756 INFO L267 ElimStorePlain]: Start of recursive call 15: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 17:48:09,760 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 60 treesize of output 50 [2018-04-11 17:48:09,763 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-11 17:48:09,763 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:09,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:09,776 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-11 17:48:09,776 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:09,784 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-11 17:48:09,785 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:09,791 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:09,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-04-11 17:48:09,822 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 6 variables, input treesize:138, output treesize:117 [2018-04-11 17:48:09,872 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-11 17:48:09,873 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:48:09,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 17:48:09,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 17:48:09,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 17:48:09,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-04-11 17:48:09,873 INFO L87 Difference]: Start difference. First operand 372 states and 436 transitions. Second operand 17 states. [2018-04-11 17:48:11,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:48:11,645 INFO L93 Difference]: Finished difference Result 565 states and 647 transitions. [2018-04-11 17:48:11,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 17:48:11,645 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-04-11 17:48:11,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:48:11,646 INFO L225 Difference]: With dead ends: 565 [2018-04-11 17:48:11,646 INFO L226 Difference]: Without dead ends: 565 [2018-04-11 17:48:11,646 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=248, Invalid=874, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 17:48:11,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-04-11 17:48:11,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 390. [2018-04-11 17:48:11,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-04-11 17:48:11,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 457 transitions. [2018-04-11 17:48:11,651 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 457 transitions. Word has length 46 [2018-04-11 17:48:11,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:48:11,651 INFO L459 AbstractCegarLoop]: Abstraction has 390 states and 457 transitions. [2018-04-11 17:48:11,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 17:48:11,651 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 457 transitions. [2018-04-11 17:48:11,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 17:48:11,652 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:48:11,652 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:48:11,652 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:48:11,652 INFO L82 PathProgramCache]: Analyzing trace with hash -746662006, now seen corresponding path program 1 times [2018-04-11 17:48:11,652 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:48:11,652 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:48:11,653 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:48:11,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:48:11,653 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:48:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:48:11,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:48:11,666 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:48:11,667 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:48:11,667 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:48:11,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:48:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:48:11,699 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:48:11,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:48:11,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:11,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:11,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:48:11,723 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:11,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:11,724 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-11 17:48:11,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:11,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:11,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-11 17:48:11,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:48:11,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:48:11,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:11,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:11,752 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-11 17:48:11,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-11 17:48:11,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-11 17:48:11,785 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-11 17:48:11,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:11,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:11,796 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-11 17:48:11,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-11 17:48:11,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:11,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:11,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:11,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-11 17:48:11,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:11,853 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-11 17:48:11,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:63, output treesize:71 [2018-04-11 17:48:11,880 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-11 17:48:11,890 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-11 17:48:11,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:11,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:11,926 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 56 treesize of output 59 [2018-04-11 17:48:11,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:11,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 68 [2018-04-11 17:48:11,930 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:11,938 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:11,952 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-11 17:48:11,953 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:93, output treesize:87 [2018-04-11 17:48:11,981 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-11 17:48:11,983 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-11 17:48:11,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:11,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:11,995 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-11 17:48:11,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:91, output treesize:80 [2018-04-11 17:48:12,062 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 95 [2018-04-11 17:48:12,067 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 88 treesize of output 87 [2018-04-11 17:48:12,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:12,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:12,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 87 [2018-04-11 17:48:12,228 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:48:12,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 17:48:12,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-04-11 17:48:12,350 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:94, output treesize:271 [2018-04-11 17:48:12,448 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 103 treesize of output 100 [2018-04-11 17:48:12,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:48:12,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:12,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:12,465 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 91 treesize of output 88 [2018-04-11 17:48:12,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 10 treesize of output 9 [2018-04-11 17:48:12,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:12,479 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:12,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 17:48:12,510 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:195, output treesize:187 [2018-04-11 17:48:12,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:12,571 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 95 [2018-04-11 17:48:12,573 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:48:12,573 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:12,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2018-04-11 17:48:12,575 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-11 17:48:12,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:48:12,647 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 128 [2018-04-11 17:48:12,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:12,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 128 [2018-04-11 17:48:12,653 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:12,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:12,794 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 2 case distinctions, treesize of input 108 treesize of output 123 [2018-04-11 17:48:12,795 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 17:48:12,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:12,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:12,897 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:48:12,900 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 1 case distinctions, treesize of input 96 treesize of output 112 [2018-04-11 17:48:12,901 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:48:13,068 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 17:48:13,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2018-04-11 17:48:13,171 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:210, output treesize:486 [2018-04-11 17:48:13,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 72 treesize of output 68 [2018-04-11 17:48:13,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 17:48:13,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:13,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:13,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:13,397 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 117 treesize of output 117 [2018-04-11 17:48:13,399 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-11 17:48:13,399 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:13,420 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-11 17:48:13,420 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:13,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:13,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-04-11 17:48:13,457 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:190, output treesize:157 [2018-04-11 17:48:13,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:13,594 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 1 case distinctions, treesize of input 81 treesize of output 69 [2018-04-11 17:48:13,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 52 [2018-04-11 17:48:13,596 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-11 17:48:13,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:13,621 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 48 treesize of output 42 [2018-04-11 17:48:13,621 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:13,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2018-04-11 17:48:13,642 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:48:13,659 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 36 treesize of output 31 [2018-04-11 17:48:13,659 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:13,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:13,678 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 1 case distinctions, treesize of input 44 treesize of output 43 [2018-04-11 17:48:13,679 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 17:48:13,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-11 17:48:13,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-04-11 17:48:13,725 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:95, output treesize:89 [2018-04-11 17:48:13,774 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-11 17:48:13,774 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:48:13,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 17:48:13,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 17:48:13,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 17:48:13,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2018-04-11 17:48:13,775 INFO L87 Difference]: Start difference. First operand 390 states and 457 transitions. Second operand 21 states. [2018-04-11 17:48:15,058 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 138 DAG size of output 130 [2018-04-11 17:48:15,283 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 145 DAG size of output 133 [2018-04-11 17:48:15,509 WARN L151 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 149 DAG size of output 140 [2018-04-11 17:48:15,669 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 140 DAG size of output 116 [2018-04-11 17:48:15,892 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 157 DAG size of output 119 [2018-04-11 17:48:16,264 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 133 DAG size of output 125 [2018-04-11 17:48:16,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:48:16,566 INFO L93 Difference]: Finished difference Result 561 states and 643 transitions. [2018-04-11 17:48:16,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 17:48:16,566 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2018-04-11 17:48:16,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:48:16,567 INFO L225 Difference]: With dead ends: 561 [2018-04-11 17:48:16,567 INFO L226 Difference]: Without dead ends: 561 [2018-04-11 17:48:16,568 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=341, Invalid=1465, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 17:48:16,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-04-11 17:48:16,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 374. [2018-04-11 17:48:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-04-11 17:48:16,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 437 transitions. [2018-04-11 17:48:16,571 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 437 transitions. Word has length 46 [2018-04-11 17:48:16,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:48:16,571 INFO L459 AbstractCegarLoop]: Abstraction has 374 states and 437 transitions. [2018-04-11 17:48:16,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 17:48:16,571 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 437 transitions. [2018-04-11 17:48:16,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 17:48:16,571 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:48:16,571 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:48:16,571 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:48:16,572 INFO L82 PathProgramCache]: Analyzing trace with hash 694810563, now seen corresponding path program 1 times [2018-04-11 17:48:16,572 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:48:16,572 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:48:16,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:48:16,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:48:16,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:48:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:48:16,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:48:16,755 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-11 17:48:16,755 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:48:16,755 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:48:16,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:48:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:48:16,770 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:48:16,852 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-11 17:48:16,853 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-11 17:48:16,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:16,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:16,855 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-11 17:48:16,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-04-11 17:48:16,868 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-11 17:48:16,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:48:16,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2018-04-11 17:48:16,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 17:48:16,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 17:48:16,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-04-11 17:48:16,870 INFO L87 Difference]: Start difference. First operand 374 states and 437 transitions. Second operand 13 states. [2018-04-11 17:48:17,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:48:17,228 INFO L93 Difference]: Finished difference Result 467 states and 532 transitions. [2018-04-11 17:48:17,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 17:48:17,229 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-04-11 17:48:17,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:48:17,230 INFO L225 Difference]: With dead ends: 467 [2018-04-11 17:48:17,230 INFO L226 Difference]: Without dead ends: 467 [2018-04-11 17:48:17,230 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 10 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2018-04-11 17:48:17,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-04-11 17:48:17,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 284. [2018-04-11 17:48:17,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-04-11 17:48:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 328 transitions. [2018-04-11 17:48:17,234 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 328 transitions. Word has length 46 [2018-04-11 17:48:17,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:48:17,234 INFO L459 AbstractCegarLoop]: Abstraction has 284 states and 328 transitions. [2018-04-11 17:48:17,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 17:48:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 328 transitions. [2018-04-11 17:48:17,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 17:48:17,235 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:48:17,235 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:48:17,235 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:48:17,235 INFO L82 PathProgramCache]: Analyzing trace with hash 769640755, now seen corresponding path program 1 times [2018-04-11 17:48:17,236 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:48:17,236 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:48:17,236 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:48:17,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:48:17,237 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:48:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:48:17,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:48:17,251 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:48:17,251 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:48:17,251 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:48:17,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:48:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:48:17,269 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:48:17,272 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-11 17:48:17,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:17,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:17,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:48:17,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:48:17,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:48:17,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:17,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:17,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:17,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-11 17:48:17,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:17,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:17,316 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-11 17:48:17,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:17,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:17,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-11 17:48:17,332 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-11 17:48:17,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 17:48:17,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:17,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:17,341 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-11 17:48:17,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 17:48:17,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 16 treesize of output 12 [2018-04-11 17:48:17,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, 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-11 17:48:17,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:17,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:17,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:17,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-11 17:48:17,384 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 23 treesize of output 24 [2018-04-11 17:48:17,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:48:17,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:17,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:17,395 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-11 17:48:17,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-11 17:48:17,433 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-11 17:48:17,435 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-11 17:48:17,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:17,440 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-11 17:48:17,441 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:17,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:17,444 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-11 17:48:17,444 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-04-11 17:48:17,471 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-11 17:48:17,471 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:48:17,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 17:48:17,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 17:48:17,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 17:48:17,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-04-11 17:48:17,472 INFO L87 Difference]: Start difference. First operand 284 states and 328 transitions. Second operand 13 states. [2018-04-11 17:48:18,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:48:18,161 INFO L93 Difference]: Finished difference Result 564 states and 643 transitions. [2018-04-11 17:48:18,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 17:48:18,161 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-04-11 17:48:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:48:18,162 INFO L225 Difference]: With dead ends: 564 [2018-04-11 17:48:18,162 INFO L226 Difference]: Without dead ends: 564 [2018-04-11 17:48:18,163 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=290, Invalid=900, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 17:48:18,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2018-04-11 17:48:18,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 327. [2018-04-11 17:48:18,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-04-11 17:48:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 379 transitions. [2018-04-11 17:48:18,165 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 379 transitions. Word has length 46 [2018-04-11 17:48:18,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:48:18,166 INFO L459 AbstractCegarLoop]: Abstraction has 327 states and 379 transitions. [2018-04-11 17:48:18,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 17:48:18,166 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 379 transitions. [2018-04-11 17:48:18,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 17:48:18,167 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:48:18,167 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:48:18,167 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:48:18,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1814161211, now seen corresponding path program 1 times [2018-04-11 17:48:18,167 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:48:18,167 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:48:18,168 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:48:18,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:48:18,168 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:48:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:48:18,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:48:18,184 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:48:18,184 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:48:18,184 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:48:18,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:48:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:48:18,203 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:48:18,213 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-11 17:48:18,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:18,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:18,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:48:18,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:48:18,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:48:18,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:18,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:18,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:18,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-11 17:48:18,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:18,275 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:18,275 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-11 17:48:18,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:18,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:18,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-11 17:48:18,295 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-11 17:48:18,297 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-11 17:48:18,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:18,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:18,305 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-11 17:48:18,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 17:48:18,318 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-11 17:48:18,319 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-11 17:48:18,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:18,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:18,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:18,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-11 17:48:18,345 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 23 treesize of output 24 [2018-04-11 17:48:18,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:48:18,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:18,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:18,353 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-11 17:48:18,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-11 17:48:18,391 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-11 17:48:18,393 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-11 17:48:18,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:18,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, 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-11 17:48:18,396 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:18,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:18,399 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-11 17:48:18,399 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-04-11 17:48:18,417 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-11 17:48:18,418 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:48:18,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 17:48:18,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 17:48:18,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 17:48:18,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-04-11 17:48:18,418 INFO L87 Difference]: Start difference. First operand 327 states and 379 transitions. Second operand 13 states. [2018-04-11 17:48:19,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:48:19,196 INFO L93 Difference]: Finished difference Result 588 states and 671 transitions. [2018-04-11 17:48:19,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 17:48:19,196 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-04-11 17:48:19,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:48:19,197 INFO L225 Difference]: With dead ends: 588 [2018-04-11 17:48:19,197 INFO L226 Difference]: Without dead ends: 588 [2018-04-11 17:48:19,198 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=290, Invalid=900, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 17:48:19,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2018-04-11 17:48:19,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 308. [2018-04-11 17:48:19,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-04-11 17:48:19,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 356 transitions. [2018-04-11 17:48:19,201 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 356 transitions. Word has length 46 [2018-04-11 17:48:19,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:48:19,201 INFO L459 AbstractCegarLoop]: Abstraction has 308 states and 356 transitions. [2018-04-11 17:48:19,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 17:48:19,201 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 356 transitions. [2018-04-11 17:48:19,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 17:48:19,202 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:48:19,202 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-11 17:48:19,202 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:48:19,202 INFO L82 PathProgramCache]: Analyzing trace with hash 690699782, now seen corresponding path program 1 times [2018-04-11 17:48:19,203 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:48:19,203 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:48:19,203 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:48:19,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:48:19,204 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:48:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:48:19,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:48:19,217 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:48:19,217 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:48:19,217 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:48:19,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:48:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:48:19,264 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:48:19,272 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-11 17:48:19,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:19,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:19,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:48:19,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 17:48:19,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:19,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:19,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-04-11 17:48:19,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:48:19,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:48:19,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:19,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:19,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:48:19,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:48:19,320 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:19,322 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:19,330 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-11 17:48:19,330 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-04-11 17:48:19,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 17:48:19,343 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 15 treesize of output 7 [2018-04-11 17:48:19,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:19,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:19,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:19,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:23 [2018-04-11 17:48:19,364 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-11 17:48:19,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 24 treesize of output 23 [2018-04-11 17:48:19,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:19,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:19,381 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-11 17:48:19,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2018-04-11 17:48:19,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:19,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:19,408 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:19,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2018-04-11 17:48:19,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:19,419 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-11 17:48:19,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:55 [2018-04-11 17:48:19,454 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 4 case distinctions, treesize of input 40 treesize of output 51 [2018-04-11 17:48:19,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:19,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 49 [2018-04-11 17:48:19,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:19,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:19,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:19,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 55 [2018-04-11 17:48:19,489 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 17:48:19,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:48:19,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 17:48:19,525 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:66, output treesize:128 [2018-04-11 17:48:19,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:19,591 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 61 treesize of output 62 [2018-04-11 17:48:19,592 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-11 17:48:19,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:19,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:19,607 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-11 17:48:19,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:64 [2018-04-11 17:48:19,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:19,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:19,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:19,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:19,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:19,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2018-04-11 17:48:19,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:19,654 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-11 17:48:19,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:78, output treesize:90 [2018-04-11 17:48:19,683 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:19,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2018-04-11 17:48:19,688 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:19,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 17:48:19,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:19,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:19,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 14 [2018-04-11 17:48:19,718 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-11 17:48:19,718 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:19,719 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:19,738 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-11 17:48:19,738 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:116, output treesize:124 [2018-04-11 17:48:19,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2018-04-11 17:48:19,771 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 15 treesize of output 7 [2018-04-11 17:48:19,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:19,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:48:19,786 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-11 17:48:19,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:158, output treesize:135 [2018-04-11 17:48:19,829 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 124 [2018-04-11 17:48:19,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:19,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 122 [2018-04-11 17:48:19,844 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:48:19,982 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 129 treesize of output 128 [2018-04-11 17:48:19,982 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:20,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:20,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 106 treesize of output 112 [2018-04-11 17:48:20,077 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:48:20,161 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:48:20,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-04-11 17:48:20,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 17 dim-0 vars, and 5 xjuncts. [2018-04-11 17:48:20,430 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:146, output treesize:640 [2018-04-11 17:48:23,040 WARN L151 SmtUtils]: Spent 2519ms on a formula simplification. DAG size of input: 176 DAG size of output 110 [2018-04-11 17:48:25,144 WARN L148 SmtUtils]: Spent 2063ms on a formula simplification that was a NOOP. DAG size: 110 [2018-04-11 17:48:25,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 140 treesize of output 113 [2018-04-11 17:48:25,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:25,186 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 1 case distinctions, treesize of input 96 treesize of output 86 [2018-04-11 17:48:25,186 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:48:25,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:25,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 83 [2018-04-11 17:48:25,291 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-11 17:48:25,372 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 0 case distinctions, treesize of input 70 treesize of output 55 [2018-04-11 17:48:25,372 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:48: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, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 61 [2018-04-11 17:48:25,374 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:48:25,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:25,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 87 [2018-04-11 17:48:25,458 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:48:25,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:25,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:25,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 92 treesize of output 107 [2018-04-11 17:48:25,558 INFO L267 ElimStorePlain]: Start of recursive call 8: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-04-11 17:48:25,723 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 81 treesize of output 76 [2018-04-11 17:48:25,723 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:25,874 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:25,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 67 [2018-04-11 17:48:25,878 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:48:26,068 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 76 treesize of output 59 [2018-04-11 17:48:26,069 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:48:26,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: 14 dim-0 vars, and 9 xjuncts. [2018-04-11 17:48:26,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 85 [2018-04-11 17:48:26,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:26,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2018-04-11 17:48:26,443 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:26,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:26,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 24 [2018-04-11 17:48:26,455 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:48:26,464 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:48:26,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 85 [2018-04-11 17:48:26,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:48:26,670 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-11 17:48:26,671 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 17:48:26,683 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 0 case distinctions, treesize of input 46 treesize of output 31 [2018-04-11 17:48:26,683 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:48:26,693 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:48:26,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-2 vars, End of recursive call: 29 dim-0 vars, and 11 xjuncts. [2018-04-11 17:48:26,891 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 16 variables, input treesize:350, output treesize:455 [2018-04-11 17:48:26,990 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-11 17:48:26,990 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:48:26,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 17:48:26,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 17:48:26,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 17:48:26,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-04-11 17:48:26,991 INFO L87 Difference]: Start difference. First operand 308 states and 356 transitions. Second operand 20 states. [2018-04-11 17:48:34,326 WARN L151 SmtUtils]: Spent 6112ms on a formula simplification. DAG size of input: 125 DAG size of output 125 [2018-04-11 17:48:44,734 WARN L151 SmtUtils]: Spent 10233ms on a formula simplification. DAG size of input: 207 DAG size of output 130 [2018-04-11 17:49:05,323 WARN L151 SmtUtils]: Spent 20308ms on a formula simplification. DAG size of input: 228 DAG size of output 133 [2018-04-11 17:49:05,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:49:05,769 INFO L93 Difference]: Finished difference Result 630 states and 728 transitions. [2018-04-11 17:49:05,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 17:49:05,769 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-04-11 17:49:05,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:49:05,770 INFO L225 Difference]: With dead ends: 630 [2018-04-11 17:49:05,770 INFO L226 Difference]: Without dead ends: 630 [2018-04-11 17:49:05,770 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 42.2s TimeCoverageRelationStatistics Valid=297, Invalid=1185, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 17:49:05,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2018-04-11 17:49:05,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 330. [2018-04-11 17:49:05,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-04-11 17:49:05,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 382 transitions. [2018-04-11 17:49:05,774 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 382 transitions. Word has length 49 [2018-04-11 17:49:05,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:49:05,775 INFO L459 AbstractCegarLoop]: Abstraction has 330 states and 382 transitions. [2018-04-11 17:49:05,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 17:49:05,775 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 382 transitions. [2018-04-11 17:49:05,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 17:49:05,775 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:49:05,776 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-11 17:49:05,776 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:49:05,776 INFO L82 PathProgramCache]: Analyzing trace with hash 690699783, now seen corresponding path program 1 times [2018-04-11 17:49:05,776 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:49:05,776 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:49:05,777 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:49:05,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:49:05,777 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:49:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:49:05,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:49:05,794 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:49:05,794 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:49:05,794 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:49:05,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:49:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:49:05,848 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:49:05,851 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-11 17:49:05,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:05,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:05,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:49:05,876 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-11 17:49:05,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:05,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:05,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:05,888 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-11 17:49:05,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:05,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:05,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-04-11 17:49:05,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:49:05,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:49:05,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:05,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:05,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:49:05,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:49:05,933 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:05,935 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:05,943 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-11 17:49:05,943 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2018-04-11 17:49:05,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 73 [2018-04-11 17:49:05,975 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-11 17:49:05,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:05,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:06,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-04-11 17:49:06,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, 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-11 17:49:06,021 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:06,026 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:06,038 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-11 17:49:06,038 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:108, output treesize:88 [2018-04-11 17:49:06,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:06,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:06,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:06,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-11 17:49:06,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:06,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 17:49:06,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:06,137 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-11 17:49:06,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:114, output treesize:121 [2018-04-11 17:49:06,192 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 43 treesize of output 49 [2018-04-11 17:49:06,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:06,195 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:49:06,195 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 23 treesize of output 41 [2018-04-11 17:49:06,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:06,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:06,239 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 80 treesize of output 79 [2018-04-11 17:49:06,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:06,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 92 [2018-04-11 17:49:06,242 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:06,254 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:06,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:49:06,279 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:140, output treesize:141 [2018-04-11 17:49:06,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:06,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 82 [2018-04-11 17:49:06,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 17:49:06,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:06,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:06,450 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:06,455 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 132 treesize of output 146 [2018-04-11 17:49:06,457 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 11 [2018-04-11 17:49:06,457 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:06,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:06,498 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-11 17:49:06,498 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:177, output treesize:170 [2018-04-11 17:49:06,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:06,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:06,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:06,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:06,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 55 [2018-04-11 17:49:06,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:06,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-04-11 17:49:06,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:06,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:49:06,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:184, output treesize:179 [2018-04-11 17:49:06,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 111 [2018-04-11 17:49:06,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:06,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-04-11 17:49:06,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:06,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:06,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:06,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 171 [2018-04-11 17:49:06,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:06,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 39 [2018-04-11 17:49:06,710 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:06,728 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:06,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:49:06,760 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:202, output treesize:205 [2018-04-11 17:49:06,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:06,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:06,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 276 [2018-04-11 17:49:06,852 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 22 treesize of output 21 [2018-04-11 17:49:06,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:06,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:06,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:06,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 264 [2018-04-11 17:49:06,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 17:49:06,926 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:06,946 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:06,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 17:49:06,979 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:333, output treesize:297 [2018-04-11 17:49:07,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:07,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:07,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 255 treesize of output 199 [2018-04-11 17:49:07,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11 17:49:07,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:07,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:07,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 50 [2018-04-11 17:49:07,151 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-11 17:49:07,173 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-11 17:49:07,174 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:07,192 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 104 treesize of output 79 [2018-04-11 17:49:07,193 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:49:07,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:49:07,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 80 [2018-04-11 17:49:07,240 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-11 17:49:07,240 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:07,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:07,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-04-11 17:49:07,255 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:07,262 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-11 17:49:07,262 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:07,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:07,268 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:49:07,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2018-04-11 17:49:07,269 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:07,273 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:07,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:49:07,286 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:292, output treesize:34 [2018-04-11 17:49:07,337 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-11 17:49:07,337 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:49:07,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 17:49:07,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 17:49:07,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 17:49:07,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=309, Unknown=7, NotChecked=0, Total=380 [2018-04-11 17:49:07,338 INFO L87 Difference]: Start difference. First operand 330 states and 382 transitions. Second operand 20 states. [2018-04-11 17:49:08,768 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 126 DAG size of output 122 [2018-04-11 17:49:08,997 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 135 DAG size of output 131 [2018-04-11 17:49:09,195 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 131 DAG size of output 127 [2018-04-11 17:49:10,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:49:10,414 INFO L93 Difference]: Finished difference Result 649 states and 754 transitions. [2018-04-11 17:49:10,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 17:49:10,414 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-04-11 17:49:10,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:49:10,415 INFO L225 Difference]: With dead ends: 649 [2018-04-11 17:49:10,415 INFO L226 Difference]: Without dead ends: 649 [2018-04-11 17:49:10,416 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=346, Invalid=1197, Unknown=17, NotChecked=0, Total=1560 [2018-04-11 17:49:10,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-04-11 17:49:10,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 314. [2018-04-11 17:49:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-04-11 17:49:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 362 transitions. [2018-04-11 17:49:10,419 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 362 transitions. Word has length 49 [2018-04-11 17:49:10,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:49:10,419 INFO L459 AbstractCegarLoop]: Abstraction has 314 states and 362 transitions. [2018-04-11 17:49:10,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 17:49:10,419 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 362 transitions. [2018-04-11 17:49:10,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 17:49:10,420 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:49:10,420 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] [2018-04-11 17:49:10,420 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:49:10,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1085426215, now seen corresponding path program 1 times [2018-04-11 17:49:10,420 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:49:10,420 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:49:10,421 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:49:10,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:49:10,421 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:49:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:49:10,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:49:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:49:10,511 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:49:10,511 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:49:10,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:49:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:49:10,525 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:49:10,676 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-11 17:49:10,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:49:10,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 17:49:10,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:49:10,706 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-11 17:49:10,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:49:10,712 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 17:49:10,715 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:49:10,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:49:10,728 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:41, output treesize:18 [2018-04-11 17:49:10,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:49:10,809 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:49:10,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 19 [2018-04-11 17:49:10,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 17:49:10,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 17:49:10,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=304, Unknown=2, NotChecked=0, Total=342 [2018-04-11 17:49:10,810 INFO L87 Difference]: Start difference. First operand 314 states and 362 transitions. Second operand 19 states. [2018-04-11 17:49:11,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:49:11,633 INFO L93 Difference]: Finished difference Result 414 states and 474 transitions. [2018-04-11 17:49:11,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 17:49:11,633 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-04-11 17:49:11,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:49:11,634 INFO L225 Difference]: With dead ends: 414 [2018-04-11 17:49:11,635 INFO L226 Difference]: Without dead ends: 414 [2018-04-11 17:49:11,635 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=911, Unknown=11, NotChecked=0, Total=1122 [2018-04-11 17:49:11,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-04-11 17:49:11,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 346. [2018-04-11 17:49:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-04-11 17:49:11,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 400 transitions. [2018-04-11 17:49:11,639 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 400 transitions. Word has length 49 [2018-04-11 17:49:11,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:49:11,639 INFO L459 AbstractCegarLoop]: Abstraction has 346 states and 400 transitions. [2018-04-11 17:49:11,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 17:49:11,639 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 400 transitions. [2018-04-11 17:49:11,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 17:49:11,640 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:49:11,640 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:49:11,640 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:49:11,640 INFO L82 PathProgramCache]: Analyzing trace with hash 338904510, now seen corresponding path program 1 times [2018-04-11 17:49:11,640 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:49:11,640 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:49:11,641 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:49:11,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:49:11,641 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:49:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:49:11,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:49:11,651 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:49:11,651 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:49:11,651 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:49:11,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:49:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:49:11,671 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:49:11,769 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-11 17:49:11,770 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-11 17:49:11,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:11,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:11,772 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-11 17:49:11,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-04-11 17:49:11,780 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-11 17:49:11,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:49:11,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-11 17:49:11,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 17:49:11,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 17:49:11,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-04-11 17:49:11,780 INFO L87 Difference]: Start difference. First operand 346 states and 400 transitions. Second operand 11 states. [2018-04-11 17:49:12,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:49:12,088 INFO L93 Difference]: Finished difference Result 532 states and 607 transitions. [2018-04-11 17:49:12,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 17:49:12,088 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-04-11 17:49:12,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:49:12,089 INFO L225 Difference]: With dead ends: 532 [2018-04-11 17:49:12,089 INFO L226 Difference]: Without dead ends: 532 [2018-04-11 17:49:12,089 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2018-04-11 17:49:12,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2018-04-11 17:49:12,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 405. [2018-04-11 17:49:12,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-04-11 17:49:12,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 474 transitions. [2018-04-11 17:49:12,094 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 474 transitions. Word has length 50 [2018-04-11 17:49:12,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:49:12,094 INFO L459 AbstractCegarLoop]: Abstraction has 405 states and 474 transitions. [2018-04-11 17:49:12,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 17:49:12,094 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 474 transitions. [2018-04-11 17:49:12,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 17:49:12,095 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:49:12,095 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] [2018-04-11 17:49:12,095 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:49:12,096 INFO L82 PathProgramCache]: Analyzing trace with hash 711524907, now seen corresponding path program 1 times [2018-04-11 17:49:12,096 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:49:12,096 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:49:12,096 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:49:12,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:49:12,097 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:49:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:49:12,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:49:12,106 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:49:12,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:49:12,106 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:49:12,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:49:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:49:12,119 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:49:12,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 17:49:12,177 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:49:12,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-11 17:49:12,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 17:49:12,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 17:49:12,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=27, Unknown=3, NotChecked=0, Total=42 [2018-04-11 17:49:12,178 INFO L87 Difference]: Start difference. First operand 405 states and 474 transitions. Second operand 7 states. [2018-04-11 17:49:12,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:49:12,415 INFO L93 Difference]: Finished difference Result 432 states and 500 transitions. [2018-04-11 17:49:12,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 17:49:12,415 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-04-11 17:49:12,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:49:12,416 INFO L225 Difference]: With dead ends: 432 [2018-04-11 17:49:12,416 INFO L226 Difference]: Without dead ends: 399 [2018-04-11 17:49:12,416 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=47, Unknown=3, NotChecked=0, Total=72 [2018-04-11 17:49:12,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-04-11 17:49:12,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 398. [2018-04-11 17:49:12,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-04-11 17:49:12,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 466 transitions. [2018-04-11 17:49:12,420 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 466 transitions. Word has length 50 [2018-04-11 17:49:12,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:49:12,420 INFO L459 AbstractCegarLoop]: Abstraction has 398 states and 466 transitions. [2018-04-11 17:49:12,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 17:49:12,420 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 466 transitions. [2018-04-11 17:49:12,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 17:49:12,421 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:49:12,421 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:49:12,421 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:49:12,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1916105459, now seen corresponding path program 1 times [2018-04-11 17:49:12,421 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:49:12,421 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:49:12,422 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:49:12,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:49:12,422 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:49:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:49:12,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:49:12,436 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:49:12,436 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:49:12,436 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:49:12,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:49:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:49:12,454 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:49:12,469 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-11 17:49:12,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:12,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:12,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:49:12,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:12,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:12,488 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-11 17:49:12,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:12,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:12,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-11 17:49:12,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:49:12,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:49:12,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:12,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:12,514 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-11 17:49:12,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-04-11 17:49:12,537 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 34 treesize of output 28 [2018-04-11 17:49:12,540 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-11 17:49:12,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:12,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:12,548 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-11 17:49:12,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:27 [2018-04-11 17:49:12,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-04-11 17:49:12,584 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:49:12,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-04-11 17:49:12,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:12,590 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-11 17:49:12,590 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:12,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:12,597 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-11 17:49:12,597 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:35, output treesize:11 [2018-04-11 17:49:12,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:49:12,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:49:12,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-11 17:49:12,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 17:49:12,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 17:49:12,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-04-11 17:49:12,640 INFO L87 Difference]: Start difference. First operand 398 states and 466 transitions. Second operand 12 states. [2018-04-11 17:49:13,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:49:13,177 INFO L93 Difference]: Finished difference Result 573 states and 674 transitions. [2018-04-11 17:49:13,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 17:49:13,177 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-04-11 17:49:13,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:49:13,178 INFO L225 Difference]: With dead ends: 573 [2018-04-11 17:49:13,178 INFO L226 Difference]: Without dead ends: 573 [2018-04-11 17:49:13,179 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2018-04-11 17:49:13,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-04-11 17:49:13,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 388. [2018-04-11 17:49:13,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-04-11 17:49:13,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 455 transitions. [2018-04-11 17:49:13,181 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 455 transitions. Word has length 51 [2018-04-11 17:49:13,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:49:13,182 INFO L459 AbstractCegarLoop]: Abstraction has 388 states and 455 transitions. [2018-04-11 17:49:13,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 17:49:13,182 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 455 transitions. [2018-04-11 17:49:13,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 17:49:13,182 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:49:13,182 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:49:13,182 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:49:13,182 INFO L82 PathProgramCache]: Analyzing trace with hash -2111877511, now seen corresponding path program 1 times [2018-04-11 17:49:13,182 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:49:13,182 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:49:13,183 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:49:13,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:49:13,183 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:49:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:49:13,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:49:13,190 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:49:13,190 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:49:13,190 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:49:13,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:49:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:49:13,206 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:49:13,207 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-11 17:49:13,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:13,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:13,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 17:49:13,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:13,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:13,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, 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-11 17:49:13,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:13,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:13,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-11 17:49:13,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:49:13,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:49:13,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:13,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:13,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:49:13,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:49:13,244 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:13,246 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:13,251 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-11 17:49:13,251 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2018-04-11 17:49:13,262 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 20 treesize of output 16 [2018-04-11 17:49:13,264 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 16 treesize of output 4 [2018-04-11 17:49:13,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:13,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:13,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:13,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14 [2018-04-11 17:49:13,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-11 17:49:13,288 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-11 17:49:13,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:13,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:13,312 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-11 17:49:13,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:21 [2018-04-11 17:49:13,360 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 26 treesize of output 24 [2018-04-11 17:49:13,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 17:49:13,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:13,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, 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-11 17:49:13,369 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:13,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:13,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:13,373 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:30, output treesize:3 [2018-04-11 17:49:13,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 17:49:13,390 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:49:13,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 17:49:13,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 17:49:13,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 17:49:13,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-04-11 17:49:13,390 INFO L87 Difference]: Start difference. First operand 388 states and 455 transitions. Second operand 10 states. [2018-04-11 17:49:13,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:49:13,886 INFO L93 Difference]: Finished difference Result 574 states and 674 transitions. [2018-04-11 17:49:13,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 17:49:13,886 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-04-11 17:49:13,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:49:13,887 INFO L225 Difference]: With dead ends: 574 [2018-04-11 17:49:13,888 INFO L226 Difference]: Without dead ends: 574 [2018-04-11 17:49:13,888 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2018-04-11 17:49:13,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-04-11 17:49:13,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 388. [2018-04-11 17:49:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-04-11 17:49:13,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 455 transitions. [2018-04-11 17:49:13,891 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 455 transitions. Word has length 51 [2018-04-11 17:49:13,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:49:13,891 INFO L459 AbstractCegarLoop]: Abstraction has 388 states and 455 transitions. [2018-04-11 17:49:13,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 17:49:13,891 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 455 transitions. [2018-04-11 17:49:13,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 17:49:13,891 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:49:13,891 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-11 17:49:13,891 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:49:13,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1367089988, now seen corresponding path program 1 times [2018-04-11 17:49:13,892 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:49:13,892 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:49:13,892 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:49:13,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:49:13,892 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:49:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:49:13,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:49:13,898 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:49:13,898 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:49:13,898 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:49:13,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:49:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:49:13,911 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:49:13,963 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-11 17:49:13,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:13,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:13,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-04-11 17:49:13,986 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-11 17:49:13,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:49:13,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:13,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:14,000 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-11 17:49:14,002 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-11 17:49:14,002 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:14,032 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:14,043 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-11 17:49:14,044 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-04-11 17:49:14,110 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 21 treesize of output 33 [2018-04-11 17:49:14,115 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 22 treesize of output 21 [2018-04-11 17:49:14,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:14,130 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:49:14,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-04-11 17:49:14,133 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-11 17:49:14,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:49:14,174 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 26 treesize of output 36 [2018-04-11 17:49:14,177 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 27 treesize of output 26 [2018-04-11 17:49:14,177 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:14,200 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:14,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 17:49:14,224 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:58, output treesize:100 [2018-04-11 17:49:14,342 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 65 treesize of output 60 [2018-04-11 17:49:14,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:14,346 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-11 17:49:14,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:14,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:14,426 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 61 treesize of output 54 [2018-04-11 17:49:14,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:14,429 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:49:14,429 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 21 treesize of output 37 [2018-04-11 17:49:14,429 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:14,443 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:14,495 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 76 treesize of output 86 [2018-04-11 17:49:14,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:14,499 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 75 treesize of output 82 [2018-04-11 17:49:14,499 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:14,579 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:14,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 80 [2018-04-11 17:49:14,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:14,631 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:49:14,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 85 [2018-04-11 17:49:14,632 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:14,691 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:14,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-11 17:49:14,715 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 10 variables, input treesize:142, output treesize:139 [2018-04-11 17:49:14,804 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 87 treesize of output 81 [2018-04-11 17:49:14,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:14,806 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:49:14,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-11 17:49:14,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:14,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:14,849 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 56 treesize of output 44 [2018-04-11 17:49:14,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:14,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:14,852 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:49:14,852 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2018-04-11 17:49:14,853 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:14,859 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:14,890 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 85 treesize of output 85 [2018-04-11 17:49:14,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:14,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 75 [2018-04-11 17:49:14,893 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:14,931 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:49:14,931 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:49:14,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:14,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2018-04-11 17:49:14,934 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:14,972 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:49:14,972 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 69 treesize of output 65 [2018-04-11 17:49:14,972 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:15,006 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:49:15,047 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 55 treesize of output 53 [2018-04-11 17:49:15,049 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 49 treesize of output 40 [2018-04-11 17:49:15,049 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:15,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:15,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-04-11 17:49:15,074 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:15,093 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:15,096 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 59 treesize of output 49 [2018-04-11 17:49:15,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:49:15,098 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-11 17:49:15,098 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:15,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-04-11 17:49:15,108 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 17:49:15,115 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:49:15,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-11 17:49:15,137 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 13 variables, input treesize:173, output treesize:43 [2018-04-11 17:49:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:49:15,213 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:49:15,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 17:49:15,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 17:49:15,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 17:49:15,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=170, Unknown=4, NotChecked=0, Total=210 [2018-04-11 17:49:15,214 INFO L87 Difference]: Start difference. First operand 388 states and 455 transitions. Second operand 15 states. [2018-04-11 17:49:38,635 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 78 DAG size of output 75 [2018-04-11 17:49:59,977 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 119 DAG size of output 79 [2018-04-11 17:50:00,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:50:00,515 INFO L93 Difference]: Finished difference Result 686 states and 815 transitions. [2018-04-11 17:50:00,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 17:50:00,549 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2018-04-11 17:50:00,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:50:00,550 INFO L225 Difference]: With dead ends: 686 [2018-04-11 17:50:00,550 INFO L226 Difference]: Without dead ends: 686 [2018-04-11 17:50:00,551 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=188, Invalid=790, Unknown=14, NotChecked=0, Total=992 [2018-04-11 17:50:00,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2018-04-11 17:50:00,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 463. [2018-04-11 17:50:00,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-04-11 17:50:00,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 543 transitions. [2018-04-11 17:50:00,554 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 543 transitions. Word has length 51 [2018-04-11 17:50:00,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:50:00,554 INFO L459 AbstractCegarLoop]: Abstraction has 463 states and 543 transitions. [2018-04-11 17:50:00,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 17:50:00,554 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 543 transitions. [2018-04-11 17:50:00,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 17:50:00,555 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:50:00,555 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-11 17:50:00,555 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:50:00,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1367089989, now seen corresponding path program 1 times [2018-04-11 17:50:00,555 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:50:00,556 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:50:00,556 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:50:00,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:50:00,556 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:50:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:50:00,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:50:00,562 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:50:00,562 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:50:00,562 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:50:00,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:50:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:50:00,576 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:50:00,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:50:00,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:00,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:00,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-04-11 17:50:00,602 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-11 17:50:00,603 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-11 17:50:00,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:00,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:00,617 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-11 17:50:00,618 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-11 17:50:00,618 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:00,619 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:00,627 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-11 17:50:00,627 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-04-11 17:50:00,666 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 21 treesize of output 33 [2018-04-11 17:50:00,668 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 22 treesize of output 21 [2018-04-11 17:50:00,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:00,682 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:00,683 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-04-11 17:50:00,684 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-11 17:50:00,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:50:00,725 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 26 treesize of output 36 [2018-04-11 17:50:00,727 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 27 treesize of output 26 [2018-04-11 17:50:00,727 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:00,749 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:00,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 17:50:00,765 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:58, output treesize:100 [2018-04-11 17:50:00,840 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 76 treesize of output 84 [2018-04-11 17:50:00,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:00,843 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:00,843 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 75 treesize of output 89 [2018-04-11 17:50:00,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:00,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:00,950 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 65 treesize of output 58 [2018-04-11 17:50:00,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:00,952 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:00,952 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 21 treesize of output 37 [2018-04-11 17:50:00,952 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:00,965 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:01,003 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 61 treesize of output 56 [2018-04-11 17:50:01,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:01,006 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-11 17:50:01,006 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:01,018 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:01,061 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 72 treesize of output 82 [2018-04-11 17:50:01,063 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:01,064 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:01,066 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 68 treesize of output 80 [2018-04-11 17:50:01,066 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:01,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:01,107 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 67 treesize of output 74 [2018-04-11 17:50:01,107 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:01,129 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:01,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-11 17:50:01,162 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 10 variables, input treesize:142, output treesize:126 [2018-04-11 17:50:01,265 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 85 treesize of output 85 [2018-04-11 17:50:01,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:01,268 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 81 treesize of output 75 [2018-04-11 17:50:01,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:01,345 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:01,346 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 69 treesize of output 65 [2018-04-11 17:50:01,346 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:01,411 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:01,412 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:01,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:01,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2018-04-11 17:50:01,415 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:01,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:50:01,517 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 74 treesize of output 68 [2018-04-11 17:50:01,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:01,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:01,521 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:01,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-04-11 17:50:01,523 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:01,537 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:01,603 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 55 treesize of output 53 [2018-04-11 17:50:01,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:01,605 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 49 treesize of output 43 [2018-04-11 17:50:01,605 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:01,630 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 37 treesize of output 28 [2018-04-11 17:50:01,630 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:01,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:01,661 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:01,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2018-04-11 17:50:01,662 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:01,674 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:01,677 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 59 treesize of output 49 [2018-04-11 17:50:01,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-04-11 17:50:01,679 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:01,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:01,691 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-11 17:50:01,691 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:01,699 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:01,755 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 51 treesize of output 43 [2018-04-11 17:50:01,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:01,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:01,772 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:01,772 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:01,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-04-11 17:50:01,773 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:01,797 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:01,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-11 17:50:01,880 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 14 variables, input treesize:160, output treesize:43 [2018-04-11 17:50:02,045 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:50:02,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:50:02,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 17:50:02,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 17:50:02,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 17:50:02,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=170, Unknown=3, NotChecked=0, Total=210 [2018-04-11 17:50:02,046 INFO L87 Difference]: Start difference. First operand 463 states and 543 transitions. Second operand 15 states. [2018-04-11 17:50:03,360 WARN L151 SmtUtils]: Spent 211ms on a formula simplification. DAG size of input: 113 DAG size of output 88 [2018-04-11 17:50:07,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:50:07,623 INFO L93 Difference]: Finished difference Result 768 states and 899 transitions. [2018-04-11 17:50:07,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 17:50:07,623 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2018-04-11 17:50:07,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:50:07,624 INFO L225 Difference]: With dead ends: 768 [2018-04-11 17:50:07,624 INFO L226 Difference]: Without dead ends: 768 [2018-04-11 17:50:07,625 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=155, Invalid=647, Unknown=10, NotChecked=0, Total=812 [2018-04-11 17:50:07,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2018-04-11 17:50:07,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 590. [2018-04-11 17:50:07,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-04-11 17:50:07,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 693 transitions. [2018-04-11 17:50:07,628 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 693 transitions. Word has length 51 [2018-04-11 17:50:07,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:50:07,628 INFO L459 AbstractCegarLoop]: Abstraction has 590 states and 693 transitions. [2018-04-11 17:50:07,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 17:50:07,628 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 693 transitions. [2018-04-11 17:50:07,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 17:50:07,629 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:50:07,629 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-11 17:50:07,629 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:50:07,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1453759548, now seen corresponding path program 1 times [2018-04-11 17:50:07,629 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:50:07,629 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:50:07,630 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:50:07,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:50:07,630 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:50:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:50:07,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:50:07,635 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:50:07,635 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:50:07,635 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:50:07,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:50:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:50:07,644 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:50:07,664 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-11 17:50:07,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:07,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:07,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-04-11 17:50:07,680 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-11 17:50:07,682 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-11 17:50:07,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:07,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:07,695 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-11 17:50:07,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-11 17:50:07,704 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:07,705 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:07,714 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-11 17:50:07,715 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-04-11 17:50:07,771 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 21 treesize of output 33 [2018-04-11 17:50:07,773 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 22 treesize of output 21 [2018-04-11 17:50:07,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:07,788 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:07,789 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-04-11 17:50:07,789 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-11 17:50:07,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:50:07,826 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 26 treesize of output 36 [2018-04-11 17:50:07,828 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 27 treesize of output 26 [2018-04-11 17:50:07,828 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:07,842 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:07,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 17:50:07,857 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:58, output treesize:100 [2018-04-11 17:50:07,911 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 65 treesize of output 58 [2018-04-11 17:50:07,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:07,913 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:07,913 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 21 treesize of output 37 [2018-04-11 17:50:07,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:07,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:07,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 86 [2018-04-11 17:50:07,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:07,985 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 75 treesize of output 82 [2018-04-11 17:50:07,986 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:08,030 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:08,079 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 72 treesize of output 80 [2018-04-11 17:50:08,082 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:08,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:08,083 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:08,083 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 66 treesize of output 87 [2018-04-11 17:50:08,083 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:08,123 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:08,123 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:08,124 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 67 treesize of output 81 [2018-04-11 17:50:08,124 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:08,149 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:08,181 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 61 treesize of output 56 [2018-04-11 17:50:08,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:08,184 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-11 17:50:08,184 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:08,200 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:08,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-11 17:50:08,225 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 10 variables, input treesize:142, output treesize:126 [2018-04-11 17:50:08,336 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 74 treesize of output 68 [2018-04-11 17:50:08,338 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:08,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:08,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-04-11 17:50:08,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:08,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:08,387 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 51 treesize of output 43 [2018-04-11 17:50:08,389 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:08,389 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:08,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-04-11 17:50:08,390 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:08,398 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:08,428 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 85 treesize of output 85 [2018-04-11 17:50:08,431 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:08,431 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 81 treesize of output 77 [2018-04-11 17:50:08,431 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:08,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:08,473 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 74 treesize of output 68 [2018-04-11 17:50:08,473 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:08,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:08,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:08,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:08,511 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:08,511 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:08,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 85 [2018-04-11 17:50:08,514 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:08,552 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:50:08,596 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 58 treesize of output 56 [2018-04-11 17:50:08,598 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:08,598 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 52 treesize of output 46 [2018-04-11 17:50:08,599 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:08,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:08,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:08,629 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:08,629 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:08,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2018-04-11 17:50:08,629 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:08,650 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:08,652 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 52 [2018-04-11 17:50:08,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:08,654 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-11 17:50:08,654 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:08,665 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:08,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-04-11 17:50:08,665 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:08,674 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:08,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-11 17:50:08,700 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 14 variables, input treesize:160, output treesize:43 [2018-04-11 17:50:08,771 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:50:08,772 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:50:08,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 17:50:08,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 17:50:08,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 17:50:08,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=171, Unknown=3, NotChecked=0, Total=210 [2018-04-11 17:50:08,772 INFO L87 Difference]: Start difference. First operand 590 states and 693 transitions. Second operand 15 states. [2018-04-11 17:50:11,837 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 118 DAG size of output 92 [2018-04-11 17:50:13,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:50:13,742 INFO L93 Difference]: Finished difference Result 734 states and 859 transitions. [2018-04-11 17:50:13,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 17:50:13,742 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2018-04-11 17:50:13,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:50:13,744 INFO L225 Difference]: With dead ends: 734 [2018-04-11 17:50:13,744 INFO L226 Difference]: Without dead ends: 734 [2018-04-11 17:50:13,744 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=191, Invalid=793, Unknown=8, NotChecked=0, Total=992 [2018-04-11 17:50:13,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-04-11 17:50:13,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 525. [2018-04-11 17:50:13,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-04-11 17:50:13,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 617 transitions. [2018-04-11 17:50:13,747 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 617 transitions. Word has length 51 [2018-04-11 17:50:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:50:13,747 INFO L459 AbstractCegarLoop]: Abstraction has 525 states and 617 transitions. [2018-04-11 17:50:13,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 17:50:13,748 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 617 transitions. [2018-04-11 17:50:13,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 17:50:13,748 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:50:13,748 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:50:13,748 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:50:13,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1043693160, now seen corresponding path program 1 times [2018-04-11 17:50:13,748 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:50:13,748 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:50:13,749 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:50:13,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:50:13,749 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:50:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:50:13,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:50:13,758 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:50:13,758 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:50:13,758 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:50:13,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:50:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:50:13,777 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:50:13,783 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-11 17:50:13,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:13,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:13,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 17:50:13,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:13,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:13,794 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-11 17:50:13,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:13,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:13,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-11 17:50:13,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:50:13,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:50:13,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:13,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:13,820 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-11 17:50:13,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-04-11 17:50:13,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-11 17:50:13,851 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-11 17:50:13,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:13,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:13,863 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-11 17:50:13,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-04-11 17:50:13,907 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 44 treesize of output 30 [2018-04-11 17:50:13,908 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-11 17:50:13,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:13,915 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 25 treesize of output 10 [2018-04-11 17:50:13,915 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:13,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:13,923 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-11 17:50:13,923 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:15 [2018-04-11 17:50:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 17:50:13,948 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:50:13,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 17:50:13,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 17:50:13,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 17:50:13,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-04-11 17:50:13,949 INFO L87 Difference]: Start difference. First operand 525 states and 617 transitions. Second operand 10 states. [2018-04-11 17:50:14,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:50:14,323 INFO L93 Difference]: Finished difference Result 734 states and 866 transitions. [2018-04-11 17:50:14,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 17:50:14,323 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-04-11 17:50:14,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:50:14,324 INFO L225 Difference]: With dead ends: 734 [2018-04-11 17:50:14,324 INFO L226 Difference]: Without dead ends: 734 [2018-04-11 17:50:14,324 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2018-04-11 17:50:14,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-04-11 17:50:14,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 535. [2018-04-11 17:50:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-04-11 17:50:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 628 transitions. [2018-04-11 17:50:14,328 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 628 transitions. Word has length 52 [2018-04-11 17:50:14,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:50:14,328 INFO L459 AbstractCegarLoop]: Abstraction has 535 states and 628 transitions. [2018-04-11 17:50:14,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 17:50:14,328 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 628 transitions. [2018-04-11 17:50:14,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 17:50:14,328 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:50:14,328 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] [2018-04-11 17:50:14,328 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:50:14,329 INFO L82 PathProgramCache]: Analyzing trace with hash -159918722, now seen corresponding path program 1 times [2018-04-11 17:50:14,329 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:50:14,329 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:50:14,329 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:50:14,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:50:14,329 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:50:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:50:14,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:50:14,336 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:50:14,336 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:50:14,336 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:50:14,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:50:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:50:14,346 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:50:14,364 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-11 17:50:14,365 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-11 17:50:14,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:14,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:14,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:14,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-04-11 17:50:14,375 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 17 treesize of output 13 [2018-04-11 17:50:14,379 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-11 17:50:14,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 17:50:14,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:50:14,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:50:14,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:10 [2018-04-11 17:50:14,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 17:50:14,403 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:50:14,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 17:50:14,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 17:50:14,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 17:50:14,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-11 17:50:14,403 INFO L87 Difference]: Start difference. First operand 535 states and 628 transitions. Second operand 8 states. [2018-04-11 17:50:14,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:50:14,539 INFO L93 Difference]: Finished difference Result 759 states and 894 transitions. [2018-04-11 17:50:14,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 17:50:14,540 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-04-11 17:50:14,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:50:14,541 INFO L225 Difference]: With dead ends: 759 [2018-04-11 17:50:14,541 INFO L226 Difference]: Without dead ends: 731 [2018-04-11 17:50:14,541 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-04-11 17:50:14,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-04-11 17:50:14,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 685. [2018-04-11 17:50:14,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2018-04-11 17:50:14,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 820 transitions. [2018-04-11 17:50:14,545 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 820 transitions. Word has length 53 [2018-04-11 17:50:14,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:50:14,545 INFO L459 AbstractCegarLoop]: Abstraction has 685 states and 820 transitions. [2018-04-11 17:50:14,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 17:50:14,545 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 820 transitions. [2018-04-11 17:50:14,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 17:50:14,546 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:50:14,546 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-11 17:50:14,546 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:50:14,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1417636850, now seen corresponding path program 1 times [2018-04-11 17:50:14,546 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:50:14,546 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:50:14,547 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:50:14,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:50:14,547 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:50:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:50:14,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:50:14,555 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:50:14,555 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:50:14,555 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:50:14,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:50:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:50:14,570 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:50:14,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, 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-11 17:50:14,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:14,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:14,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:50:14,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:14,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:14,606 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-11 17:50:14,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:14,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:14,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 17:50:14,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:50:14,627 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-11 17:50:14,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:14,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:14,638 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-11 17:50:14,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:35 [2018-04-11 17:50:14,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:14,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-04-11 17:50:14,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:50:14,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:14,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:14,687 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-11 17:50:14,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:42 [2018-04-11 17:50:14,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:14,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:14,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:14,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:14,707 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 16 treesize of output 20 [2018-04-11 17:50:14,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:14,715 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-11 17:50:14,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-04-11 17:50:14,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:14,733 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 36 treesize of output 35 [2018-04-11 17:50:14,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:14,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 17:50:14,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:14,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:14,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:14,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:57 [2018-04-11 17:50:14,790 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 92 treesize of output 73 [2018-04-11 17:50:14,792 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-11 17:50:14,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:14,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:14,810 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-11 17:50:14,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:101, output treesize:87 [2018-04-11 17:50:14,951 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 66 [2018-04-11 17:50:14,952 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-11 17:50:14,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:14,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:14,960 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:14,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-04-11 17:50:14,960 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:14,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:14,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-04-11 17:50:14,968 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:14,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:14,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:14,975 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:106, output treesize:5 [2018-04-11 17:50:15,009 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:50:15,009 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:50:15,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 17:50:15,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 17:50:15,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 17:50:15,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-04-11 17:50:15,010 INFO L87 Difference]: Start difference. First operand 685 states and 820 transitions. Second operand 20 states. [2018-04-11 17:50:16,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:50:16,583 INFO L93 Difference]: Finished difference Result 963 states and 1143 transitions. [2018-04-11 17:50:16,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 17:50:16,583 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2018-04-11 17:50:16,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:50:16,585 INFO L225 Difference]: With dead ends: 963 [2018-04-11 17:50:16,585 INFO L226 Difference]: Without dead ends: 963 [2018-04-11 17:50:16,586 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=359, Invalid=1446, Unknown=1, NotChecked=0, Total=1806 [2018-04-11 17:50:16,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-04-11 17:50:16,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 754. [2018-04-11 17:50:16,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2018-04-11 17:50:16,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 898 transitions. [2018-04-11 17:50:16,591 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 898 transitions. Word has length 54 [2018-04-11 17:50:16,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:50:16,591 INFO L459 AbstractCegarLoop]: Abstraction has 754 states and 898 transitions. [2018-04-11 17:50:16,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 17:50:16,591 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 898 transitions. [2018-04-11 17:50:16,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 17:50:16,592 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:50:16,592 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-11 17:50:16,592 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:50:16,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1417636851, now seen corresponding path program 1 times [2018-04-11 17:50:16,592 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:50:16,592 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:50:16,593 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:50:16,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:50:16,593 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:50:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:50:16,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:50:16,601 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:50:16,601 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:50:16,601 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:50:16,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:50:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:50:16,615 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:50:16,628 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-11 17:50:16,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:16,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:16,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:50:16,649 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-11 17:50:16,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:16,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:16,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:16,662 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-11 17:50:16,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:16,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:16,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-11 17:50:16,687 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-11 17:50:16,689 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-11 17:50:16,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:16,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:16,706 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-11 17:50:16,708 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-11 17:50:16,708 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:16,710 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:16,722 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-11 17:50:16,722 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:51 [2018-04-11 17:50:16,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:16,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-11 17:50:16,781 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-11 17:50:16,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:16,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:16,807 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:16,810 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 56 treesize of output 57 [2018-04-11 17:50:16,819 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-11 17:50:16,820 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:16,828 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:16,842 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-11 17:50:16,842 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:82, output treesize:69 [2018-04-11 17:50:16,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:16,864 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-11 17:50:16,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:16,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:16,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:16,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:16,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 49 [2018-04-11 17:50:16,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:16,912 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-11 17:50:16,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:95 [2018-04-11 17:50:16,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2018-04-11 17:50:16,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:16,948 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-11 17:50:16,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:16,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:16,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:16,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 85 [2018-04-11 17:50:16,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:16,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 17:50:16,991 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:17,003 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:17,023 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-11 17:50:17,023 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:126, output treesize:115 [2018-04-11 17:50:17,079 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 173 treesize of output 138 [2018-04-11 17:50:17,081 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-11 17:50:17,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:17,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:17,127 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 50 treesize of output 77 [2018-04-11 17:50:17,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 18 treesize of output 17 [2018-04-11 17:50:17,129 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:17,135 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:17,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:17,156 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:194, output treesize:166 [2018-04-11 17:50:17,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-04-11 17:50:17,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:17,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:17,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:166, output treesize:137 [2018-04-11 17:50:17,268 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 88 [2018-04-11 17:50:17,269 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-11 17:50:17,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:17,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:17,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 29 [2018-04-11 17:50:17,282 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-11 17:50:17,292 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:17,292 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 34 treesize of output 24 [2018-04-11 17:50:17,292 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:17,299 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-11 17:50:17,314 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 29 treesize of output 33 [2018-04-11 17:50:17,315 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-11 17:50:17,315 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:17,320 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:17,320 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-11 17:50:17,321 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:17,324 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-11 17:50:17,324 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:17,325 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:17,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:17,334 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:154, output treesize:18 [2018-04-11 17:50:17,383 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:50:17,383 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:50:17,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 17:50:17,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 17:50:17,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 17:50:17,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=249, Unknown=6, NotChecked=0, Total=306 [2018-04-11 17:50:17,384 INFO L87 Difference]: Start difference. First operand 754 states and 898 transitions. Second operand 18 states. [2018-04-11 17:50:19,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:50:19,391 INFO L93 Difference]: Finished difference Result 1034 states and 1229 transitions. [2018-04-11 17:50:19,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 17:50:19,391 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2018-04-11 17:50:19,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:50:19,393 INFO L225 Difference]: With dead ends: 1034 [2018-04-11 17:50:19,393 INFO L226 Difference]: Without dead ends: 1034 [2018-04-11 17:50:19,393 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=226, Invalid=951, Unknown=13, NotChecked=0, Total=1190 [2018-04-11 17:50:19,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2018-04-11 17:50:19,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 784. [2018-04-11 17:50:19,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2018-04-11 17:50:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 938 transitions. [2018-04-11 17:50:19,398 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 938 transitions. Word has length 54 [2018-04-11 17:50:19,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:50:19,398 INFO L459 AbstractCegarLoop]: Abstraction has 784 states and 938 transitions. [2018-04-11 17:50:19,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 17:50:19,398 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 938 transitions. [2018-04-11 17:50:19,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-11 17:50:19,399 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:50:19,399 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:50:19,399 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:50:19,399 INFO L82 PathProgramCache]: Analyzing trace with hash -277764453, now seen corresponding path program 1 times [2018-04-11 17:50:19,399 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:50:19,399 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:50:19,399 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:50:19,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:50:19,399 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:50:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:50:19,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:50:19,407 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:50:19,407 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:50:19,407 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:50:19,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:50:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:50:19,424 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:50:19,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:50:19,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:50:19,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:19,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:19,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:50:19,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:50:19,460 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:19,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:19,467 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-11 17:50:19,467 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:13 [2018-04-11 17:50:19,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2018-04-11 17:50:19,498 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 48 treesize of output 47 [2018-04-11 17:50:19,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:19,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:19,533 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 42 treesize of output 58 [2018-04-11 17:50:19,535 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 43 treesize of output 42 [2018-04-11 17:50:19,535 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:19,556 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:19,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:19,562 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:68, output treesize:48 [2018-04-11 17:50:19,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-04-11 17:50:19,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-04-11 17:50:19,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:19,706 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-11 17:50:19,706 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:19,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:19,712 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-11 17:50:19,712 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:26 [2018-04-11 17:50:19,776 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 29 treesize of output 24 [2018-04-11 17:50:19,777 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-11 17:50:19,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:19,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2018-04-11 17:50:19,783 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 17:50:19,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:50:19,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:50:19,788 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:37, output treesize:23 [2018-04-11 17:50:19,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:19,804 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 25 [2018-04-11 17:50:19,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:19,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:19,816 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 2 case distinctions, treesize of input 16 treesize of output 19 [2018-04-11 17:50:19,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 17:50:19,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 17:50:19,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:37 [2018-04-11 17:50:19,876 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-11 17:50:19,876 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:50:19,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 17:50:19,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 17:50:19,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 17:50:19,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-04-11 17:50:19,877 INFO L87 Difference]: Start difference. First operand 784 states and 938 transitions. Second operand 20 states. [2018-04-11 17:50:21,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:50:21,198 INFO L93 Difference]: Finished difference Result 1078 states and 1301 transitions. [2018-04-11 17:50:21,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 17:50:21,223 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2018-04-11 17:50:21,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:50:21,225 INFO L225 Difference]: With dead ends: 1078 [2018-04-11 17:50:21,225 INFO L226 Difference]: Without dead ends: 1078 [2018-04-11 17:50:21,225 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=361, Invalid=1199, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 17:50:21,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2018-04-11 17:50:21,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 786. [2018-04-11 17:50:21,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2018-04-11 17:50:21,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 940 transitions. [2018-04-11 17:50:21,231 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 940 transitions. Word has length 56 [2018-04-11 17:50:21,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:50:21,231 INFO L459 AbstractCegarLoop]: Abstraction has 786 states and 940 transitions. [2018-04-11 17:50:21,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 17:50:21,231 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 940 transitions. [2018-04-11 17:50:21,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 17:50:21,232 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:50:21,232 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:50:21,232 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:50:21,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1506285837, now seen corresponding path program 2 times [2018-04-11 17:50:21,232 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:50:21,232 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:50:21,233 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:50:21,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:50:21,233 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:50:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:50:21,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:50:21,252 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:50:21,253 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:50:21,253 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:50:21,253 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 17:50:21,286 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 17:50:21,286 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:50:21,289 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:50:21,291 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-11 17:50:21,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:21,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:21,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:50:21,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:21,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:21,303 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-11 17:50:21,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:21,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:21,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-11 17:50:21,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:50:21,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:50:21,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:21,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:21,324 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-11 17:50:21,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-11 17:50:21,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-11 17:50:21,344 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-11 17:50:21,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:21,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:21,352 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-11 17:50:21,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-11 17:50:21,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:21,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:21,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:21,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 55 [2018-04-11 17:50:21,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:21,390 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-11 17:50:21,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:63, output treesize:71 [2018-04-11 17:50:21,416 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 56 treesize of output 59 [2018-04-11 17:50:21,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:21,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 68 [2018-04-11 17:50:21,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:21,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:21,441 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-11 17:50:21,442 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-11 17:50:21,442 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:21,444 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:21,457 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-11 17:50:21,457 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:93, output treesize:87 [2018-04-11 17:50:21,481 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-11 17:50:21,483 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-11 17:50:21,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:21,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:21,494 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-11 17:50:21,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:91, output treesize:80 [2018-04-11 17:50:21,556 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 95 [2018-04-11 17:50:21,560 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 17:50:21,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:21,690 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-11 17:50:21,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:21,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 87 [2018-04-11 17:50:21,759 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:50:21,834 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 74 treesize of output 73 [2018-04-11 17:50:21,834 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:21,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 17:50:21,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-04-11 17:50:21,918 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:94, output treesize:277 [2018-04-11 17:50:22,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:22,018 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 89 [2018-04-11 17:50:22,020 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:22,020 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:22,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 60 treesize of output 50 [2018-04-11 17:50:22,022 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-11 17:50:22,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:22,099 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 119 [2018-04-11 17:50:22,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:22,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:22,105 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:22,108 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 1 case distinctions, treesize of input 95 treesize of output 107 [2018-04-11 17:50:22,108 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:22,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:22,263 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 2 case distinctions, treesize of input 99 treesize of output 114 [2018-04-11 17:50:22,263 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 17:50:22,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:22,529 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 98 treesize of output 105 [2018-04-11 17:50:22,529 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:22,632 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 17:50:22,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2018-04-11 17:50:22,733 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:195, output treesize:449 [2018-04-11 17:50:22,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 107 [2018-04-11 17:50:22,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:22,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 72 [2018-04-11 17:50:22,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:22,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-11 17:50:22,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:178, output treesize:176 [2018-04-11 17:50:22,974 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 90 treesize of output 87 [2018-04-11 17:50:22,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:22,978 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 21 treesize of output 23 [2018-04-11 17:50:22,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:23,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:23,061 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 79 treesize of output 76 [2018-04-11 17:50:23,063 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-11 17:50:23,063 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:23,080 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:23,082 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 129 treesize of output 126 [2018-04-11 17:50:23,084 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-11 17:50:23,084 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:23,117 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:23,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:23,190 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 3 case distinctions, treesize of input 125 treesize of output 140 [2018-04-11 17:50:23,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:23,195 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 132 treesize of output 134 [2018-04-11 17:50:23,195 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:23,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:23,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 127 [2018-04-11 17:50:23,288 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-11 17:50:23,347 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:50:23,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-04-11 17:50:23,413 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 10 variables, input treesize:220, output treesize:282 [2018-04-11 17:50:23,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 70 treesize of output 66 [2018-04-11 17:50:23,493 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-11 17:50:23,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:23,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:23,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 132 treesize of output 116 [2018-04-11 17:50:23,567 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-11 17:50:23,567 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:23,581 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:23,630 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 115 treesize of output 111 [2018-04-11 17:50:23,631 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-11 17:50:23,631 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:23,646 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:23,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-04-11 17:50:23,691 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:318, output treesize:273 [2018-04-11 17:50:23,877 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 131 [2018-04-11 17:50:23,881 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 134 treesize of output 133 [2018-04-11 17:50:23,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:24,081 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:24,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 133 [2018-04-11 17:50:24,089 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:50:24,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:24,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:24,235 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:24,237 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 127 [2018-04-11 17:50:24,237 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:24,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-04-11 17:50:24,687 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 6 case distinctions, treesize of input 73 treesize of output 98 [2018-04-11 17:50:24,690 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 78 treesize of output 77 [2018-04-11 17:50:24,690 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:24,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:24,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:24,804 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:24,806 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 83 [2018-04-11 17:50:24,806 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:24,980 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-11 17:50:25,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:25,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 118 treesize of output 153 [2018-04-11 17:50:25,259 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 17:50:25,268 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 17:50:25,268 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:25,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:25,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:25,767 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:25,769 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 138 [2018-04-11 17:50:25,770 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:27,087 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 115 treesize of output 114 [2018-04-11 17:50:27,087 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:27,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:27,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:27,335 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:27,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 115 treesize of output 139 [2018-04-11 17:50:27,343 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:50:27,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:27,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 128 [2018-04-11 17:50:27,604 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:50:27,853 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-0 vars, 8 dim-1 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-04-11 17:50:28,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-2 vars, End of recursive call: 50 dim-0 vars, and 16 xjuncts. [2018-04-11 17:50:28,377 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 12 variables, input treesize:315, output treesize:1686 [2018-04-11 17:50:34,503 WARN L151 SmtUtils]: Spent 4235ms on a formula simplification. DAG size of input: 447 DAG size of output 196 [2018-04-11 17:50:34,557 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 6 case distinctions, treesize of input 82 treesize of output 101 [2018-04-11 17:50:34,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:34,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 92 [2018-04-11 17:50:34,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:34,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:34,661 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 2 case distinctions, treesize of input 78 treesize of output 93 [2018-04-11 17:50:34,662 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 17:50:34,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:50:35,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:35,593 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:35,598 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 3 case distinctions, treesize of input 112 treesize of output 115 [2018-04-11 17:50:35,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:35,602 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 23 treesize of output 23 [2018-04-11 17:50:35,602 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:35,618 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:36,171 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:36,172 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 70 treesize of output 63 [2018-04-11 17:50:36,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:36,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-04-11 17:50:36,175 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:36,186 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:36,638 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 134 [2018-04-11 17:50:36,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:36,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 148 [2018-04-11 17:50:36,643 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:36,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:36,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:36,741 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:36,744 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 1 case distinctions, treesize of input 112 treesize of output 120 [2018-04-11 17:50:36,745 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:36,821 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 17:50:37,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:37,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 127 treesize of output 156 [2018-04-11 17:50:37,317 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:37,993 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:37,994 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 122 treesize of output 129 [2018-04-11 17:50:37,994 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:38,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:38,202 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 2 case distinctions, treesize of input 127 treesize of output 142 [2018-04-11 17:50:38,202 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-04-11 17:50:38,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:38,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:38,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:38,370 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:38,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 131 [2018-04-11 17:50:38,374 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:38,533 INFO L267 ElimStorePlain]: Start of recursive call 12: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-04-11 17:50:39,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:39,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:39,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:39,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 125 [2018-04-11 17:50:39,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:39,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:39,186 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:39,188 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 71 treesize of output 64 [2018-04-11 17:50:39,188 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-11 17:50:39,210 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:39,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:39,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:39,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 118 [2018-04-11 17:50:39,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:39,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:39,771 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:39,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 75 [2018-04-11 17:50:39,774 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:39,793 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:40,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 30 dim-0 vars, 7 dim-2 vars, End of recursive call: 60 dim-0 vars, and 14 xjuncts. [2018-04-11 17:50:40,280 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 37 variables, input treesize:753, output treesize:1417 [2018-04-11 17:50:46,786 WARN L151 SmtUtils]: Spent 271ms on a formula simplification. DAG size of input: 482 DAG size of output 163 [2018-04-11 17:50:46,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:46,951 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 1 case distinctions, treesize of input 120 treesize of output 100 [2018-04-11 17:50:46,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:46,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 91 [2018-04-11 17:50:46,954 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-11 17:50:46,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 72 [2018-04-11 17:50:46,996 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-11 17:50:47,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:47,035 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 68 treesize of output 62 [2018-04-11 17:50:47,035 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:47,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 81 [2018-04-11 17:50:47,070 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:47,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:47,108 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:47,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:47,109 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:47,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73 [2018-04-11 17:50:47,111 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:47,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 17:50:47,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:47,254 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 1 case distinctions, treesize of input 95 treesize of output 83 [2018-04-11 17:50:47,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:47,261 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 1 case distinctions, treesize of input 75 treesize of output 74 [2018-04-11 17:50:47,262 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-11 17:50:47,319 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 79 treesize of output 74 [2018-04-11 17:50:47,319 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:47,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 61 [2018-04-11 17:50:47,367 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:47,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:47,413 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 57 treesize of output 51 [2018-04-11 17:50:47,413 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:47,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2018-04-11 17:50:47,456 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:47,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2018-04-11 17:50:47,458 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:47,497 INFO L267 ElimStorePlain]: Start of recursive call 8: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-11 17:50:47,629 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 66 treesize of output 58 [2018-04-11 17:50:47,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:47,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2018-04-11 17:50:47,632 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:47,642 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-11 17:50:47,642 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:47,649 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:47,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:47,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:47,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 67 [2018-04-11 17:50:47,784 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2018-04-11 17:50:47,785 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-11 17:50:47,799 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:47,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 17:50:47,800 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:47,809 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:47,937 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 2 case distinctions, treesize of input 80 treesize of output 88 [2018-04-11 17:50:47,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:47,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2018-04-11 17:50:47,940 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:48,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:48,023 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 1 case distinctions, treesize of input 72 treesize of output 71 [2018-04-11 17:50:48,023 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-04-11 17:50:48,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2018-04-11 17:50:48,114 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:48,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 52 [2018-04-11 17:50:48,116 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:48,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:48,195 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:48,195 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:48,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2018-04-11 17:50:48,198 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:48,275 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 49 treesize of output 44 [2018-04-11 17:50:48,275 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:48,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 55 [2018-04-11 17:50:48,329 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:48,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 55 treesize of output 50 [2018-04-11 17:50:48,378 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:48,477 INFO L267 ElimStorePlain]: Start of recursive call 21: 8 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-11 17:50:48,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 25 dim-0 vars, 5 dim-2 vars, End of recursive call: 27 dim-0 vars, and 11 xjuncts. [2018-04-11 17:50:48,638 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 30 variables, input treesize:439, output treesize:348 [2018-04-11 17:50:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:50:48,771 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:50:48,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 17:50:48,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 17:50:48,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 17:50:48,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=419, Unknown=4, NotChecked=0, Total=506 [2018-04-11 17:50:48,772 INFO L87 Difference]: Start difference. First operand 786 states and 940 transitions. Second operand 23 states. [2018-04-11 17:50:51,261 WARN L151 SmtUtils]: Spent 987ms on a formula simplification. DAG size of input: 253 DAG size of output 245 [2018-04-11 17:50:51,533 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 97 DAG size of output 97 [2018-04-11 17:50:51,711 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 124 DAG size of output 99 [2018-04-11 17:50:52,300 WARN L151 SmtUtils]: Spent 334ms on a formula simplification. DAG size of input: 207 DAG size of output 207 [2018-04-11 17:50:52,863 WARN L151 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 174 DAG size of output 174 [2018-04-11 17:50:53,603 WARN L151 SmtUtils]: Spent 625ms on a formula simplification. DAG size of input: 270 DAG size of output 248 [2018-04-11 17:50:54,390 WARN L151 SmtUtils]: Spent 507ms on a formula simplification. DAG size of input: 248 DAG size of output 240 [2018-04-11 17:50:54,947 WARN L151 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 191 DAG size of output 177 [2018-04-11 17:50:55,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:50:55,174 INFO L93 Difference]: Finished difference Result 1205 states and 1444 transitions. [2018-04-11 17:50:55,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 17:50:55,174 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 59 [2018-04-11 17:50:55,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:50:55,176 INFO L225 Difference]: With dead ends: 1205 [2018-04-11 17:50:55,176 INFO L226 Difference]: Without dead ends: 1205 [2018-04-11 17:50:55,177 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=349, Invalid=1809, Unknown=4, NotChecked=0, Total=2162 [2018-04-11 17:50:55,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2018-04-11 17:50:55,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 814. [2018-04-11 17:50:55,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2018-04-11 17:50:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 974 transitions. [2018-04-11 17:50:55,181 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 974 transitions. Word has length 59 [2018-04-11 17:50:55,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:50:55,181 INFO L459 AbstractCegarLoop]: Abstraction has 814 states and 974 transitions. [2018-04-11 17:50:55,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 17:50:55,182 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 974 transitions. [2018-04-11 17:50:55,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 17:50:55,182 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:50:55,182 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:50:55,182 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr61AssertViolationMEMORY_FREE, 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, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:50:55,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1506285836, now seen corresponding path program 2 times [2018-04-11 17:50:55,182 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:50:55,182 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:50:55,183 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:50:55,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:50:55,183 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:50:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:50:55,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:50:55,194 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:50:55,194 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:50:55,194 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:50:55,195 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 17:50:55,213 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 17:50:55,213 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:50:55,215 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:50:55,231 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-11 17:50:55,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:55,241 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-11 17:50:55,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:55,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:55,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 17:50:55,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:55,257 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-11 17:50:55,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:55,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:55,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:55,268 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-11 17:50:55,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:55,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:55,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-04-11 17:50:55,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:50:55,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:50:55,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:55,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:55,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:50:55,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:50:55,306 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:55,307 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:55,318 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-11 17:50:55,318 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:55 [2018-04-11 17:50:55,353 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 79 treesize of output 73 [2018-04-11 17:50:55,354 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-11 17:50:55,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:55,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:55,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-04-11 17:50:55,384 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-11 17:50:55,384 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:55,390 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:55,405 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-11 17:50:55,405 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:113, output treesize:93 [2018-04-11 17:50:55,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:55,452 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:55,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 17:50:55,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:55,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:55,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:55,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:55,477 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 22 treesize of output 32 [2018-04-11 17:50:55,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:55,494 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-11 17:50:55,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:110, output treesize:102 [2018-04-11 17:50:55,523 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 43 treesize of output 46 [2018-04-11 17:50:55,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:55,526 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 23 treesize of output 32 [2018-04-11 17:50:55,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:55,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:55,560 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 59 [2018-04-11 17:50:55,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:55,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 71 [2018-04-11 17:50:55,562 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:55,570 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:55,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:55,590 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:126, output treesize:116 [2018-04-11 17:50:55,638 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 90 [2018-04-11 17:50:55,648 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 55 treesize of output 56 [2018-04-11 17:50:55,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:55,738 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 40 treesize of output 39 [2018-04-11 17:50:55,739 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:55,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:55,796 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 106 [2018-04-11 17:50:55,799 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 101 treesize of output 100 [2018-04-11 17:50:55,800 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:55,891 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:56,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 79 [2018-04-11 17:50:56,004 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-11 17:50:56,136 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-11 17:50:56,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-04-11 17:50:56,217 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:141, output treesize:511 [2018-04-11 17:50:56,388 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 143 DAG size of output 113 [2018-04-11 17:50:56,535 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:56,537 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 150 treesize of output 148 [2018-04-11 17:50:56,539 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:56,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:56,540 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:56,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2018-04-11 17:50:56,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:56,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:56,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:56,656 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 132 [2018-04-11 17:50:56,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:56,658 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:56,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 71 treesize of output 57 [2018-04-11 17:50:56,661 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:56,681 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:56,787 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 166 treesize of output 197 [2018-04-11 17:50:56,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:56,792 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 175 treesize of output 182 [2018-04-11 17:50:56,792 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:56,912 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:57,007 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 162 treesize of output 176 [2018-04-11 17:50:57,012 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:57,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:57,014 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 162 treesize of output 167 [2018-04-11 17:50:57,014 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:57,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:57,265 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 157 treesize of output 164 [2018-04-11 17:50:57,265 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:57,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:57,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:57,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:57,498 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:57,503 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 1 case distinctions, treesize of input 135 treesize of output 147 [2018-04-11 17:50:57,503 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:57,615 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:50:57,722 INFO L267 ElimStorePlain]: Start of recursive call 8: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 17:50:57,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 11 dim-0 vars, and 4 xjuncts. [2018-04-11 17:50:57,851 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:317, output treesize:535 [2018-04-11 17:50:57,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:58,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 116 [2018-04-11 17:50:58,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:58,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:58,071 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:58,071 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 169 treesize of output 170 [2018-04-11 17:50:58,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:58,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:58,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 163 treesize of output 199 [2018-04-11 17:50:58,156 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-11 17:50:58,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:58,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:58,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 109 [2018-04-11 17:50:58,316 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:58,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-1 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-04-11 17:50:58,437 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:279, output treesize:441 [2018-04-11 17:50:58,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 188 [2018-04-11 17:50:58,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:58,574 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 21 treesize of output 23 [2018-04-11 17:50:58,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:58,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:58,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 180 [2018-04-11 17:50:58,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:58,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 21 treesize of output 23 [2018-04-11 17:50:58,806 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:58,837 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:58,999 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 124 treesize of output 119 [2018-04-11 17:50:59,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:59,003 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 26 treesize of output 26 [2018-04-11 17:50:59,003 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:59,032 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:59,184 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 109 treesize of output 106 [2018-04-11 17:50:59,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:59,187 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:59,188 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 21 treesize of output 36 [2018-04-11 17:50:59,189 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:59,213 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:59,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:59,365 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 3 case distinctions, treesize of input 184 treesize of output 218 [2018-04-11 17:50:59,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:59,371 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 201 treesize of output 203 [2018-04-11 17:50:59,371 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:59,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:59,493 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:59,494 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 166 treesize of output 171 [2018-04-11 17:50:59,495 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:59,596 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:50:59,781 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 155 treesize of output 146 [2018-04-11 17:50:59,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:59,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:59,785 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:50:59,787 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 21 treesize of output 35 [2018-04-11 17:50:59,788 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:59,820 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:50:59,822 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:59,840 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 3 case distinctions, treesize of input 173 treesize of output 188 [2018-04-11 17:50:59,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:59,847 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 180 treesize of output 182 [2018-04-11 17:50:59,847 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 17:50:59,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:50:59,956 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 162 treesize of output 164 [2018-04-11 17:50:59,956 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 17:51:00,047 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:51:00,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 6 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-04-11 17:51:00,190 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 18 variables, input treesize:504, output treesize:550 [2018-04-11 17:51:00,336 WARN L148 SmtUtils]: Spent 102ms on a formula simplification that was a NOOP. DAG size: 133 [2018-04-11 17:51:00,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:51:00,648 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:51:00,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 206 [2018-04-11 17:51:00,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:51:00,672 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 4 case distinctions, treesize of input 26 treesize of output 43 [2018-04-11 17:51:00,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-11 17:51:00,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 17:51:01,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 192 [2018-04-11 17:51:01,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:51:01,799 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-11 17:51:01,799 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:51:01,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:51:01,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 192 [2018-04-11 17:51:01,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 17:51:01,868 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:51:01,907 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:51:01,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 196 [2018-04-11 17:51:01,927 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-11 17:51:01,927 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-11 17:51:01,976 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:51:02,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:51:02,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 180 [2018-04-11 17:51:02,673 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 196 treesize of output 195 [2018-04-11 17:51:02,674 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 17:51:02,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:51:02,763 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:51:02,775 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 4 case distinctions, treesize of input 142 treesize of output 171 [2018-04-11 17:51:02,776 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-04-11 17:51:02,886 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 17:51:03,576 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 145 treesize of output 144 [2018-04-11 17:51:03,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:51:03,579 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:51:03,579 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 22 treesize of output 50 [2018-04-11 17:51:03,579 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 17:51:03,605 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:51:03,608 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:51:03,609 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 145 treesize of output 147 [2018-04-11 17:51:03,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-04-11 17:51:03,611 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 17:51:03,633 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:51:03,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:51:03,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 181 treesize of output 239 [2018-04-11 17:51:03,659 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:51:03,659 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 203 treesize of output 217 [2018-04-11 17:51:03,659 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 17:51:03,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 187 [2018-04-11 17:51:03,739 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 17:51:03,785 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:51:04,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:51:04,357 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 3 case distinctions, treesize of input 121 treesize of output 137 [2018-04-11 17:51:04,361 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 123 treesize of output 124 [2018-04-11 17:51:04,361 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 17:51:04,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 108 treesize of output 107 [2018-04-11 17:51:04,441 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 17:51:04,483 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:51:04,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:51:04,993 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 185 treesize of output 217 [2018-04-11 17:51:05,001 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 195 treesize of output 196 [2018-04-11 17:51:05,001 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 17:51:05,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:51:05,436 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:51:05,448 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 4 case distinctions, treesize of input 187 treesize of output 202 [2018-04-11 17:51:05,449 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 4 xjuncts. [2018-04-11 17:51:05,736 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 182 treesize of output 181 [2018-04-11 17:51:05,736 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-11 17:51:05,879 INFO L267 ElimStorePlain]: Start of recursive call 23: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 17:51:06,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:51:06,416 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 181 treesize of output 248 [2018-04-11 17:51:06,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 212 treesize of output 211 [2018-04-11 17:51:06,420 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 17:51:06,610 INFO L267 ElimStorePlain]: Start of recursive call 27: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:51:06,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:51:06,620 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 197 [2018-04-11 17:51:06,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:51:06,623 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:51:06,623 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 22 treesize of output 50 [2018-04-11 17:51:06,624 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-11 17:51:06,664 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:51:06,679 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:51:06,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 172 treesize of output 179 [2018-04-11 17:51:06,693 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-11 17:51:06,693 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-11 17:51:06,727 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:51:07,195 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 3 case distinctions, treesize of input 107 treesize of output 131 [2018-04-11 17:51:07,197 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 113 treesize of output 118 [2018-04-11 17:51:07,197 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-11 17:51:07,267 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 108 treesize of output 107 [2018-04-11 17:51:07,268 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-11 17:51:07,307 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:51:07,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 8 dim-2 vars, End of recursive call: 22 dim-0 vars, and 10 xjuncts. [2018-04-11 17:51:07,739 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 21 variables, input treesize:687, output treesize:1608 Received shutdown request... [2018-04-11 17:51:08,596 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 17:51:08,597 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 17:51:08,600 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 17:51:08,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 05:51:08 BoogieIcfgContainer [2018-04-11 17:51:08,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 17:51:08,600 INFO L168 Benchmark]: Toolchain (without parser) took 198151.00 ms. Allocated memory was 403.2 MB in the beginning and 665.3 MB in the end (delta: 262.1 MB). Free memory was 336.1 MB in the beginning and 488.0 MB in the end (delta: -151.9 MB). Peak memory consumption was 110.2 MB. Max. memory is 5.3 GB. [2018-04-11 17:51:08,601 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 403.2 MB. Free memory is still 361.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 17:51:08,601 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.80 ms. Allocated memory is still 403.2 MB. Free memory was 336.1 MB in the beginning and 308.4 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. [2018-04-11 17:51:08,601 INFO L168 Benchmark]: Boogie Preprocessor took 42.25 ms. Allocated memory is still 403.2 MB. Free memory was 308.4 MB in the beginning and 303.1 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 5.3 GB. [2018-04-11 17:51:08,602 INFO L168 Benchmark]: RCFGBuilder took 512.95 ms. Allocated memory was 403.2 MB in the beginning and 590.9 MB in the end (delta: 187.7 MB). Free memory was 303.1 MB in the beginning and 508.8 MB in the end (delta: -205.7 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. [2018-04-11 17:51:08,602 INFO L168 Benchmark]: TraceAbstraction took 197336.28 ms. Allocated memory was 590.9 MB in the beginning and 665.3 MB in the end (delta: 74.4 MB). Free memory was 506.7 MB in the beginning and 488.0 MB in the end (delta: 18.6 MB). Peak memory consumption was 93.1 MB. Max. memory is 5.3 GB. [2018-04-11 17:51:08,603 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 403.2 MB. Free memory is still 361.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 256.80 ms. Allocated memory is still 403.2 MB. Free memory was 336.1 MB in the beginning and 308.4 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.25 ms. Allocated memory is still 403.2 MB. Free memory was 308.4 MB in the beginning and 303.1 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 512.95 ms. Allocated memory was 403.2 MB in the beginning and 590.9 MB in the end (delta: 187.7 MB). Free memory was 303.1 MB in the beginning and 508.8 MB in the end (delta: -205.7 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 197336.28 ms. Allocated memory was 590.9 MB in the beginning and 665.3 MB in the end (delta: 74.4 MB). Free memory was 506.7 MB in the beginning and 488.0 MB in the end (delta: 18.6 MB). Peak memory consumption was 93.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 997]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 986]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 1007]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 982]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 982). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 1007]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 997]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 1007]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 1007]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 986]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 327. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 148 locations, 63 error locations. TIMEOUT Result, 197.3s OverallTime, 46 OverallIterations, 3 TraceHistogramMax, 129.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5063 SDtfs, 19315 SDslu, 25872 SDs, 0 SdLazy, 28059 SolverSat, 1677 SolverUnsat, 386 SolverUnknown, 0 SolverNotchecked, 69.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2029 GetRequests, 1035 SyntacticMatches, 21 SemanticMatches, 973 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5030 ImplicationChecksByTransitivity, 81.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=814occurred in iteration=45, 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, 45 MinimizatonAttempts, 6596 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 52.4s InterpolantComputationTime, 3178 NumberOfCodeBlocks, 3178 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 1808 ConstructedInterpolants, 602 QuantifiedInterpolants, 3554779 SizeOfPredicates, 460 NumberOfNonLiveVariables, 5282 ConjunctsInSsa, 968 ConjunctsInUnsatCore, 47 InterpolantComputations, 23 PerfectInterpolantSequences, 27/130 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-optional_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_17-51-08-610.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-optional_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_17-51-08-610.csv Completed graceful shutdown