java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-01_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 16:54:13,957 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 16:54:13,959 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 16:54:13,968 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 16:54:13,968 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 16:54:13,969 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 16:54:13,969 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 16:54:13,971 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 16:54:13,973 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 16:54:13,973 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 16:54:13,974 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 16:54:13,974 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 16:54:13,975 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 16:54:13,976 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 16:54:13,976 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 16:54:13,978 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 16:54:13,979 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 16:54:13,981 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 16:54:13,982 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 16:54:13,982 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 16:54:13,984 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 16:54:13,984 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 16:54:13,984 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 16:54:13,985 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 16:54:13,986 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 16:54:13,987 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 16:54:13,987 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 16:54:13,987 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 16:54:13,988 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 16:54:13,988 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 16:54:13,989 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 16:54:13,989 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-10 16:54:14,006 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 16:54:14,006 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 16:54:14,007 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 16:54:14,007 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 16:54:14,007 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 16:54:14,007 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 16:54:14,007 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 16:54:14,008 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 16:54:14,008 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 16:54:14,008 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 16:54:14,008 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 16:54:14,008 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 16:54:14,008 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 16:54:14,008 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 16:54:14,009 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 16:54:14,009 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 16:54:14,009 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 16:54:14,009 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 16:54:14,009 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 16:54:14,009 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 16:54:14,009 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 16:54:14,010 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 16:54:14,010 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 16:54:14,010 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-04-10 16:54:14,038 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 16:54:14,045 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 16:54:14,048 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 16:54:14,049 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 16:54:14,049 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 16:54:14,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,408 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG8a504bac8 [2018-04-10 16:54:14,539 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 16:54:14,539 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 16:54:14,540 INFO L168 CDTParser]: Scanning sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,548 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 16:54:14,548 INFO L215 ultiparseSymbolTable]: [2018-04-10 16:54:14,548 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 16:54:14,548 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,548 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 16:54:14,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____time_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____timer_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_mutexattr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____intptr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__idtype_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__size_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____mode_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_mutex_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__fsfilcnt_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_int in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__int8_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fsfilcnt_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__caddr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_int64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_short in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__time_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__div_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__off_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____suseconds_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__ldiv_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fsfilcnt64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__ino_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____uint32_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____socklen_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__lldiv_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____rlim_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__uid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_rwlock_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__register_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__int16_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_key_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fsblkcnt_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_attr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____off64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____sig_atomic_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____uid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____uint64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____syscall_ulong_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fsword_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__uint in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__sigset_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__nlink_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__ssize_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____u_char in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fsblkcnt64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____nlink_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____pthread_slist_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____int32_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_rwlockattr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____blkcnt64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__fsblkcnt_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__int32_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_int32_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____id_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_int8_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__key_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fd_mask in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____ssize_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__timer_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__clockid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____ino_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____syscall_slong_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____u_quad_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____pid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__ushort in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____gid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_long in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____off_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__fd_mask in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_barrier_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____uint16_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____sigset_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fsid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__int64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____quad_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____ino64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____uint8_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____key_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_spinlock_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__id_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____useconds_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____u_long in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__dev_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____int16_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__wchar_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____blkcnt_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_cond_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_barrierattr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_int16_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____u_int in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_char in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__blkcnt_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__quad_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____clockid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____caddr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_quad_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____int64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____blksize_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_once_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__blksize_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____qaddr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____rlim64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__loff_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__SLL in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____daddr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__gid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__ulong in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____clock_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_condattr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__fd_set in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__daddr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____u_short in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__fsid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__clock_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__mode_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__suseconds_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____int8_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____dev_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____loff_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:14,572 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG8a504bac8 [2018-04-10 16:54:14,575 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 16:54:14,576 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 16:54:14,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 16:54:14,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 16:54:14,581 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 16:54:14,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:54:14" (1/1) ... [2018-04-10 16:54:14,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bf0f7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:54:14, skipping insertion in model container [2018-04-10 16:54:14,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:54:14" (1/1) ... [2018-04-10 16:54:14,595 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:54:14,624 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:54:14,762 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:54:14,802 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:54:14,807 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-10 16:54:14,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:54:14 WrapperNode [2018-04-10 16:54:14,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 16:54:14,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 16:54:14,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 16:54:14,845 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 16:54:14,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:54:14" (1/1) ... [2018-04-10 16:54:14,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:54:14" (1/1) ... [2018-04-10 16:54:14,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:54:14" (1/1) ... [2018-04-10 16:54:14,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:54:14" (1/1) ... [2018-04-10 16:54:14,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:54:14" (1/1) ... [2018-04-10 16:54:14,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:54:14" (1/1) ... [2018-04-10 16:54:14,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:54:14" (1/1) ... [2018-04-10 16:54:14,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 16:54:14,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 16:54:14,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 16:54:14,890 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 16:54:14,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:54:14" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 16:54:14,974 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 16:54:14,974 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 16:54:14,974 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 16:54:14,974 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-10 16:54:14,975 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-10 16:54:14,975 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-10 16:54:14,975 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-10 16:54:14,975 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-10 16:54:14,975 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-10 16:54:14,975 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-10 16:54:14,975 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-10 16:54:14,975 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-10 16:54:14,975 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-10 16:54:14,975 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-10 16:54:14,975 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-10 16:54:14,975 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-10 16:54:14,976 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-10 16:54:14,976 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-10 16:54:14,976 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-10 16:54:14,976 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-10 16:54:14,976 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-10 16:54:14,976 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-10 16:54:14,976 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-10 16:54:14,976 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-10 16:54:14,976 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-10 16:54:14,977 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-10 16:54:14,977 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-10 16:54:14,977 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-10 16:54:14,977 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-10 16:54:14,977 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-10 16:54:14,977 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-10 16:54:14,977 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-10 16:54:14,977 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-10 16:54:14,977 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-10 16:54:14,978 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-10 16:54:14,978 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-10 16:54:14,978 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-10 16:54:14,978 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-10 16:54:14,978 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-10 16:54:14,978 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-10 16:54:14,978 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-10 16:54:14,978 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-10 16:54:14,978 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-10 16:54:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-10 16:54:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-10 16:54:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-10 16:54:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-10 16:54:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-10 16:54:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-10 16:54:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-10 16:54:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-10 16:54:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-10 16:54:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-10 16:54:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-10 16:54:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-10 16:54:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-10 16:54:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-10 16:54:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-10 16:54:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-10 16:54:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-10 16:54:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-10 16:54:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-10 16:54:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-10 16:54:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-10 16:54:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-10 16:54:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-10 16:54:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-10 16:54:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-10 16:54:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-10 16:54:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-10 16:54:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-10 16:54:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-10 16:54:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-10 16:54:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-10 16:54:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-10 16:54:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-10 16:54:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-10 16:54:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-10 16:54:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-10 16:54:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-10 16:54:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-10 16:54:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-10 16:54:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-10 16:54:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-10 16:54:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-10 16:54:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-10 16:54:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-10 16:54:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-10 16:54:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-10 16:54:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-10 16:54:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-10 16:54:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-10 16:54:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-10 16:54:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-10 16:54:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-10 16:54:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-10 16:54:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-10 16:54:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-10 16:54:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-10 16:54:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-10 16:54:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-10 16:54:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-10 16:54:14,985 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-10 16:54:14,985 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-10 16:54:14,985 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-10 16:54:14,985 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-10 16:54:14,985 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 16:54:14,985 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 16:54:14,985 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 16:54:14,985 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 16:54:14,985 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-10 16:54:14,985 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-10 16:54:14,986 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 16:54:14,986 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 16:54:14,986 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 16:54:15,399 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 16:54:15,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:54:15 BoogieIcfgContainer [2018-04-10 16:54:15,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 16:54:15,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 16:54:15,401 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 16:54:15,403 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 16:54:15,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 04:54:14" (1/3) ... [2018-04-10 16:54:15,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626e6709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:54:15, skipping insertion in model container [2018-04-10 16:54:15,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:54:14" (2/3) ... [2018-04-10 16:54:15,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626e6709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:54:15, skipping insertion in model container [2018-04-10 16:54:15,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:54:15" (3/3) ... [2018-04-10 16:54:15,406 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 16:54:15,413 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 16:54:15,419 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-04-10 16:54:15,452 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 16:54:15,453 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 16:54:15,453 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 16:54:15,453 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 16:54:15,453 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 16:54:15,453 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 16:54:15,454 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 16:54:15,454 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 16:54:15,454 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 16:54:15,454 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 16:54:15,467 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2018-04-10 16:54:15,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 16:54:15,473 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:15,474 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:15,474 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:15,476 INFO L82 PathProgramCache]: Analyzing trace with hash 424313087, now seen corresponding path program 1 times [2018-04-10 16:54:15,477 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:15,478 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:15,516 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:15,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:15,517 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:15,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:15,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:15,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:54:15,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:54:15,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:54:15,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:54:15,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:54:15,610 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 4 states. [2018-04-10 16:54:15,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:15,844 INFO L93 Difference]: Finished difference Result 223 states and 235 transitions. [2018-04-10 16:54:15,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:54:15,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 16:54:15,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:15,854 INFO L225 Difference]: With dead ends: 223 [2018-04-10 16:54:15,854 INFO L226 Difference]: Without dead ends: 219 [2018-04-10 16:54:15,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-10 16:54:15,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-04-10 16:54:15,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 185. [2018-04-10 16:54:15,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-10 16:54:15,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 198 transitions. [2018-04-10 16:54:15,891 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 198 transitions. Word has length 8 [2018-04-10 16:54:15,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:15,891 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 198 transitions. [2018-04-10 16:54:15,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:54:15,891 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 198 transitions. [2018-04-10 16:54:15,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 16:54:15,891 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:15,892 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:15,892 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:15,892 INFO L82 PathProgramCache]: Analyzing trace with hash 424313088, now seen corresponding path program 1 times [2018-04-10 16:54:15,892 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:15,892 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:15,893 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:15,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:15,893 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:15,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:15,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:15,957 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:54:15,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:54:15,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:54:15,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:54:15,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:54:15,959 INFO L87 Difference]: Start difference. First operand 185 states and 198 transitions. Second operand 4 states. [2018-04-10 16:54:16,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:16,109 INFO L93 Difference]: Finished difference Result 212 states and 224 transitions. [2018-04-10 16:54:16,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:54:16,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 16:54:16,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:16,110 INFO L225 Difference]: With dead ends: 212 [2018-04-10 16:54:16,110 INFO L226 Difference]: Without dead ends: 212 [2018-04-10 16:54:16,111 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:54:16,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-10 16:54:16,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 199. [2018-04-10 16:54:16,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-10 16:54:16,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 219 transitions. [2018-04-10 16:54:16,116 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 219 transitions. Word has length 8 [2018-04-10 16:54:16,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:16,116 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 219 transitions. [2018-04-10 16:54:16,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:54:16,117 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 219 transitions. [2018-04-10 16:54:16,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 16:54:16,117 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:16,117 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:16,117 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:16,117 INFO L82 PathProgramCache]: Analyzing trace with hash -840809059, now seen corresponding path program 1 times [2018-04-10 16:54:16,117 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:16,117 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:16,118 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:16,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:16,119 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:16,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:16,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:16,166 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:54:16,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:54:16,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:54:16,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:54:16,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:54:16,167 INFO L87 Difference]: Start difference. First operand 199 states and 219 transitions. Second operand 5 states. [2018-04-10 16:54:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:16,420 INFO L93 Difference]: Finished difference Result 339 states and 368 transitions. [2018-04-10 16:54:16,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:54:16,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-10 16:54:16,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:16,421 INFO L225 Difference]: With dead ends: 339 [2018-04-10 16:54:16,421 INFO L226 Difference]: Without dead ends: 339 [2018-04-10 16:54:16,422 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:54:16,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-04-10 16:54:16,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 198. [2018-04-10 16:54:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-10 16:54:16,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 218 transitions. [2018-04-10 16:54:16,427 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 218 transitions. Word has length 17 [2018-04-10 16:54:16,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:16,427 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 218 transitions. [2018-04-10 16:54:16,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:54:16,428 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 218 transitions. [2018-04-10 16:54:16,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 16:54:16,428 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:16,428 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:16,428 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:16,428 INFO L82 PathProgramCache]: Analyzing trace with hash -840809058, now seen corresponding path program 1 times [2018-04-10 16:54:16,428 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:16,428 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:16,429 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:16,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:16,429 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:16,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:16,493 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:54:16,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:54:16,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:54:16,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:54:16,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:54:16,494 INFO L87 Difference]: Start difference. First operand 198 states and 218 transitions. Second operand 5 states. [2018-04-10 16:54:16,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:16,733 INFO L93 Difference]: Finished difference Result 370 states and 409 transitions. [2018-04-10 16:54:16,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:54:16,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-10 16:54:16,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:16,735 INFO L225 Difference]: With dead ends: 370 [2018-04-10 16:54:16,735 INFO L226 Difference]: Without dead ends: 370 [2018-04-10 16:54:16,735 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:54:16,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-04-10 16:54:16,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 197. [2018-04-10 16:54:16,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-10 16:54:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 217 transitions. [2018-04-10 16:54:16,744 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 217 transitions. Word has length 17 [2018-04-10 16:54:16,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:16,744 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 217 transitions. [2018-04-10 16:54:16,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:54:16,744 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 217 transitions. [2018-04-10 16:54:16,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-10 16:54:16,745 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:16,745 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:16,745 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:16,745 INFO L82 PathProgramCache]: Analyzing trace with hash -293392460, now seen corresponding path program 1 times [2018-04-10 16:54:16,746 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:16,746 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:16,747 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:16,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:16,748 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:16,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:16,782 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:54:16,782 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:16,782 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:16,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:16,833 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:16,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:16,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:16,868 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-10 16:54:16,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:16,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:16,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-10 16:54:16,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 16:54:16,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 16:54:16,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:16,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:16,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:16,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-04-10 16:54:16,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-10 16:54:16,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:54:16,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:16,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:16,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:54:16,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-04-10 16:54:16,959 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-10 16:54:16,962 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-10 16:54:16,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:16,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:54:16,967 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:16,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:16,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:54:16,973 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:15 [2018-04-10 16:54:16,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:16,982 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:54:16,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 16:54:16,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 16:54:16,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 16:54:16,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:54:16,983 INFO L87 Difference]: Start difference. First operand 197 states and 217 transitions. Second operand 8 states. [2018-04-10 16:54:17,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:17,425 INFO L93 Difference]: Finished difference Result 341 states and 368 transitions. [2018-04-10 16:54:17,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 16:54:17,426 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-04-10 16:54:17,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:17,427 INFO L225 Difference]: With dead ends: 341 [2018-04-10 16:54:17,427 INFO L226 Difference]: Without dead ends: 341 [2018-04-10 16:54:17,427 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-04-10 16:54:17,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-04-10 16:54:17,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 196. [2018-04-10 16:54:17,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-04-10 16:54:17,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 216 transitions. [2018-04-10 16:54:17,438 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 216 transitions. Word has length 20 [2018-04-10 16:54:17,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:17,438 INFO L459 AbstractCegarLoop]: Abstraction has 196 states and 216 transitions. [2018-04-10 16:54:17,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 16:54:17,438 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 216 transitions. [2018-04-10 16:54:17,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-10 16:54:17,439 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:17,439 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:17,439 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:17,439 INFO L82 PathProgramCache]: Analyzing trace with hash -293392459, now seen corresponding path program 1 times [2018-04-10 16:54:17,439 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:17,439 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:17,441 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:17,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:17,441 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:17,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:17,459 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:54:17,459 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:17,459 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:17,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:17,489 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:17,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 6 treesize of output 5 [2018-04-10 16:54:17,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:17,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:17,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-10 16:54:17,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 16:54:17,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 16:54:17,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:17,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:17,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 16:54:17,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 16:54:17,525 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:17,527 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:17,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:17,535 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:35, output treesize:24 [2018-04-10 16:54:17,563 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-10 16:54:17,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-10 16:54:17,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:17,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:17,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 40 [2018-04-10 16:54:17,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:17,609 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 26 treesize of output 35 [2018-04-10 16:54:17,610 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:17,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:54:17,626 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:17,632 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:17,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:54:17,640 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:55, output treesize:47 [2018-04-10 16:54:17,681 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 28 treesize of output 30 [2018-04-10 16:54:17,684 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 26 treesize of output 15 [2018-04-10 16:54:17,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:17,697 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 10 [2018-04-10 16:54:17,697 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:17,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:17,708 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 22 treesize of output 12 [2018-04-10 16:54:17,708 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:17,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:17,743 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-10 16:54:17,745 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-10 16:54:17,746 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:17,756 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 26 treesize of output 11 [2018-04-10 16:54:17,757 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:17,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:17,766 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 27 treesize of output 13 [2018-04-10 16:54:17,767 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:17,772 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:17,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:17,776 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:65, output treesize:9 [2018-04-10 16:54:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:17,782 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:54:17,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 16:54:17,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:54:17,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:54:17,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:54:17,783 INFO L87 Difference]: Start difference. First operand 196 states and 216 transitions. Second operand 9 states. [2018-04-10 16:54:18,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:18,089 INFO L93 Difference]: Finished difference Result 347 states and 369 transitions. [2018-04-10 16:54:18,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 16:54:18,089 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-04-10 16:54:18,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:18,090 INFO L225 Difference]: With dead ends: 347 [2018-04-10 16:54:18,090 INFO L226 Difference]: Without dead ends: 347 [2018-04-10 16:54:18,090 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:54:18,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-04-10 16:54:18,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 195. [2018-04-10 16:54:18,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-04-10 16:54:18,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 215 transitions. [2018-04-10 16:54:18,095 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 215 transitions. Word has length 20 [2018-04-10 16:54:18,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:18,095 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 215 transitions. [2018-04-10 16:54:18,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:54:18,095 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 215 transitions. [2018-04-10 16:54:18,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-10 16:54:18,096 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:18,096 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:18,096 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:18,096 INFO L82 PathProgramCache]: Analyzing trace with hash 671159677, now seen corresponding path program 1 times [2018-04-10 16:54:18,096 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:18,097 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:18,098 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:18,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:18,098 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:18,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:18,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:18,136 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:54:18,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:54:18,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:54:18,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:54:18,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:54:18,137 INFO L87 Difference]: Start difference. First operand 195 states and 215 transitions. Second operand 5 states. [2018-04-10 16:54:18,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:18,227 INFO L93 Difference]: Finished difference Result 292 states and 318 transitions. [2018-04-10 16:54:18,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:54:18,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-04-10 16:54:18,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:18,229 INFO L225 Difference]: With dead ends: 292 [2018-04-10 16:54:18,229 INFO L226 Difference]: Without dead ends: 292 [2018-04-10 16:54:18,229 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:54:18,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-04-10 16:54:18,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 199. [2018-04-10 16:54:18,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-10 16:54:18,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 219 transitions. [2018-04-10 16:54:18,234 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 219 transitions. Word has length 26 [2018-04-10 16:54:18,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:18,234 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 219 transitions. [2018-04-10 16:54:18,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:54:18,234 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 219 transitions. [2018-04-10 16:54:18,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-10 16:54:18,235 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:18,235 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:18,235 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:18,235 INFO L82 PathProgramCache]: Analyzing trace with hash -903005022, now seen corresponding path program 1 times [2018-04-10 16:54:18,235 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:18,235 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:18,236 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:18,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:18,236 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:18,242 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:18,244 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:54:18,245 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:18,245 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:18,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:18,261 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:18,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:54:18,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:18,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:18,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 16:54:18,281 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-10 16:54:18,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:18,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:54:18,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-10 16:54:18,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:18,294 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:54:18,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:54:18,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:54:18,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:54:18,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:54:18,295 INFO L87 Difference]: Start difference. First operand 199 states and 219 transitions. Second operand 5 states. [2018-04-10 16:54:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:18,396 INFO L93 Difference]: Finished difference Result 211 states and 224 transitions. [2018-04-10 16:54:18,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:54:18,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-10 16:54:18,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:18,397 INFO L225 Difference]: With dead ends: 211 [2018-04-10 16:54:18,397 INFO L226 Difference]: Without dead ends: 211 [2018-04-10 16:54:18,397 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:54:18,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-04-10 16:54:18,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 191. [2018-04-10 16:54:18,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-10 16:54:18,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 211 transitions. [2018-04-10 16:54:18,399 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 211 transitions. Word has length 28 [2018-04-10 16:54:18,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:18,400 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 211 transitions. [2018-04-10 16:54:18,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:54:18,400 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2018-04-10 16:54:18,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-10 16:54:18,400 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:18,400 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:18,401 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:18,401 INFO L82 PathProgramCache]: Analyzing trace with hash -903005021, now seen corresponding path program 1 times [2018-04-10 16:54:18,401 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:18,401 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:18,402 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:18,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:18,402 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:18,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:18,411 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:54:18,411 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:18,411 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:18,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:18,426 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:18,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:54:18,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:18,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:18,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:54:18,481 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-10 16:54:18,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:18,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:54:18,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-10 16:54:18,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:18,490 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:54:18,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:54:18,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:54:18,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:54:18,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:54:18,491 INFO L87 Difference]: Start difference. First operand 191 states and 211 transitions. Second operand 5 states. [2018-04-10 16:54:18,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:18,609 INFO L93 Difference]: Finished difference Result 250 states and 267 transitions. [2018-04-10 16:54:18,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:54:18,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-10 16:54:18,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:18,610 INFO L225 Difference]: With dead ends: 250 [2018-04-10 16:54:18,610 INFO L226 Difference]: Without dead ends: 250 [2018-04-10 16:54:18,611 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:54:18,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-04-10 16:54:18,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 221. [2018-04-10 16:54:18,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-10 16:54:18,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 252 transitions. [2018-04-10 16:54:18,617 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 252 transitions. Word has length 28 [2018-04-10 16:54:18,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:18,617 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 252 transitions. [2018-04-10 16:54:18,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:54:18,618 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 252 transitions. [2018-04-10 16:54:18,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 16:54:18,618 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:18,618 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:18,619 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:18,619 INFO L82 PathProgramCache]: Analyzing trace with hash -2042365947, now seen corresponding path program 1 times [2018-04-10 16:54:18,619 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:18,619 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:18,620 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:18,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:18,620 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:18,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:18,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:18,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:54:18,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:54:18,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:54:18,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:54:18,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:54:18,678 INFO L87 Difference]: Start difference. First operand 221 states and 252 transitions. Second operand 6 states. [2018-04-10 16:54:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:18,865 INFO L93 Difference]: Finished difference Result 321 states and 369 transitions. [2018-04-10 16:54:18,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:54:18,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-10 16:54:18,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:18,866 INFO L225 Difference]: With dead ends: 321 [2018-04-10 16:54:18,866 INFO L226 Difference]: Without dead ends: 321 [2018-04-10 16:54:18,866 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:54:18,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-04-10 16:54:18,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 220. [2018-04-10 16:54:18,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-10 16:54:18,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 251 transitions. [2018-04-10 16:54:18,871 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 251 transitions. Word has length 31 [2018-04-10 16:54:18,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:18,871 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 251 transitions. [2018-04-10 16:54:18,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:54:18,871 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 251 transitions. [2018-04-10 16:54:18,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 16:54:18,872 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:18,872 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:18,872 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:18,872 INFO L82 PathProgramCache]: Analyzing trace with hash -2042365946, now seen corresponding path program 1 times [2018-04-10 16:54:18,872 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:18,873 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:18,874 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:18,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:18,874 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:18,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:18,945 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:54:18,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:54:18,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:54:18,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:54:18,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:54:18,946 INFO L87 Difference]: Start difference. First operand 220 states and 251 transitions. Second operand 6 states. [2018-04-10 16:54:19,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:19,160 INFO L93 Difference]: Finished difference Result 345 states and 401 transitions. [2018-04-10 16:54:19,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 16:54:19,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-10 16:54:19,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:19,161 INFO L225 Difference]: With dead ends: 345 [2018-04-10 16:54:19,161 INFO L226 Difference]: Without dead ends: 345 [2018-04-10 16:54:19,161 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:54:19,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-04-10 16:54:19,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 205. [2018-04-10 16:54:19,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-10 16:54:19,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 235 transitions. [2018-04-10 16:54:19,164 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 235 transitions. Word has length 31 [2018-04-10 16:54:19,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:19,164 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 235 transitions. [2018-04-10 16:54:19,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:54:19,164 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 235 transitions. [2018-04-10 16:54:19,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-10 16:54:19,165 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:19,165 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:19,165 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:19,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1748046544, now seen corresponding path program 1 times [2018-04-10 16:54:19,165 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:19,165 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:19,166 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:19,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:19,166 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:19,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:19,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:19,197 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:54:19,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:54:19,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:54:19,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:54:19,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:54:19,198 INFO L87 Difference]: Start difference. First operand 205 states and 235 transitions. Second operand 5 states. [2018-04-10 16:54:19,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:19,271 INFO L93 Difference]: Finished difference Result 230 states and 246 transitions. [2018-04-10 16:54:19,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:54:19,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-04-10 16:54:19,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:19,272 INFO L225 Difference]: With dead ends: 230 [2018-04-10 16:54:19,272 INFO L226 Difference]: Without dead ends: 230 [2018-04-10 16:54:19,272 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:54:19,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-04-10 16:54:19,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 205. [2018-04-10 16:54:19,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-10 16:54:19,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 233 transitions. [2018-04-10 16:54:19,276 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 233 transitions. Word has length 36 [2018-04-10 16:54:19,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:19,276 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 233 transitions. [2018-04-10 16:54:19,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:54:19,276 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 233 transitions. [2018-04-10 16:54:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-10 16:54:19,277 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:19,277 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:19,277 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:19,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1817891105, now seen corresponding path program 1 times [2018-04-10 16:54:19,278 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:19,278 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:19,279 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:19,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:19,279 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:19,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:19,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:19,362 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:54:19,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 16:54:19,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 16:54:19,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 16:54:19,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:54:19,363 INFO L87 Difference]: Start difference. First operand 205 states and 233 transitions. Second operand 8 states. [2018-04-10 16:54:19,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:19,640 INFO L93 Difference]: Finished difference Result 315 states and 351 transitions. [2018-04-10 16:54:19,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 16:54:19,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-04-10 16:54:19,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:19,641 INFO L225 Difference]: With dead ends: 315 [2018-04-10 16:54:19,641 INFO L226 Difference]: Without dead ends: 315 [2018-04-10 16:54:19,641 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-04-10 16:54:19,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-04-10 16:54:19,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 221. [2018-04-10 16:54:19,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-10 16:54:19,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 250 transitions. [2018-04-10 16:54:19,644 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 250 transitions. Word has length 42 [2018-04-10 16:54:19,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:19,644 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 250 transitions. [2018-04-10 16:54:19,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 16:54:19,644 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 250 transitions. [2018-04-10 16:54:19,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-10 16:54:19,644 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:19,644 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:19,645 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:19,645 INFO L82 PathProgramCache]: Analyzing trace with hash -729312829, now seen corresponding path program 1 times [2018-04-10 16:54:19,645 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:19,645 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:19,645 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:19,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:19,645 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:19,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:19,685 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:54:19,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:54:19,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:54:19,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:54:19,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:54:19,685 INFO L87 Difference]: Start difference. First operand 221 states and 250 transitions. Second operand 5 states. [2018-04-10 16:54:19,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:19,926 INFO L93 Difference]: Finished difference Result 379 states and 434 transitions. [2018-04-10 16:54:19,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:54:19,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-10 16:54:19,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:19,927 INFO L225 Difference]: With dead ends: 379 [2018-04-10 16:54:19,927 INFO L226 Difference]: Without dead ends: 379 [2018-04-10 16:54:19,928 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:54:19,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-04-10 16:54:19,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 220. [2018-04-10 16:54:19,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-10 16:54:19,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 249 transitions. [2018-04-10 16:54:19,932 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 249 transitions. Word has length 43 [2018-04-10 16:54:19,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:19,932 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 249 transitions. [2018-04-10 16:54:19,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:54:19,932 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 249 transitions. [2018-04-10 16:54:19,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-10 16:54:19,933 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:19,933 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:19,933 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:19,933 INFO L82 PathProgramCache]: Analyzing trace with hash -729312830, now seen corresponding path program 1 times [2018-04-10 16:54:19,933 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:19,933 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:19,934 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:19,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:19,934 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:19,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:19,980 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:54:19,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:54:19,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:54:19,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:54:19,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:54:19,981 INFO L87 Difference]: Start difference. First operand 220 states and 249 transitions. Second operand 5 states. [2018-04-10 16:54:20,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:20,171 INFO L93 Difference]: Finished difference Result 343 states and 391 transitions. [2018-04-10 16:54:20,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:54:20,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-10 16:54:20,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:20,172 INFO L225 Difference]: With dead ends: 343 [2018-04-10 16:54:20,172 INFO L226 Difference]: Without dead ends: 343 [2018-04-10 16:54:20,173 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:54:20,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-04-10 16:54:20,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 219. [2018-04-10 16:54:20,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-04-10 16:54:20,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 248 transitions. [2018-04-10 16:54:20,179 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 248 transitions. Word has length 43 [2018-04-10 16:54:20,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:20,180 INFO L459 AbstractCegarLoop]: Abstraction has 219 states and 248 transitions. [2018-04-10 16:54:20,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:54:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 248 transitions. [2018-04-10 16:54:20,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-10 16:54:20,180 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:20,181 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:20,181 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:20,181 INFO L82 PathProgramCache]: Analyzing trace with hash -345024793, now seen corresponding path program 1 times [2018-04-10 16:54:20,181 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:20,181 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:20,182 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:20,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:20,182 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:20,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:20,192 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:54:20,192 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:20,193 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:20,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:20,217 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:20,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:54:20,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:54:20,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:20,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:20,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:54:20,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:54:20,265 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:20,266 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:20,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:20,272 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-10 16:54:20,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 21 treesize of output 16 [2018-04-10 16:54:20,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:20,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:54:20,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:20,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:20,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 16:54:20,310 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:20,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:54:20,311 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:20,314 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:20,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:20,320 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-10 16:54:20,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-10 16:54:20,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:20,357 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:54:20,358 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-10 16:54:20,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:20,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:20,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-10 16:54:20,384 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:20,385 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:54:20,385 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-10 16:54:20,386 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:20,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:20,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:20,396 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:59, output treesize:7 [2018-04-10 16:54:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:20,420 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:54:20,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-10 16:54:20,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:54:20,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:54:20,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:54:20,421 INFO L87 Difference]: Start difference. First operand 219 states and 248 transitions. Second operand 9 states. [2018-04-10 16:54:20,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:20,762 INFO L93 Difference]: Finished difference Result 390 states and 433 transitions. [2018-04-10 16:54:20,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 16:54:20,762 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-04-10 16:54:20,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:20,763 INFO L225 Difference]: With dead ends: 390 [2018-04-10 16:54:20,764 INFO L226 Difference]: Without dead ends: 390 [2018-04-10 16:54:20,764 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2018-04-10 16:54:20,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-04-10 16:54:20,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 244. [2018-04-10 16:54:20,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-04-10 16:54:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 274 transitions. [2018-04-10 16:54:20,769 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 274 transitions. Word has length 44 [2018-04-10 16:54:20,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:20,769 INFO L459 AbstractCegarLoop]: Abstraction has 244 states and 274 transitions. [2018-04-10 16:54:20,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:54:20,769 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 274 transitions. [2018-04-10 16:54:20,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-10 16:54:20,770 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:20,770 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:20,770 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:20,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1281162052, now seen corresponding path program 1 times [2018-04-10 16:54:20,770 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:20,770 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:20,771 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:20,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:20,772 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:20,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:20,784 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:54:20,784 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:20,784 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:20,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:20,814 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:20,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:20,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:20,863 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-10 16:54:20,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:20,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:20,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-10 16:54:20,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 16:54:20,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 16:54:20,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:20,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:20,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:20,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-04-10 16:54:20,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-10 16:54:20,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:54:20,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:20,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:20,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:54:20,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-04-10 16:54:20,946 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-10 16:54:20,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:54:20,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:20,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, 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-10 16:54:20,953 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:20,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:20,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:54:20,959 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:15 [2018-04-10 16:54:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:20,981 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:54:20,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 16:54:20,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 16:54:20,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 16:54:20,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:54:20,982 INFO L87 Difference]: Start difference. First operand 244 states and 274 transitions. Second operand 8 states. [2018-04-10 16:54:21,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:21,273 INFO L93 Difference]: Finished difference Result 265 states and 298 transitions. [2018-04-10 16:54:21,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 16:54:21,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-04-10 16:54:21,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:21,274 INFO L225 Difference]: With dead ends: 265 [2018-04-10 16:54:21,274 INFO L226 Difference]: Without dead ends: 265 [2018-04-10 16:54:21,274 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-04-10 16:54:21,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-04-10 16:54:21,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 243. [2018-04-10 16:54:21,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-10 16:54:21,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 273 transitions. [2018-04-10 16:54:21,278 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 273 transitions. Word has length 46 [2018-04-10 16:54:21,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:21,278 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 273 transitions. [2018-04-10 16:54:21,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 16:54:21,278 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 273 transitions. [2018-04-10 16:54:21,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-10 16:54:21,279 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:21,279 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:21,279 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:21,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1281162053, now seen corresponding path program 1 times [2018-04-10 16:54:21,280 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:21,280 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:21,280 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:21,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:21,281 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:21,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:21,294 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:54:21,295 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:21,295 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:21,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:21,328 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:21,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:54:21,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:21,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:21,364 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-10 16:54:21,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-04-10 16:54:21,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 16:54:21,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 16:54:21,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 10 treesize of output 9 [2018-04-10 16:54:21,428 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,430 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 16:54:21,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 16:54:21,439 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,441 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,446 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:49, output treesize:34 [2018-04-10 16:54:21,471 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-10 16:54:21,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:54:21,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-04-10 16:54:21,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:54:21,492 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,496 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:54:21,505 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:89, output treesize:69 [2018-04-10 16:54:21,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 41 [2018-04-10 16:54:21,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:54:21,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,528 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 36 treesize of output 17 [2018-04-10 16:54:21,529 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-04-10 16:54:21,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-04-10 16:54:21,543 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:54:21,548 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,557 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,563 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:87, output treesize:9 [2018-04-10 16:54:21,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:21,571 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:54:21,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 16:54:21,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 16:54:21,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 16:54:21,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:54:21,571 INFO L87 Difference]: Start difference. First operand 243 states and 273 transitions. Second operand 8 states. [2018-04-10 16:54:21,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:21,821 INFO L93 Difference]: Finished difference Result 264 states and 297 transitions. [2018-04-10 16:54:21,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 16:54:21,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-04-10 16:54:21,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:21,822 INFO L225 Difference]: With dead ends: 264 [2018-04-10 16:54:21,822 INFO L226 Difference]: Without dead ends: 264 [2018-04-10 16:54:21,822 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-04-10 16:54:21,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-04-10 16:54:21,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 242. [2018-04-10 16:54:21,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-04-10 16:54:21,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 272 transitions. [2018-04-10 16:54:21,825 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 272 transitions. Word has length 46 [2018-04-10 16:54:21,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:21,825 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 272 transitions. [2018-04-10 16:54:21,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 16:54:21,825 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 272 transitions. [2018-04-10 16:54:21,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 16:54:21,825 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:21,825 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:21,825 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:21,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1091008626, now seen corresponding path program 1 times [2018-04-10 16:54:21,825 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:21,825 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:21,826 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:21,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:21,826 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:21,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:21,834 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:54:21,834 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:21,835 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:21,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:21,856 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:21,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:54:21,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:54:21,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:21,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:21,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:21,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-04-10 16:54:21,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 16:54:21,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2018-04-10 16:54:21,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 16:54:21,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 16:54:21,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:21,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:46 [2018-04-10 16:54:21,994 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 56 treesize of output 50 [2018-04-10 16:54:21,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:54:21,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:22,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:22,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:54:22,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:59 [2018-04-10 16:54:22,080 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 71 treesize of output 57 [2018-04-10 16:54:22,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-10 16:54:22,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:22,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:22,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:54:22,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:74 [2018-04-10 16:54:28,126 WARN L151 SmtUtils]: Spent 2015ms on a formula simplification. DAG size of input: 34 DAG size of output 30 [2018-04-10 16:54:28,175 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 24 treesize of output 14 [2018-04-10 16:54:28,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:28,200 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 46 treesize of output 39 [2018-04-10 16:54:28,202 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:54:28,203 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 25 treesize of output 17 [2018-04-10 16:54:28,203 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:28,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:54:28,211 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:28,215 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:28,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:54:28,223 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:80, output treesize:15 [2018-04-10 16:54:28,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:28,256 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:54:28,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-10 16:54:28,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 16:54:28,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 16:54:28,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=136, Unknown=2, NotChecked=0, Total=182 [2018-04-10 16:54:28,257 INFO L87 Difference]: Start difference. First operand 242 states and 272 transitions. Second operand 14 states. [2018-04-10 16:54:30,447 WARN L151 SmtUtils]: Spent 2029ms on a formula simplification. DAG size of input: 48 DAG size of output 44 [2018-04-10 16:54:31,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:31,234 INFO L93 Difference]: Finished difference Result 535 states and 590 transitions. [2018-04-10 16:54:31,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 16:54:31,234 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-04-10 16:54:31,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:31,237 INFO L225 Difference]: With dead ends: 535 [2018-04-10 16:54:31,237 INFO L226 Difference]: Without dead ends: 535 [2018-04-10 16:54:31,237 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=205, Invalid=495, Unknown=2, NotChecked=0, Total=702 [2018-04-10 16:54:31,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-04-10 16:54:31,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 353. [2018-04-10 16:54:31,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-04-10 16:54:31,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 412 transitions. [2018-04-10 16:54:31,242 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 412 transitions. Word has length 47 [2018-04-10 16:54:31,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:31,242 INFO L459 AbstractCegarLoop]: Abstraction has 353 states and 412 transitions. [2018-04-10 16:54:31,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 16:54:31,242 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 412 transitions. [2018-04-10 16:54:31,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 16:54:31,243 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:31,243 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:31,243 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:31,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1091008627, now seen corresponding path program 1 times [2018-04-10 16:54:31,243 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:31,243 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:31,243 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:31,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:31,244 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:31,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:31,253 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:54:31,253 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:31,253 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:31,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:31,274 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:31,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:54:31,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:31,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:31,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:31,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-10 16:54:31,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:31,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:31,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-10 16:54:31,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-10 16:54:31,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-10 16:54:31,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:31,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:31,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 16:54:31,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 16:54:31,328 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:31,331 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:31,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:31,337 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:34 [2018-04-10 16:54:31,361 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-10 16:54:31,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:54:31,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:31,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:31,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-10 16:54:31,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:54:31,381 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:31,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:31,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:54:31,391 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:60 [2018-04-10 16:54:31,428 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 98 treesize of output 84 [2018-04-10 16:54:31,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-10 16:54:31,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:31,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:31,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2018-04-10 16:54:31,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-10 16:54:31,456 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:31,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:31,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:54:31,471 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:110, output treesize:90 [2018-04-10 16:54:35,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-04-10 16:54:35,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:54:35,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:35,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-04-10 16:54:35,554 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:35,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:35,564 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-10 16:54:35,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 11 treesize of output 3 [2018-04-10 16:54:35,565 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:35,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:54:35,570 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:35,570 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:35,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:35,573 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:65, output treesize:9 [2018-04-10 16:54:35,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:35,596 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:54:35,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-10 16:54:35,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 16:54:35,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 16:54:35,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=142, Unknown=2, NotChecked=0, Total=182 [2018-04-10 16:54:35,596 INFO L87 Difference]: Start difference. First operand 353 states and 412 transitions. Second operand 14 states. [2018-04-10 16:54:36,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:36,422 INFO L93 Difference]: Finished difference Result 595 states and 652 transitions. [2018-04-10 16:54:36,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 16:54:36,422 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-04-10 16:54:36,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:36,424 INFO L225 Difference]: With dead ends: 595 [2018-04-10 16:54:36,424 INFO L226 Difference]: Without dead ends: 595 [2018-04-10 16:54:36,424 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=267, Invalid=723, Unknown=2, NotChecked=0, Total=992 [2018-04-10 16:54:36,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2018-04-10 16:54:36,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 360. [2018-04-10 16:54:36,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-04-10 16:54:36,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 418 transitions. [2018-04-10 16:54:36,430 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 418 transitions. Word has length 47 [2018-04-10 16:54:36,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:36,430 INFO L459 AbstractCegarLoop]: Abstraction has 360 states and 418 transitions. [2018-04-10 16:54:36,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 16:54:36,430 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 418 transitions. [2018-04-10 16:54:36,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-10 16:54:36,431 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:36,431 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-10 16:54:36,431 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:36,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1200582136, now seen corresponding path program 1 times [2018-04-10 16:54:36,432 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:36,432 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:36,432 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:36,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:36,433 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:36,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:36,445 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:54:36,445 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:36,445 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:36,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:36,471 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:36,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:36,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:36,491 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-10 16:54:36,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:36,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:36,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-04-10 16:54:36,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 16:54:36,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-04-10 16:54:36,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:36,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:36,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:36,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-04-10 16:54:36,522 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-04-10 16:54:36,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:54:36,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:36,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:36,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:54:36,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:37 [2018-04-10 16:54:36,553 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2018-04-10 16:54:36,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-10 16:54:36,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:36,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:36,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:54:36,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:52 [2018-04-10 16:54:42,599 WARN L151 SmtUtils]: Spent 2024ms on a formula simplification. DAG size of input: 24 DAG size of output 20 [2018-04-10 16:54:42,626 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 37 treesize of output 25 [2018-04-10 16:54:42,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:54:42,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:42,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-04-10 16:54:42,632 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:42,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:42,635 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-10 16:54:42,635 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:4 [2018-04-10 16:54:42,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:42,651 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:54:42,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-04-10 16:54:42,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 16:54:42,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 16:54:42,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=142, Unknown=2, NotChecked=0, Total=182 [2018-04-10 16:54:42,652 INFO L87 Difference]: Start difference. First operand 360 states and 418 transitions. Second operand 14 states. [2018-04-10 16:54:57,382 WARN L151 SmtUtils]: Spent 2027ms on a formula simplification. DAG size of input: 37 DAG size of output 33 [2018-04-10 16:55:09,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:09,962 INFO L93 Difference]: Finished difference Result 513 states and 564 transitions. [2018-04-10 16:55:09,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 16:55:09,962 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2018-04-10 16:55:09,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:09,963 INFO L225 Difference]: With dead ends: 513 [2018-04-10 16:55:09,963 INFO L226 Difference]: Without dead ends: 503 [2018-04-10 16:55:09,964 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=250, Invalid=608, Unknown=12, NotChecked=0, Total=870 [2018-04-10 16:55:09,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-04-10 16:55:09,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 350. [2018-04-10 16:55:09,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-04-10 16:55:09,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 406 transitions. [2018-04-10 16:55:09,970 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 406 transitions. Word has length 49 [2018-04-10 16:55:09,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:09,970 INFO L459 AbstractCegarLoop]: Abstraction has 350 states and 406 transitions. [2018-04-10 16:55:09,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 16:55:09,970 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 406 transitions. [2018-04-10 16:55:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-10 16:55:09,971 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:09,971 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:09,971 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:55:09,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1441929363, now seen corresponding path program 1 times [2018-04-10 16:55:09,971 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:09,971 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:09,972 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:09,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:55:09,973 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:09,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:10,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 16:55:10,044 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:55:10,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 16:55:10,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 16:55:10,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 16:55:10,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:55:10,045 INFO L87 Difference]: Start difference. First operand 350 states and 406 transitions. Second operand 7 states. [2018-04-10 16:55:10,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:10,210 INFO L93 Difference]: Finished difference Result 365 states and 421 transitions. [2018-04-10 16:55:10,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 16:55:10,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-04-10 16:55:10,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:10,212 INFO L225 Difference]: With dead ends: 365 [2018-04-10 16:55:10,212 INFO L226 Difference]: Without dead ends: 365 [2018-04-10 16:55:10,213 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:55:10,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-04-10 16:55:10,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 355. [2018-04-10 16:55:10,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-04-10 16:55:10,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 411 transitions. [2018-04-10 16:55:10,218 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 411 transitions. Word has length 53 [2018-04-10 16:55:10,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:10,218 INFO L459 AbstractCegarLoop]: Abstraction has 355 states and 411 transitions. [2018-04-10 16:55:10,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 16:55:10,218 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 411 transitions. [2018-04-10 16:55:10,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-10 16:55:10,219 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:10,219 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:10,219 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:55:10,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1874786911, now seen corresponding path program 1 times [2018-04-10 16:55:10,220 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:10,220 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:10,221 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:10,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:55:10,221 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-10 16:55:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-10 16:55:10,258 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-10 16:55:10,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 04:55:10 BoogieIcfgContainer [2018-04-10 16:55:10,290 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 16:55:10,291 INFO L168 Benchmark]: Toolchain (without parser) took 55715.12 ms. Allocated memory was 406.8 MB in the beginning and 752.4 MB in the end (delta: 345.5 MB). Free memory was 340.8 MB in the beginning and 508.4 MB in the end (delta: -167.6 MB). Peak memory consumption was 177.9 MB. Max. memory is 5.3 GB. [2018-04-10 16:55:10,292 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 406.8 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 16:55:10,292 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.52 ms. Allocated memory is still 406.8 MB. Free memory was 340.8 MB in the beginning and 311.7 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 5.3 GB. [2018-04-10 16:55:10,292 INFO L168 Benchmark]: Boogie Preprocessor took 45.36 ms. Allocated memory is still 406.8 MB. Free memory was 311.7 MB in the beginning and 309.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-10 16:55:10,292 INFO L168 Benchmark]: RCFGBuilder took 509.86 ms. Allocated memory was 406.8 MB in the beginning and 600.3 MB in the end (delta: 193.5 MB). Free memory was 309.1 MB in the beginning and 508.7 MB in the end (delta: -199.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 5.3 GB. [2018-04-10 16:55:10,293 INFO L168 Benchmark]: TraceAbstraction took 54889.39 ms. Allocated memory was 600.3 MB in the beginning and 752.4 MB in the end (delta: 152.0 MB). Free memory was 508.7 MB in the beginning and 508.4 MB in the end (delta: 256.6 kB). Peak memory consumption was 152.3 MB. Max. memory is 5.3 GB. [2018-04-10 16:55:10,294 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 406.8 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 267.52 ms. Allocated memory is still 406.8 MB. Free memory was 340.8 MB in the beginning and 311.7 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 45.36 ms. Allocated memory is still 406.8 MB. Free memory was 311.7 MB in the beginning and 309.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 509.86 ms. Allocated memory was 406.8 MB in the beginning and 600.3 MB in the end (delta: 193.5 MB). Free memory was 309.1 MB in the beginning and 508.7 MB in the end (delta: -199.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 54889.39 ms. Allocated memory was 600.3 MB in the beginning and 752.4 MB in the end (delta: 152.0 MB). Free memory was 508.7 MB in the beginning and 508.4 MB in the end (delta: 256.6 kB). Peak memory consumption was 152.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1029]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L991] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={11:0}] [L991] SLL* list = malloc(sizeof(SLL)); VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L992] FCALL list->next = ((void*)0) VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(0) VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] EXPR, FCALL malloc(sizeof(SLL)) VAL [list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner = malloc(sizeof(SLL)) VAL [list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={11:0}, list->inner={9:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner->next = ((void*)0) VAL [list={11:0}, list->inner={9:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={11:0}, list->inner={9:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner->inner = ((void*)0) VAL [list={11:0}, list->inner={9:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={11:0}, list->inner={9:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={11:0}, list->inner={9:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] COND TRUE, EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={11:0}, list->inner={9:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L993] COND FALSE !(0) VAL [list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L995] SLL* end = list; VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1012] COND FALSE !(0) VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; VAL [end={11:0}, len=0, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1017] EXPR, FCALL end->inner VAL [end={11:0}, end->inner={9:0}, len=0, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={11:0}, inner={9:0}, len=0, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={11:0}, inner={9:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={11:0}, inner={9:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1024] COND FALSE !(0) VAL [end={11:0}, inner={9:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1025] EXPR, FCALL inner->inner VAL [end={11:0}, inner={9:0}, inner->inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1025] COND FALSE !(0) VAL [end={11:0}, inner={9:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1026] EXPR, FCALL inner->next VAL [end={11:0}, inner={9:0}, inner->next={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1026] COND FALSE !(0) VAL [end={11:0}, inner={9:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1027] EXPR, FCALL inner->inner VAL [end={11:0}, inner={9:0}, inner->inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1027] inner = inner->inner [L1028] COND TRUE len == 1 VAL [end={11:0}, inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1029] FCALL inner->inner - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 192 locations, 65 error locations. UNSAFE Result, 54.8s OverallTime, 23 OverallIterations, 2 TraceHistogramMax, 35.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3840 SDtfs, 8473 SDslu, 11234 SDs, 0 SdLazy, 7622 SolverSat, 373 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 548 GetRequests, 307 SyntacticMatches, 3 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 42.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=360occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 2213 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 18.6s InterpolantComputationTime, 1162 NumberOfCodeBlocks, 1162 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 708 ConstructedInterpolants, 95 QuantifiedInterpolants, 362140 SizeOfPredicates, 87 NumberOfNonLiveVariables, 1311 ConjunctsInSsa, 190 ConjunctsInUnsatCore, 22 InterpolantComputations, 21 PerfectInterpolantSequences, 6/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_16-55-10-300.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_16-55-10-300.csv Received shutdown request...